Homogeneous Function
Summary: A function of is homogeneous of degree if every term has the same total degree . This extends cleanly to rational (), irrational ( has degree ), and implicit algebraic cases. Euler’s central theorem (§88): under , any bivariate homogeneous function of degree becomes ; degree zero means is a function of alone. Every bivariate homogeneous polynomial factors into linear pieces , a property that fails in three or more variables.
Sources: chapter5
Last updated: 2026-04-23
Degree
A variable has degree 1; a constant has degree 0; the degree of a product is the sum of degrees. So are degree 1; are degree 2; and so on (source: chapter5, §83).
A homogeneous function is one in which every term has the same degree. A heterogeneous function is one with at least two different degrees among its terms — see heterogeneous-function.
Polynomial case (§84)
Homogeneous polynomials in of each degree have the obvious general form:
Constant functions count as degree zero (source: chapter5, §84).
Rational case (§85)
A rational function is homogeneous iff both and are homogeneous, and its degree is . Negative and zero degrees are admitted (source: chapter5, §85):
| function | degree |
|---|---|
| 1 | |
| 3 | |
| 0 | |
Sums of homogeneous pieces of matching degree are again homogeneous of that degree: has degree 1 throughout.
Irrational case (§86)
If is homogeneous of degree , then is homogeneous of degree (source: chapter5, §86). Examples:
- has degree 1.
- has degree 3.
- has degree 1.
- has degree 0.
Euler’s sample worked expression
is homogeneous of degree : each of the four summands evaluates to degree under the rules.
Implicit case (§87)
If satisfies the polynomial equation
with polynomials in , then is homogeneous of degree iff
— i.e. each coefficient carries exactly the degree needed so every term of the equation is of total degree (source: chapter5, §87). Example: has homogeneous of degree 2.
§88 — Euler’s reduction theorem
Theorem. If is homogeneous of degree , then under ,
Argument. Every term of has joint degree in . Replacing by converts joint degree into degree in alone, so each term acquires the factor , leaving a function of (source: chapter5, §88).
Euler checks the three cases:
- Polynomial. .
- Rational. (degree ) .
- Irrational. (degree ) .
This theorem is the theoretical foundation for the parametrization trick Euler used empirically in Chapter 3 — see homogeneous-substitution.
§89 — Degree zero
If , the factor vanishes from the expression, so
(source: chapter5, §89). Examples:
- .
- .
§90–§91 — Linear factorization in two variables
Theorem. A homogeneous polynomial of degree in factors as a product of linear pieces (with real or complex coefficients) (source: chapter5, §90–§91).
Proof. By §88, the polynomial becomes after . By the fundamental-theorem-of-algebra, factors into linear pieces ; multiplying each by recovers , giving factors in the original variables.
Corollaries:
- has two linear factors.
- has three.
- Every homogeneous bivariate polynomial is reducible.
This fails in three or more variables. The general degree-2 homogeneous form does not generally split as , and the situation is worse for higher degree (source: chapter5, §91).
Why this matters
The reduction is Euler’s first structure theorem for multivariate functions. It separates scale (the factor) from shape (the profile ), and it reduces the study of homogeneous bivariate functions to single-variable analysis. Geometrically it corresponds to projecting the locus from the origin — every line through the origin intersects the curve in a finite set, parametrized by the ratio . This is the algebraic shadow of projective geometry, and it is the reason the substitution trick of Chapter 3 works for curves like the folium-of-descartes.
In modern language, §88 says a homogeneous function on of degree is determined by its restriction to the line (i.e. by the profile ) together with its degree. The degree-zero case §89 is the same as saying degree-zero functions descend to functions on the projective line .