Alphabeta Math
Session-authored (Fable 5 assisted)
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 RmRn\mathbb{R}^m \to \mathbb{R}^n

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:RmRnL:\mathbb{R}^m\to\mathbb{R}^n in Euclidean coordinates

Definition

Let m,n1m,n\ge1. A map L:RmRnL:\mathbb R^m\to\mathbb R^n is linear when

L(αu+βv)=αL(u)+βL(v)L(\alpha u+\beta v)=\alpha L(u)+\beta L(v)

for all u,vRmu,v\in\mathbb R^m and all α,βR\alpha,\beta\in\mathbb R. Both spaces carry their Euclidean vector-space operations and Euclidean norms from The Euclidean inner product x,y=k<nxkyk\langle x,y\rangle = \sum_{k<n} x_k y_k on Rn\mathbb{R}^n.

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 Lh2Kh2\|Lh\|_2\le K\|h\|_2 for some K0K\ge0

Statement

For every linear L:RmRnL:\mathbb R^m\to\mathbb R^n there is a unique matrix A=(aij)i<n,j<mA=(a_{ij})_{i<n,j<m} such that (Lh)i=j<maijhj(Lh)_i=\sum_{j<m}a_{ij}h_j. Moreover there is K0K\ge0 with Lh2Kh2\|Lh\|_2\le K\|h\|_2 for every hh.

Facts & Assumptions

Given: A Euclidean linear map L:RmRnL:\mathbb R^m\to\mathbb R^n.

[L2]

The Euclidean norm of xx is x2=i<nxi2\|x\|_2=\sqrt{\sum_{i<n}x_i^2}, and it is a norm (The Euclidean inner product x,y=k<nxkyk\langle x,y\rangle = \sum_{k<n} x_k y_k on Rn\mathbb{R}^n).

Proof

technique · direct
1.1

Put aij:=(Lej)ia_{ij}:=(L e_j)_i. By [L1] and linearity, Lh=L(j<mhjej)=j<mhjLejLh=L(\sum_{j<m}h_je_j)=\sum_{j<m}h_jLe_j, so (Lh)i=j<maijhj(Lh)_i=\sum_{j<m}a_{ij}h_j.

L1L2
2.1

The columns LejLe_j determine every value in step 1.1, and evaluating the displayed formula at eje_j 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/2K=(\sum_{i<n,j<m}a_{ij}^2)^{1/2}. Cauchy--Schwarz [L3] in each row and summing gives Lh22K2h22\|Lh\|_2^2\le K^2\|h\|_2^2, hence Lh2Kh2\|Lh\|_2\le K\|h\|_2.

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

A convex subset of Rm\mathbb{R}^m contains every line segment between two of its points

Definition

A subset URmU\subseteq\mathbb R^m is convex when, for all x,yUx,y\in U and t[0,1]t\in[0,1] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length), the point (1t)x+ty(1-t)x+ty lies in UU. Thus the full line segment from xx to yy remains in UU.

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

Directional derivatives and partial derivatives of a map URmRnU\subseteq\mathbb{R}^m\to\mathbb{R}^n

Definition

Let URmU\subseteq\mathbb R^m, aUa\in U, vRmv\in\mathbb R^m, and f:URnf:U\to\mathbb R^n. If the line map tf(a+tv)t\mapsto f(a+tv) is defined near 00, its derivative at 00 is the directional derivative

Dvf(a):=limt0f(a+tv)f(a)t.D_vf(a):=\lim_{t\to0}\frac{f(a+tv)-f(a)}{t}.

For a standard basis vector eje_j (The standard list e:nFne : n \to F^{n} with ei(i)=1Fe_i(i) = 1_F and ei(j)=0Fe_i(j) = 0_F for jij \ne i is an ordered basis of FnF^{n}; hence dimFFn=n\dim_F F^{n} = n, and F0F^{0} is the zero space with basis \varnothing and dimension 00), Dejf(a)D_{e_j}f(a) is the jjth partial derivative, written jf(a)\partial_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)Df(a) as the linear first-order approximation with o(h2)o(\|h\|_2) remainder

