How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Total Derivative in
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Filters and Ultrafilters
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The total derivative is a linear approximation whose error is small compared with the Euclidean size of the increment. This page begins with a native Euclidean definition of a linear map and its matrix/norm bound, then uses the existing Euclidean norm, vector-valued limits, and one-variable mean-value inequality to keep the approximation quantitative.
After uniqueness, the definition yields continuity, directional derivatives, partial derivatives, the Jacobian, and the gradient formula. The linear approximation obeys sum and chain rules. A coordinate-telescoping argument turns continuous partial derivatives into total differentiability, while the segment argument gives the mean-value inequality and constancy from a zero derivative on a convex open set.
3 · Logical flowchart
4 · Definitions, theorems and proofs
A linear map in Euclidean coordinates
Definition
Let . A map is linear when
for all and all . Both spaces carry their Euclidean vector-space operations and Euclidean norms from The Euclidean inner product on .
Remarks
This is the concrete Euclidean notion required for total differentiation. It makes no assertion about linear maps between arbitrary vector spaces.
Every Euclidean linear map has a unique matrix and satisfies for some
Statement
For every linear there is a unique matrix such that . Moreover there is with for every .
Facts & Assumptions
Given: A Euclidean linear map .
The coordinate list of with respect to the ordered basis is its ordinary coordinate list, and (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The Euclidean norm of is , and it is a norm (The Euclidean inner product on ).
Proof
Put . By [L1] and linearity, , so .
The columns determine every value in step 1.1, and evaluating the displayed formula at shows that every representing matrix has exactly these entries; thus the matrix is unique.
Let . Cauchy--Schwarz [L3] in each row and summing gives , hence .
A convex subset of contains every line segment between two of its points
Definition
A subset is convex when, for all and (Intervals of : the nine order-convex forms, nondegeneracy, and length), the point lies in . Thus the full line segment from to remains in .
Directional derivatives and partial derivatives of a map
Definition
Let , , , and . If the line map is defined near , its derivative at is the directional derivative
For a standard basis vector (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ), is the th partial derivative, written . These are ordinary vector-valued one-variable derivatives in the sense of The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral.
The total (Fréchet) derivative as the linear first-order approximation with remainder
Definition
Let be open, let , and let . The map is totally differentiable at when there is a linear map (A linear map in Euclidean coordinates) such that
where the quotient is considered for with . The map , when it exists, is denoted and called the total derivative. Equivalently, with .
The total derivative at a point is unique
Statement
If both satisfy the total-differentiability remainder condition for at , then .
Facts & Assumptions
Given: Linear maps which both satisfy the definition of total derivative at .
In the total-derivative definition, the normalized remainder tends to zero as tends to zero (The total (Fréchet) derivative as the linear first-order approximation with remainder).
Proof
Subtracting the two remainder identities gives as .
For any fixed and nonzero real , linearity gives when .
Letting in step 2.1 forces for every nonzero , and it is also zero at ; hence .
Total differentiability gives a local increment bound and therefore continuity
Statement
If is totally differentiable at , then some satisfy whenever and . In particular is continuous at .
Facts & Assumptions
Given: A total derivative for at .
The normalized remainder in the total-derivative definition tends to zero as tends to zero (The total (Fréchet) derivative as the linear first-order approximation with remainder).
Every Euclidean linear map has a norm bound for some (Every Euclidean linear map has a unique matrix and satisfies for some ).
Proof
By [L1], choose such that the remainder satisfies whenever .
If bounds as in [L2], the triangle inequality gives for those , and it also holds at .
Given , take ; step 2.1 is the metric continuity condition at .
The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
Definition
If every partial derivative of exists, the Jacobian matrix is . For scalar-valued , its gradient is
with coordinates understood in the standard basis (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ). The partial derivatives are those of Directional derivatives and partial derivatives of a map .
A total derivative computes every directional derivative, and its matrix is the Jacobian
Statement
If is totally differentiable at , then exists for every and equals . In particular , and the matrix of is .
Facts & Assumptions
Given: A total derivative and a direction .
In the total-derivative definition, the normalized remainder tends to zero as tends to zero (The total (Fréchet) derivative as the linear first-order approximation with remainder).
The directional derivative is the derivative of at zero, and partial derivatives use standard-basis directions (Directional derivatives and partial derivatives of a map ).
Proof
For , write , where by [L1].
Dividing by gives , and ; hence [L2] yields .
Taking identifies the th column of the matrix of with the vector of th partial derivatives, which is precisely the Jacobian.
For a differentiable scalar field, and the unit direction of steepest ascent is the normalized gradient
Statement
If a scalar-valued is totally differentiable at , then for every . Among unit vectors , this is at most ; if the gradient is nonzero, equality holds exactly in the direction . If the gradient is zero, every unit direction has directional derivative zero.
Facts & Assumptions
Given: A scalar-valued totally differentiable at and a direction .
A total derivative computes every directional derivative, and its matrix is the Jacobian (A total derivative computes every directional derivative, and its matrix is the Jacobian).
Proof
By [L1], is the Jacobian row applied to , namely .
If and , [L2] gives , with equality at .
If , step 1.1 makes every directional derivative zero; together with step 2.1 this proves the stated alternatives.
Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives
Statement
If are totally differentiable at and , then and are totally differentiable at , with
Facts & Assumptions
Given: Total first-order expansions for and at .
In the total-derivative definition, the normalized remainder tends to zero as tends to zero (The total (Fréchet) derivative as the linear first-order approximation with remainder).
A norm satisfies the triangle inequality and (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).
Proof
Add the two expansions and multiply the first by to obtain remainders for and for , with the displayed candidate linear maps.
By [L2], is bounded by the sum of two quantities tending to zero, and tends to zero (also when ).
Sums and scalar multiples of linear maps are linear, so step 2.1 verifies the definition with exactly the two stated derivatives.
The chain rule for total derivatives:
Statement
Let be totally differentiable at and let be totally differentiable at . Then is totally differentiable at and
Facts & Assumptions
Given: The total first-order expansions of at and at .
In the total-derivative definition, the normalized remainder tends to zero as tends to zero (The total (Fréchet) derivative as the linear first-order approximation with remainder).
Total differentiability gives a local increment bound and therefore continuity (Total differentiability gives a local increment bound and therefore continuity).
Proof
Write and , with both normalized remainders tending to zero.
By [L2], ; boundedness of and the two remainder limits show both and are , including the case .
Substitution into the two expansions leaves , and the composite of linear maps is linear.
Small coordinate-by-coordinate increments stay inside a Euclidean ball and telescope the total increment
Statement
Let and let . Define and for . Then every lies in , , and for every map on ,
Facts & Assumptions
Given: The displayed ball, vector , and coordinate-prefix points .
The coordinate list of with respect to the ordered basis is its ordinary coordinate list (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The Euclidean norm of is (The Euclidean inner product on ).
Proof
The standard-basis coordinate formula makes , while has coordinates for and otherwise.
Hence , so every prefix point is in .
Summing cancels all intermediate values and leaves .
If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative
Statement
Let be open and let . Suppose every partial derivative exists on a neighbourhood of and is continuous at . Then is totally differentiable at , and is the linear map with matrix .
Facts & Assumptions
Given: The stated neighbourhood existence and continuity hypotheses for all vector partial derivatives.
Coordinate-by-coordinate increments stay inside a Euclidean ball and telescope the total increment (Small coordinate-by-coordinate increments stay inside a Euclidean ball and telescope the total increment).
The vector mean-value inequality says on a real interval when the derivative norm is bounded by (The mean value inequality: if is continuous and differentiable on with , then ).
Proof
Choose a ball around on which the partial derivatives exist. Given , continuity at gives a smaller ball on which every .
For in that smaller ball, [L1] writes the increment as coordinate segments. On each segment apply [L2] to the one-variable map obtained after subtracting the fixed linear term ; its derivative norm is at most .
Summing the segment bounds gives . Since is arbitrary, the normalized remainder tends to zero and is .
On a convex open set, a uniform bound implies
Statement
Let be convex and open, and let be totally differentiable at every point. If satisfies for every and , then
Facts & Assumptions
Given: The stated convex open domain, total differentiability, and uniform derivative bound.
A convex subset contains every line segment between two of its points (A convex subset of contains every line segment between two of its points).
The chain rule for total derivatives is (The chain rule for total derivatives: ).
The vector mean-value inequality gives when the derivative norm is bounded by (The mean value inequality: if is continuous and differentiable on with , then ).
Total differentiability implies continuity at the point of total differentiability (Total differentiability gives a local increment bound and therefore continuity).
Proof
If the conclusion is immediate. Otherwise put for ; [L1] keeps in .
The chain rule gives for , whose norm is at most by hypothesis.
By [L4] the curve is continuous at the endpoints, so [L3] applied on yields .
A totally differentiable map with zero derivative on a convex open set is constant
Statement
Let be convex and open. If is totally differentiable at every point and for every , then is constant on .
Facts & Assumptions
Given: A convex open and a totally differentiable map with zero total derivative at every point.
The total-derivative mean-value inequality implies under a uniform derivative bound (On a convex open set, a uniform bound implies ).
Proof
The zero derivative hypothesis satisfies the bound in [L1] with for arbitrary .
Hence , so norm separation gives .
Since were arbitrary, the map is constant; if is empty this conclusion is vacuous.
Dimension, openness, norm, Jacobian, and the native Euclidean linear-map agreement seam
The derivative definition is stated on open Euclidean domains so every sufficiently small increment is admissible. Its remainder uses the Euclidean norm; in finite-dimensional Euclidean spaces an equivalent norm would give the same differentiability notion, but that change is not part of this definition.
The linear-map definition on this page is deliberately the concrete Euclidean special case identified in Conventions of this page, the standing hypothesis, and what is taken up elsewhere in the reading order. A future general linear-map development must prove agreement with A linear map in Euclidean coordinates, not silently replace the meaning of .
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.