Chapter 5: On Functions of Two or More Variables
Summary: Euler generalizes the single-variable framework of Chapters 1–4 to functions of several independent variables, carries the algebraic/transcendental classification over verbatim, and introduces the central new concept — homogeneous functions — together with the substitution that reduces every bivariate homogeneous function of degree to .
Sources: chapter5
Last updated: 2026-04-23
Overview
Through Chapter 4 every “variable” had implicitly been a function of a single independent . Chapter 5 (§77) declares the opposite setting: several quantities may vary independently, and an expression built from them is a function of several variables (source: chapter5, §77–§78). A function of variables admits an “infinity of infinite determinations” — one chooses one variable and still has a full -dimensional freedom (source: chapter5, §78). See functions-of-several-variables.
The old classification — algebraic vs. transcendental, with algebraic split into polynomial, rational, and irrational — transfers without change (§79–§80). Multi-valuedness is still defined by single-valued coefficients in a polynomial equation (§81). Setting a multivariate function equal to zero (or a constant, or another function) implicitly defines each variable as a function of the rest — Euler’s first statement of the implicit-function-and-equation-counting idea and the “count equations, count dependent variables” heuristic (§82).
The substantive new material is the theory of homogeneous-functions (§83–§91), together with its counterparts for heterogeneous-functions (§92–§93) and the classification of polynomials by order and reducibility (§94–§95). The key theorem, §88, shows that every homogeneous function of degree in two variables is — the theoretical foundation for the homogeneous-substitution trick Euler used empirically in Chapter 3.
See also: functions-of-several-variables, implicit-function-and-equation-counting, homogeneous-function, heterogeneous-function, order-of-a-polynomial, reducible-polynomial.
Structure of the chapter
§77–§78 — Independent variables and functions of several variables
Up to now every “variable” was secretly a function of one (source: chapter5, §77). Now may take values independently: fixing leaves the rest “completely unrestricted.” A function of several variables is any expression composed from them — e.g. is a function of ; fix and it becomes a function of ; fix and and it becomes a function of (source: chapter5, §78). The admissible values of an -variable function form an “infinity of infinite determinations” of multiplicity .
§79–§80 — Classification carries over
The algebraic/transcendental split is the same as in Chapter 1 (see classification-of-functions). A transcendental operation in a multivariate function may involve all, some, or only one of the variables — e.g. is transcendental in jointly, but becomes algebraic in once is fixed (source: chapter5, §79). Algebraic functions split into irrational and non-irrational; the latter into polynomials (no variable in a denominator) and rationals (ratio of polynomials) (source: chapter5, §80). Irrational functions may be explicit (a radical sign) or implicit (given by an unsolvable polynomial equation), e.g. .
§81 — Multi-valued functions
Multi-valuedness is defined exactly as in Chapter 1 (see single-valued-and-multi-valued-functions): is -valued if with single-valued (source: chapter5, §81). Non-irrational functions are automatically single-valued.
§82 — Implicit definition from equations
Setting a function of and equal to zero makes each of a function of the other — previously independent, now tied. The same works if the function equals a constant, or equals another function. Extending: one equation in three variables makes any one of them a function of the remaining two; two equations define a pair of variables as functions of the rest; in general the number of equations determines the number of functions defined (source: chapter5, §82). This is Euler’s first statement of the implicit-function-and-equation-counting principle.
§83 — Homogeneous vs. heterogeneous
A function is homogeneous if every term has the same total degree, heterogeneous if different degrees appear. Each variable counts for one degree; constants count for zero; products of variables (repeats allowed) count for degree . So have degree 1; have degree 2; and so on (source: chapter5, §83). See homogeneous-function.
§84–§85 — Polynomial and rational cases
Homogeneous polynomials of given degree have the obvious form: (degree 1); (degree 2); etc. A constant function counts as degree zero (source: chapter5, §84).
A rational function is homogeneous if both and are, with degree . Negative and zero degrees are admitted: has degree , has degree , has degree , and has degree 0 (source: chapter5, §85).
§86 — Irrational case
The degree extends to irrational functions by the rule: if is homogeneous of degree , then is homogeneous of degree (source: chapter5, §86). So has degree 1; has degree 3; has degree 1; has degree ; and so forth. Sums and ratios of homogeneous pieces of matching degree are again homogeneous of that degree.
§87 — Implicit irrational case
If satisfies with polynomials in , then is homogeneous (of some degree ) iff has degree , has degree , has degree , etc. — each coefficient matches the degree required for the whole equation to be homogeneous (source: chapter5, §87). Example: has homogeneous of degree 2.
§88 — Euler’s reduction
Theorem. If is homogeneous of degree in , then under one has
Proof sketch. Every term of has total degree in ; replacing by converts joint degree into degree in alone, so each term carries a factor (source: chapter5, §88). Euler checks all three cases:
- Polynomial: .
- Rational: .
- Irrational: .
This theorem is the theoretical backbone of the homogeneous-substitution trick from Chapter 3, §52–§58.
§89 — Degree zero: a function of one variable
When , the factor drops out: a homogeneous function of degree zero in is a function of alone (source: chapter5, §89). Example: ; .
§90–§91 — Homogeneous bivariate polynomials factor linearly
A homogeneous polynomial of degree in factors as the product of linear pieces (real or complex) (source: chapter5, §90–§91). Proof. After , the polynomial becomes times a polynomial in alone, which factors into linear pieces ; multiplying each by gives .
Thus every homogeneous polynomial of degree in two variables is reducible, a product of the right number of linear factors.
This property fails in three or more variables. The general homogeneous degree-2 form in three variables, , does not generally factor as (source: chapter5, §91).
§92 — Heterogeneous functions; bifid, trifid, …
Heterogeneous functions are classified by how many distinct degrees occur among their terms. A bifid function has two: e.g. splits as (degree-5 part) + (degree-2 part). A trifid has three: e.g. has parts of degrees 6, 4, 1. Some rational or irrational functions cannot be cleanly split this way at all — e.g. (source: chapter5, §92).
§93 — Reducing heterogeneous to homogeneous by substitution
Sometimes a substitution makes a heterogeneous function homogeneous. Examples (source: chapter5, §93):
- under becomes — homogeneous of degree 5 in .
- under becomes — homogeneous of degree 1.
No general criterion is given; Euler is content with examples.
§94 — Order of a polynomial
The order of a polynomial is the greatest degree of any single term. So is of order 2 (even though the constant term has degree 0), and is of order 4 (source: chapter5, §94). Order is the classification relevant to the study of algebraic curves.
§95 — Reducible and irreducible polynomials
A polynomial is reducible if it is a product of two or more non-irrational factors, irreducible otherwise. Example: . By §91, every homogeneous bivariate polynomial is reducible. In contrast, is irreducible. Reducibility is decided by examining divisors (source: chapter5, §95). See reducible-polynomial.
Notable points
- §77 marks a conceptual shift. The single-variable setting of Chapters 1–4 was implicitly a curve: one parameter, one-dimensional image. Several variables means several degrees of freedom — surfaces and higher — and the rest of Book I and Book II will develop both the algebraic theory (here and in later chapters) and the geometric applications to curves and surfaces.
- §82 is the first place in the Introductio where Euler states, in passing, the equation-counting rule: equations in variables leave free. The notion of “implicit function” is still informal — there is no discussion of when the resulting map is well defined or single-valued.
- §88 is the payoff. The reason the homogeneous-substitution in §52–§58 worked is that it produced rational — exactly what §88 guarantees. Euler now has the theorem under his belt: in Chapter 3 he used it as a procedure; here he names it.
- §91’s observation that bivariate homogeneous polynomials factor completely into linear factors, but trivariate ones do not, is an early piece of geometric intuition: a homogeneous polynomial in two variables cuts out a finite set of lines through the origin, while a homogeneous polynomial in three variables cuts out a projective curve, which need not split.
- §92–§93 are comparatively unsystematic — Euler records the classes without developing them further. The distinction will return when he studies algebraic curves by their equations of given order.
Why this chapter matters
Chapter 5 is short but structurally pivotal. It sets up the multivariate framework every later chapter on curves and surfaces will assume, and it supplies the missing theorem — the reduction for homogeneous functions — that retroactively justifies the parametrization tricks of Chapter 3. The classifications introduced here (homogeneous/heterogeneous, order, reducibility) become the working vocabulary for the algebraic theory of curves that occupies much of the remainder of Book I.
Related pages
- functions-of-several-variables
- implicit-function-and-equation-counting
- homogeneous-function
- heterogeneous-function
- order-of-a-polynomial
- reducible-polynomial
- homogeneous-substitution
- classification-of-functions
- single-valued-and-multi-valued-functions
- chapter-3-on-the-transformation-of-functions-by-substitution