Definition

Let URmU\subseteq\mathbb R^m be open, let aUa\in U, and let f:URnf:U\to\mathbb R^n. The map ff is totally differentiable at aa when there is a linear map L:RmRnL:\mathbb R^m\to\mathbb R^n (A linear map L:RmRnL:\mathbb{R}^m\to\mathbb{R}^n in Euclidean coordinates) such that

limh0f(a+h)f(a)Lh2h2=0,\lim_{h\to0}\frac{\|f(a+h)-f(a)-Lh\|_2}{\|h\|_2}=0,

where the quotient is considered for h0h\ne0 with a+hUa+h\in U. The map LL, when it exists, is denoted Df(a)Df(a) and called the total derivative. Equivalently, f(a+h)=f(a)+Df(a)h+r(h)f(a+h)=f(a)+Df(a)h+r(h) with r(h)2/h20\|r(h)\|_2/\|h\|_2\to0.

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

The total derivative at a point is unique

Statement

If L,M:RmRnL,M:\mathbb R^m\to\mathbb R^n both satisfy the total-differentiability remainder condition for ff at aa, then L=ML=M.

Facts & Assumptions

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

[L1]

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

Proof

technique · direct
1.1

Subtracting the two remainder identities gives (LM)h2/h20\|(L-M)h\|_2/\|h\|_2\to0 as h0h\to0.

L1
2.1

For any fixed vRmv\in\mathbb R^m and nonzero real tt, linearity gives (LM)(tv)2/tv2=(LM)v2/v2\|(L-M)(tv)\|_2/\|tv\|_2=\|(L-M)v\|_2/\|v\|_2 when v0v\ne0.

step 1.1algebra
3.1

Letting t0t\to0 in step 2.1 forces (LM)v=0(L-M)v=0 for every nonzero vv, and it is also zero at v=0v=0; hence L=ML=M.

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

Total differentiability gives a local O(h2)O(\|h\|_2) increment bound and therefore continuity

Statement

If f:URnf:U\to\mathbb R^n is totally differentiable at aUa\in U, then some C,δ>0C,\delta>0 satisfy f(a+h)f(a)2Ch2\|f(a+h)-f(a)\|_2\le C\|h\|_2 whenever h2<δ\|h\|_2<\delta and a+hUa+h\in U. In particular ff is continuous at aa.

Facts & Assumptions

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

[L1]

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

[L2]

Every Euclidean linear map has a norm bound Lh2Kh2\|Lh\|_2\le K\|h\|_2 for some K0K\ge0 (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2\|Lh\|_2\le K\|h\|_2 for some K0K\ge0).

Proof

technique · direct
1.1

By [L1], choose δ>0\delta>0 such that the remainder r(h)=f(a+h)f(a)Df(a)hr(h)=f(a+h)-f(a)-Df(a)h satisfies r(h)2h2\|r(h)\|_2\le\|h\|_2 whenever 0<h2<δ0<\|h\|_2<\delta.

L1L2
2.1

If KK bounds Df(a)Df(a) as in [L2], the triangle inequality gives f(a+h)f(a)2(K+1)h2\|f(a+h)-f(a)\|_2\le(K+1)\|h\|_2 for those hh, and it also holds at h=0h=0.

step 1.1L2algebra
3.1

Given ε>0\varepsilon>0, take h2<min{δ,ε/(K+1)}\|h\|_2<\min\{\delta,\varepsilon/(K+1)\}; step 2.1 is the metric continuity condition at aa.

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)\partial_jf_i(a) of f:URnf:U\to\mathbb R^n exists, the Jacobian matrix is Jf(a)=(jfi(a))i<n,j<mJf(a)=(\partial_jf_i(a))_{i<n,j<m}. For scalar-valued ff, its gradient is

f(a):=(0f(a),,m1f(a))Rm,\nabla f(a):=(\partial_0f(a),\ldots,\partial_{m-1}f(a))\in\mathbb R^m,

