Alphabeta Math
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.

✓ 11 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 11 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Total Derivative in Rm→Rn

1 · Prerequisites

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

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-02Open item page →

A linear map L:Rm→Rn in Euclidean coordinates

Definition

Let m,n≥1. A map L:Rm→Rn is linear when

L(αu+βv)=αL(u)+βL(v)

for all u,v∈Rm and all α,β∈R. Both spaces carry their Euclidean vector-space operations and Euclidean norms from The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

Remarks

This is the concrete Euclidean notion required for total differentiation. It makes no assertion about linear maps between arbitrary vector spaces.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0

Statement

For every linear L:Rm→Rn there is a unique matrix A=(aij)i<n,j<m such that (Lh)i=∑j<maijhj. Moreover there is K≥0 with ∥Lh∥2≤K∥h∥2 for every h.

Facts & Assumptions

Given: A Euclidean linear map L:Rm→Rn.

[L1]
[L2]

The Euclidean norm of x is ∥x∥2=∑i<nxi2, and it is a norm (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Proof

technique · direct
1.1

Put aij:=(Lej)i. By [L1] and linearity, Lh=L(∑j<mhjej)=∑j<mhjLej, so (Lh)i=∑j<maijhj.

L1L2
2.1

The columns Lej determine every value in step 1.1, and evaluating the displayed formula at ej shows that every representing matrix has exactly these entries; thus the matrix is unique.

step 1.1L2algebra
3.1

Let K=(∑i<n,j<maij2)1/2. Cauchy--Schwarz [L3] in each row and summing gives ∥Lh∥22≤K2∥h∥22, hence ∥Lh∥2≤K∥h∥2.

step 1.1step 2.1L3∎
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-02Open item page →

A convex subset of Rm contains every line segment between two of its points

Definition

A subset U⊆Rm is convex when, for all x,y∈U and t∈[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length), the point (1−t)x+ty lies in U. Thus the full line segment from x to y remains in U.

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-02Open item page →

Directional derivatives and partial derivatives of a map U⊆Rm→Rn

Definition

Let U⊆Rm, a∈U, v∈Rm, and f:U→Rn. If the line map t↦f(a+tv) is defined near 0, its derivative at 0 is the directional derivative

Dvf(a):=lim⁡t→0f(a+tv)−f(a)t.

For a standard basis vector ej (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0), Dejf(a) is the jth partial derivative, written ∂jf(a). 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.

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-02Open item page →

The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder

Definition

Let U⊆Rm be open, let a∈U, and let f:U→Rn. The map f is totally differentiable at a when there is a linear map L:Rm→Rn (A linear map L:Rm→Rn in Euclidean coordinates) such that

lim⁡h→0∥f(a+h)−f(a)−Lh∥2∥h∥2=0,

where the quotient is considered for h≠0 with a+h∈U. The map L, when it exists, is denoted Df(a) and called the total derivative. Equivalently, f(a+h)=f(a)+Df(a)h+r(h) with ∥r(h)∥2/∥h∥2→0.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

The total derivative at a point is unique

Statement

If L,M:Rm→Rn both satisfy the total-differentiability remainder condition for f at a, then L=M.

Facts & Assumptions

Given: Linear maps L,M which both satisfy the definition of total derivative at a.

[L1]

In the total-derivative definition, the normalized remainder tends to zero as h tends to zero (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

Proof

technique · direct
1.1

Subtracting the two remainder identities gives ∥(L−M)h∥2/∥h∥2→0 as h→0.

L1
2.1

For any fixed v∈Rm and nonzero real t, linearity gives ∥(L−M)(tv)∥2/∥tv∥2=∥(L−M)v∥2/∥v∥2 when v≠0.

step 1.1algebra
3.1

Letting t→0 in step 2.1 forces (L−M)v=0 for every nonzero v, and it is also zero at v=0; hence L=M.

step 1.1step 2.1∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

Total differentiability gives a local O(∥h∥2) increment bound and therefore continuity

Statement

If f:U→Rn is totally differentiable at a∈U, then some C,δ>0 satisfy ∥f(a+h)−f(a)∥2≤C∥h∥2 whenever ∥h∥2<δ and a+h∈U. In particular f is continuous at a.

Facts & Assumptions

Given: A total derivative Df(a) for f at a.

[L1]

The normalized remainder in the total-derivative definition tends to zero as h tends to zero (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[L2]

Every Euclidean linear map has a norm bound ∥Lh∥2≤K∥h∥2 for some K≥0 (Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0).

Proof

technique · direct
1.1

By [L1], choose δ>0 such that the remainder r(h)=f(a+h)−f(a)−Df(a)h satisfies ∥r(h)∥2≤∥h∥2 whenever 0<∥h∥2<δ.

L1L2
2.1

If K bounds Df(a) as in [L2], the triangle inequality gives ∥f(a+h)−f(a)∥2≤(K+1)∥h∥2 for those h, and it also holds at h=0.

step 1.1L2algebra
3.1

Given ε>0, take ∥h∥2<min⁡{δ,ε/(K+1)}; step 2.1 is the metric continuity condition at a.

step 1.1step 2.1∎
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-02Open item page →

The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case

Definition

If every partial derivative ∂jfi(a) of f:U→Rn exists, the Jacobian matrix is Jf(a)=(∂jfi(a))i<n,j<m. For scalar-valued f, its gradient is

∇f(a):=(∂0f(a),…,∂m−1f(a))∈Rm,

with coordinates understood in the standard basis (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0). The partial derivatives are those of Directional derivatives and partial derivatives of a map U⊆Rm→Rn.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

A total derivative computes every directional derivative, and its matrix is the Jacobian

Statement

If f:U→Rn is totally differentiable at a, then Dvf(a) exists for every v∈Rm and equals Df(a)v. In particular ∂jf(a)=Df(a)ej, and the matrix of Df(a) is Jf(a).

Facts & Assumptions

Given: A total derivative Df(a) and a direction v∈Rm.

[L1]

In the total-derivative definition, the normalized remainder tends to zero as h tends to zero (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[L2]

The directional derivative is the derivative of t↦f(a+tv) at zero, and partial derivatives use standard-basis directions (Directional derivatives and partial derivatives of a map U⊆Rm→Rn).

Proof

technique · direct
1.1

For t≠0, write f(a+tv)−f(a)=tDf(a)v+r(tv), where ∥r(tv)∥2/∥tv∥2→0 by [L1].

L1L2
2.1

Dividing by t gives (f(a+tv)−f(a))/t=Df(a)v+r(tv)/t, and ∥r(tv)/t∥2=∥v∥2 ∥r(tv)∥2/∥tv∥2→0; hence [L2] yields Dvf(a)=Df(a)v.

step 1.1L2algebra
3.1

Taking v=ej identifies the jth column of the matrix of Df(a) with the vector of jth partial derivatives, which is precisely the Jacobian.

step 1.1step 2.1∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

For a differentiable scalar field, Dvf(a)=⟨∇f(a),v⟩ and the unit direction of steepest ascent is the normalized gradient

Statement

If a scalar-valued f:U→R is totally differentiable at a, then Dvf(a)=⟨∇f(a),v⟩ for every v. Among unit vectors v, this is at most ∥∇f(a)∥2; if the gradient is nonzero, equality holds exactly in the direction ∇f(a)/∥∇f(a)∥2. If the gradient is zero, every unit direction has directional derivative zero.

Facts & Assumptions

Given: A scalar-valued totally differentiable f at a and a direction v.

[L1]

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

technique · cases
1.1

By [L1], Dvf(a) is the Jacobian row applied to v, namely ∑j∂jf(a)vj=⟨∇f(a),v⟩.

L1L2
2.1

If ∇f(a)≠0 and ∥v∥2=1, [L2] gives Dvf(a)≤∥∇f(a)∥2, with equality at v=∇f(a)/∥∇f(a)∥2.

assume-case nonzerostep 1.1L2algebra
3.1

If ∇f(a)=0, step 1.1 makes every directional derivative zero; together with step 2.1 this proves the stated alternatives.

assume-case zerostep 1.1step 2.1cases-exhaustive∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives

Statement

If f,g:U→Rn are totally differentiable at a and c∈R, then f+g and cf are totally differentiable at a, with

D(f+g)(a)=Df(a)+Dg(a),D(cf)(a)=cDf(a).

Facts & Assumptions

Given: Total first-order expansions for f and g at a.

[L1]

In the total-derivative definition, the normalized remainder tends to zero as h tends to zero (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[L2]

A norm satisfies the triangle inequality and ∥cw∥=∣c∣ ∥w∥ (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Proof

technique · direct
1.1

Add the two expansions and multiply the first by c to obtain remainders rf+rg for f+g and crf for cf, with the displayed candidate linear maps.

L1L2
2.1

By [L2], ∥rf(h)+rg(h)∥2/∥h∥2 is bounded by the sum of two quantities tending to zero, and ∥crf(h)∥2/∥h∥2=∣c∣ ∥rf(h)∥2/∥h∥2 tends to zero (also when c=0).

step 1.1L2algebra
3.1

Sums and scalar multiples of linear maps are linear, so step 2.1 verifies the definition with exactly the two stated derivatives.

step 1.1step 2.1∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

Statement

Let f:U→V⊆Rn be totally differentiable at a∈U and let g:V→Rp be totally differentiable at f(a). Then g∘f is totally differentiable at a and

D(g∘f)(a)=Dg(f(a))∘Df(a).

Facts & Assumptions

Given: The total first-order expansions of f at a and g at f(a).

[L1]

In the total-derivative definition, the normalized remainder tends to zero as h tends to zero (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[L2]

Total differentiability gives a local O(∥h∥2) increment bound and therefore continuity (Total differentiability gives a local O(∥h∥2) increment bound and therefore continuity).

Proof

technique · direct
1.1

Write f(a+h)=f(a)+Df(a)h+rf(h) and g(f(a)+k)=g(f(a))+Dg(f(a))k+rg(k), with both normalized remainders tending to zero.

L1L2
2.1

By [L2], k=f(a+h)−f(a)=O(∥h∥2); boundedness of Dg(f(a)) and the two remainder limits show both Dg(f(a))rf(h) and rg(k) are o(∥h∥2), including the case k=0.

step 1.1L2algebra
3.1

Substitution into the two expansions leaves g(f(a+h))−g(f(a))−Dg(f(a))Df(a)h=o(∥h∥2), and the composite of linear maps is linear.

step 1.1step 2.1∎
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

Small coordinate-by-coordinate increments stay inside a Euclidean ball and telescope the total increment

Statement

Let B(a,r)⊆U⊆Rm and let ∥h∥2<r. Define p0=a and pj=a+∑i<jhiei for 1≤j≤m. Then every pj lies in B(a,r), pm=a+h, and for every map f on U,

f(a+h)−f(a)=∑j<m(f(pj+1)−f(pj)).

Facts & Assumptions

Given: The displayed ball, vector h, and coordinate-prefix points pj.

[L2]

The Euclidean norm of x is ∥x∥2=∑i<nxi2 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Proof

technique · direct
1.1

The standard-basis coordinate formula makes pm=a+h, while pj−a has coordinates hi for i<j and 0 otherwise.

L1L2
2.1

Hence ∥pj−a∥22=∑i<jhi2≤∑i<mhi2=∥h∥22<r2, so every prefix point is in B(a,r).

step 1.1L2algebra
3.1

Summing f(pj+1)−f(pj) cancels all intermediate values and leaves f(pm)−f(p0)=f(a+h)−f(a).

step 1.1step 2.1∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

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 U⊆Rm be open and let f:U→Rn. Suppose every partial derivative ∂jf exists on a neighbourhood of a∈U and is continuous at a. Then f is totally differentiable at a, and Df(a) is the linear map with matrix Jf(a).

Facts & Assumptions

Given: The stated neighbourhood existence and continuity hypotheses for all vector partial derivatives.

[L1]

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).

[L2]

The vector mean-value inequality says ∥f(b)−f(a)∥2≤M(b−a) on a real interval when the derivative norm is bounded by M (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)).

Proof

technique · direct
1.1

Choose a ball around a on which the partial derivatives exist. Given ε>0, continuity at a gives a smaller ball on which every ∥∂jf(z)−∂jf(a)∥2<ε/m.

L1L2
2.1

For h 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 Jf(a); its derivative norm is at most ε/m.

step 1.1L2algebra
3.1

Summing the segment bounds gives ∥f(a+h)−f(a)−Jf(a)h∥2≤(ε/m)∑j∣hj∣≤ε∥h∥2/m≤ε∥h∥2. Since ε is arbitrary, the normalized remainder tends to zero and Jf(a) is Df(a).

step 1.1step 2.1L3∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

On a convex open set, a uniform bound ∥Df(z)v∥2≤M∥v∥2 implies ∥f(y)−f(x)∥2≤M∥y−x∥2

Statement

Let U⊆Rm be convex and open, and let f:U→Rn be totally differentiable at every point. If M≥0 satisfies ∥Df(z)v∥2≤M∥v∥2 for every z∈U and v∈Rm, then

∥f(y)−f(x)∥2≤M∥y−x∥2(x,y∈U).

Facts & Assumptions

Given: The stated convex open domain, total differentiability, and uniform derivative bound.

[L1]

A convex subset contains every line segment between two of its points (A convex subset of Rm contains every line segment between two of its points).

[L2]

The chain rule for total derivatives is D(g∘f)(a)=Dg(f(a))∘Df(a) (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[L3]

The vector mean-value inequality gives ∥f(b)−f(a)∥2≤M(b−a) when the derivative norm is bounded by M (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)).

[L4]

Total differentiability implies continuity at the point of total differentiability (Total differentiability gives a local O(∥h∥2) increment bound and therefore continuity).

Proof

technique · direct
1.1

If x=y the conclusion is immediate. Otherwise put γ(t)=x+t(y−x) for 0≤t≤1; [L1] keeps γ([0,1]) in U.

L1L2L3
2.1

The chain rule gives (f∘γ)′(t)=Df(γ(t))(y−x) for 0<t<1, whose norm is at most M∥y−x∥2 by hypothesis.

step 1.1L2algebra
3.1

By [L4] the curve f∘γ is continuous at the endpoints, so [L3] applied on [0,1] yields ∥f(y)−f(x)∥2≤M∥y−x∥2.

step 1.1step 2.1L3L4∎
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02Open item page →

A totally differentiable map with zero derivative on a convex open set is constant

Statement

Let U⊆Rm be convex and open. If f:U→Rn is totally differentiable at every point and Df(z)=0 for every z∈U, then f is constant on U.

Facts & Assumptions

Given: A convex open U and a totally differentiable map with zero total derivative at every point.

[L1]

The total-derivative mean-value inequality implies ∥f(y)−f(x)∥2≤M∥y−x∥2 under a uniform derivative bound M (On a convex open set, a uniform bound ∥Df(z)v∥2≤M∥v∥2 implies ∥f(y)−f(x)∥2≤M∥y−x∥2).

Proof

technique · direct
1.1

The zero derivative hypothesis satisfies the bound in [L1] with M=0 for arbitrary x,y∈U.

L1
2.1

Hence ∥f(y)−f(x)∥2≤0, so norm separation gives f(y)=f(x).

step 1.1algebra
3.1

Since x,y were arbitrary, the map is constant; if U is empty this conclusion is vacuous.

step 1.1step 2.1∎
RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-08-02Open item page →

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 n≥1 hypothesis, and what is taken up elsewhere in the reading order. A future general linear-map development must prove agreement with A linear map L:Rm→Rn in Euclidean coordinates, not silently replace the meaning of Df(a).

5 · Examples, counterexamples and false statements

None yet.

Sources