with coordinates understood in the standard basis (The standard list e:nFne : n \to F^{n} with ei(i)=1Fe_i(i) = 1_F and ei(j)=0Fe_i(j) = 0_F for jij \ne i is an ordered basis of FnF^{n}; hence dimFFn=n\dim_F F^{n} = n, and F0F^{0} is the zero space with basis \varnothing and dimension 00). The partial derivatives are those of Directional derivatives and partial derivatives of a map URmRnU\subseteq\mathbb{R}^m\to\mathbb{R}^n.

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:URnf:U\to\mathbb R^n is totally differentiable at aa, then Dvf(a)D_vf(a) exists for every vRmv\in\mathbb R^m and equals Df(a)vDf(a)v. In particular jf(a)=Df(a)ej\partial_jf(a)=Df(a)e_j, and the matrix of Df(a)Df(a) is Jf(a)Jf(a).

Facts & Assumptions

Given: A total derivative Df(a)Df(a) and a direction vRmv\in\mathbb R^m.

[L1]

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

[L2]

The directional derivative is the derivative of tf(a+tv)t\mapsto f(a+tv) at zero, and partial derivatives use standard-basis directions (Directional derivatives and partial derivatives of a map URmRnU\subseteq\mathbb{R}^m\to\mathbb{R}^n).

Proof

technique · direct
1.1

For t0t\ne0, write f(a+tv)f(a)=tDf(a)v+r(tv)f(a+tv)-f(a)=tDf(a)v+r(tv), where r(tv)2/tv20\|r(tv)\|_2/\|tv\|_2\to0 by [L1].

L1L2
2.1

Dividing by tt gives (f(a+tv)f(a))/t=Df(a)v+r(tv)/t(f(a+tv)-f(a))/t=Df(a)v+r(tv)/t, and r(tv)/t2=v2r(tv)2/tv20\|r(tv)/t\|_2=\|v\|_2\,\|r(tv)\|_2/\|tv\|_2\to0; hence [L2] yields Dvf(a)=Df(a)vD_vf(a)=Df(a)v.

step 1.1L2algebra
3.1

Taking v=ejv=e_j identifies the jjth column of the matrix of Df(a)Df(a) with the vector of jjth 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),vD_vf(a)=\langle\nabla f(a),v\rangle and the unit direction of steepest ascent is the normalized gradient

Statement

If a scalar-valued f:URf:U\to\mathbb R is totally differentiable at aa, then Dvf(a)=f(a),vD_vf(a)=\langle\nabla f(a),v\rangle for every vv. Among unit vectors vv, this is at most f(a)2\|\nabla f(a)\|_2; if the gradient is nonzero, equality holds exactly in the direction f(a)/f(a)2\nabla f(a)/\|\nabla f(a)\|_2. If the gradient is zero, every unit direction has directional derivative zero.

Facts & Assumptions

Given: A scalar-valued totally differentiable ff at aa and a direction vv.

[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)D_vf(a) is the Jacobian row applied to vv, namely jjf(a)vj=f(a),v\sum_j\partial_jf(a)v_j=\langle\nabla f(a),v\rangle.

L1L2
2.1

If f(a)0\nabla f(a)\ne0 and v2=1\|v\|_2=1, [L2] gives Dvf(a)f(a)2D_vf(a)\le\|\nabla f(a)\|_2, with equality at v=f(a)/f(a)2v=\nabla f(a)/\|\nabla f(a)\|_2.

assume-case nonzerostep 1.1L2algebra
3.1

If f(a)=0\nabla 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:URnf,g:U\to\mathbb R^n are totally differentiable at aa and cRc\in\mathbb R, then f+gf+g and cfcf are totally differentiable at aa, with

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

Facts & Assumptions

Given: Total first-order expansions for ff and gg at aa.

[L1]

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

[L2]

A norm satisfies the triangle inequality and cw=cw\|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 cc to obtain remainders rf+rgr_f+r_g for f+gf+g and crfcr_f for cfcf, with the displayed candidate linear maps.

L1L2
2.1

By [L2], rf(h)+rg(h)2/h2\|r_f(h)+r_g(h)\|_2/\|h\|_2 is bounded by the sum of two quantities tending to zero, and crf(h)2/h2=crf(h)2/h2\|cr_f(h)\|_2/\|h\|_2=|c|\,\|r_f(h)\|_2/\|h\|_2 tends to zero (also when c=0c=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(gf)(a)=Dg(f(a))Df(a)D(g\circ f)(a)=Dg(f(a))\circ Df(a)

Statement

Let f:UVRnf:U\to V\subseteq\mathbb R^n be totally differentiable at aUa\in U and let g:VRpg:V\to\mathbb R^p be totally differentiable at f(a)f(a). Then gfg\circ f is totally differentiable at aa and

D(gf)(a)=Dg(f(a))Df(a).D(g\circ f)(a)=Dg(f(a))\circ Df(a).

Facts & Assumptions

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

[L1]

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

[L2]

Total differentiability gives a local O(h2)O(\|h\|_2) increment bound and therefore continuity (Total differentiability gives a local O(h2)O(\|h\|_2) increment bound and therefore continuity).

Proof

technique · direct
1.1

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

L1L2
2.1

By [L2], k=f(a+h)f(a)=O(h2)k=f(a+h)-f(a)=O(\|h\|_2); boundedness of Dg(f(a))Dg(f(a)) and the two remainder limits show both Dg(f(a))rf(h)Dg(f(a))r_f(h) and rg(k)r_g(k) are o(h2)o(\|h\|_2), including the case k=0k=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(h2)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)URmB(a,r)\subseteq U\subseteq\mathbb R^m and let h2<r\|h\|_2<r. Define p0=ap_0=a and pj=a+i<jhieip_j=a+\sum_{i<j}h_ie_i for 1jm1\le j\le m. Then every pjp_j lies in B(a,r)B(a,r), pm=a+hp_m=a+h, and for every map ff on UU,

f(a+h)f(a)=j<m(f(pj+1)f(pj)).f(a+h)-f(a)=\sum_{j<m}\bigl(f(p_{j+1})-f(p_j)\bigr).

Facts & Assumptions

Given: The displayed ball, vector hh, and coordinate-prefix points pjp_j.

[L2]

The Euclidean norm of xx is x2=i<nxi2\|x\|_2=\sqrt{\sum_{i<n}x_i^2} (The Euclidean inner product x,y=k<nxkyk\langle x,y\rangle = \sum_{k<n} x_k y_k on Rn\mathbb{R}^n).

Proof

technique · direct
1.1

The standard-basis coordinate formula makes pm=a+hp_m=a+h, while pjap_j-a has coordinates hih_i for i<ji<j and 00 otherwise.

L1L2
2.1

Hence pja22=i<jhi2i<mhi2=h22<r2\|p_j-a\|_2^2=\sum_{i<j}h_i^2\le\sum_{i<m}h_i^2=\|h\|_2^2<r^2, so every prefix point is in B(a,r)B(a,r).

step 1.1L2algebra
3.1

Summing f(pj+1)f(pj)f(p_{j+1})-f(p_j) cancels all intermediate values and leaves f(pm)f(p0)=f(a+h)f(a)f(p_m)-f(p_0)=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 URmU\subseteq\mathbb R^m be open and let f:URnf:U\to\mathbb R^n. Suppose every partial derivative jf\partial_jf exists on a neighbourhood of aUa\in U and is continuous at aa. Then ff is totally differentiable at aa, and Df(a)Df(a) is the linear map with matrix Jf(a)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)2M(ba)\lVert f(b)-f(a)\rVert_2\le M(b-a) on a real interval when the derivative norm is bounded by MM (The mean value inequality: if f:[a,b]Rmf : [a,b] \to \mathbb{R}^m is continuous and differentiable on (a,b)(a,b) with f2M\lVert f'\rVert_2 \le M, then f(b)f(a)2M(ba)\lVert f(b)-f(a)\rVert_2 \le M(b-a)).

Proof

technique · direct
1.1

Choose a ball around aa on which the partial derivatives exist. Given ε>0\varepsilon>0, continuity at aa gives a smaller ball on which every jf(z)jf(a)2<ε/m\|\partial_jf(z)-\partial_jf(a)\|_2<\varepsilon/m.

L1L2
2.1

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

step 1.1L2algebra
3.1

Summing the segment bounds gives f(a+h)f(a)Jf(a)h2(ε/m)jhjεh2/mεh2\|f(a+h)-f(a)-Jf(a)h\|_2\le(\varepsilon/m)\sum_j|h_j|\le\varepsilon\|h\|_2/\sqrt m\le\varepsilon\|h\|_2. Since ε\varepsilon is arbitrary, the normalized remainder tends to zero and Jf(a)Jf(a) is Df(a)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)v2Mv2\|Df(z)v\|_2\le M\|v\|_2 implies f(y)f(x)2Myx2\|f(y)-f(x)\|_2\le M\|y-x\|_2

Statement

Let URmU\subseteq\mathbb R^m be convex and open, and let f:URnf:U\to\mathbb R^n be totally differentiable at every point. If M0M\ge0 satisfies Df(z)v2Mv2\|Df(z)v\|_2\le M\|v\|_2 for every zUz\in U and vRmv\in\mathbb R^m, then

f(y)f(x)2Myx2(x,yU).\|f(y)-f(x)\|_2\le M\|y-x\|_2\qquad(x,y\in 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\mathbb{R}^m contains every line segment between two of its points).

[L2]

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

[L4]

Total differentiability implies continuity at the point of total differentiability (Total differentiability gives a local O(h2)O(\|h\|_2) increment bound and therefore continuity).

Proof

technique · direct
1.1

If x=yx=y the conclusion is immediate. Otherwise put γ(t)=x+t(yx)\gamma(t)=x+t(y-x) for 0t10\le t\le1; [L1] keeps γ([0,1])\gamma([0,1]) in UU.

L1L2L3
2.1

The chain rule gives (fγ)(t)=Df(γ(t))(yx)(f\circ\gamma)'(t)=Df(\gamma(t))(y-x) for 0<t<10<t<1, whose norm is at most Myx2M\|y-x\|_2 by hypothesis.

step 1.1L2algebra
3.1

By [L4] the curve fγf\circ\gamma is continuous at the endpoints, so [L3] applied on [0,1][0,1] yields f(y)f(x)2Myx2\|f(y)-f(x)\|_2\le 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 URmU\subseteq\mathbb R^m be convex and open. If f:URnf:U\to\mathbb R^n is totally differentiable at every point and Df(z)=0Df(z)=0 for every zUz\in U, then ff is constant on UU.

Facts & Assumptions

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

[L1]

The total-derivative mean-value inequality implies f(y)f(x)2Myx2\|f(y)-f(x)\|_2\le M\|y-x\|_2 under a uniform derivative bound MM (On a convex open set, a uniform bound Df(z)v2Mv2\|Df(z)v\|_2\le M\|v\|_2 implies f(y)f(x)2Myx2\|f(y)-f(x)\|_2\le M\|y-x\|_2).

Proof

technique · direct
1.1

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

L1
2.1

Hence f(y)f(x)20\|f(y)-f(x)\|_2\le0, so norm separation gives f(y)=f(x)f(y)=f(x).

step 1.1algebra
3.1

Since x,yx,y were arbitrary, the map is constant; if UU 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 n1n \ge 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:RmRnL:\mathbb{R}^m\to\mathbb{R}^n in Euclidean coordinates, not silently replace the meaning of Df(a)Df(a).

5 · Examples, counterexamples and false statements

None yet.

Sources

Standard references

Recommended treatments; not extraction sources.