Reason: Proof of thm:hessian-symmetric-2026b, carried forward and re-versioned onto def:ck-map-euclidean-2026a, def:partial-derivative-euclidean-2026a, lem:slice-function-partial-derivative-2026b and def:hessian-matrix-2026b. Exposure-clean.
If i=j the two sides of claim 1 are the same expression, so assume i=j throughout Steps 1 to 5.
Step 0 (squares are strictly monotone on nonnegative reals). If 0≤α, 0≤β and α<β, then 0<β by claim 2, so βα<ββ by claim 10, while αα≤βα (an equality when α=0, and claim 10 with multiplier α when 0<α); claim 2 gives α2<β2. Consequently, if 0≤α, 0≤β and α2<β2, then α<β: otherwise β≤α, and either β=α, giving α2=β2, or β<α, giving β2<α2; both contradict α2<β2.
Step 1 (a common radius). Since x∈U and U is open, there is r with 0<r such that every point of Rn whose Euclidean distance to x is less than r lies in U. Put ρ=r⋅2−1, so 0<ρ and ρ<r by claim 8.
Let s,t∈R satisfy ∣s∣<ρ and ∣t∣<ρ, and let w=x[i:xi+s][j:xj+t]. Since i=j, the point w agrees with x in every coordinate other than the ith and jth, and differs there by s and by t; so by the definition of the Euclidean distance the distance from w to x is the nonnegative number whose square is s2+t2. Now s2=∣s∣2<ρ2 and t2=∣t∣2<ρ2 by claim 4 of Properties of the Absolute Value in an Ordered Field and Step 0, so s2+t2<ρ2+ρ2 by claim 3. Also ρ2+ρ2=r2⋅2−1, which is less than r2 by claim 8 applied to 0<r2 (positive by claim 5). Hence the square of the distance is less than r2, so by Step 0 the distance is less than r and w∈U. Taking t=0 or s=0 shows likewise that x[i:xi+s]∈U and x[j:xj+t]∈U.
Step 2 (slices are differentiable). Let z∈U and let m be an index. Real-valued functions on U are regarded as maps into R1 with themselves as single coordinate function, as in clause 3 of the definition of class Ck. Since f is of class C2 on U, clause 2 of that definition applied with k=1 shows that f is of class C1 on U, so by clause 1 the partial derivative∂f/∂xm exists at every point of U; the same clause 2 says that each ∂f/∂xm is itself of class C1 on U, so the same holds with ∂f/∂xm in place of f.
Let V⊆R be an open interval such that z[m:u]∈U for every u∈V, and let G:V→R be given by G(u)=f(z[m:u]). We claim G is differentiable at every u0∈V with G′(u0)=∂xm∂f(z[m:u0]).
Indeed, apply claims 1 and 2 of Slice Function and the Partial Derivative to f at the point a=z[m:u0] of U in the mth variable: it supplies ρ0 with 0<ρ0 and identifies the slice function g0 on I0=(u0−ρ0,u0+ρ0), given by g0(u)=f(a[m:u])=f(z[m:u]), as differentiable at u0 with g0′(u0)=∂xm∂f(a), the partial derivative existing as noted above. The functions G and g0 agree on V∩I0. By An Open Interval is an Interval All of Whose Points Are Interior both V and I0 are intervals all of whose points are interior, so there is η with 0<η such that every u with ∣u−u0∣<η lies in V∩I0: take η to be the least, by claim 9, of ρ0 and of a radius witnessing that u0 is interior to V. The defining condition of differentiability at u0 involves only values at points u0+k with ∣k∣ smaller than the chosen δ, and shrinking δ to be at most η (claim 9) confines those points to V∩I0, where G and g0 agree. Hence the same value satisfies the condition for G on V as for g0 on I0, which proves the claim. The identical argument applies with ∂f/∂xm′ in place of f for any index m′, since it too has partial derivatives everywhere on U.
Step 3 (the double difference, computed in one order). Fix s,t with 0<∣s∣<ρ and 0<∣t∣<ρ, and set
Both arguments lie in U for u∈Ji, by Step 1. By Step 2 each term is differentiable at every u∈Ji, so by Derivative of a Sum and of a Differenceφ is differentiable at every u∈Ji with
φ′(u)=∂xi∂f(y[i:u])−∂xi∂f(x[i:u]).
Evaluating, φ(xi+s)−φ(xi)=Δ, and both xi and xi+s lie in Ji.
Now put z=x[i:uˉ] and define ψ:Jj→R by ψ(v)=∂xi∂f(z[j:v]); the arguments lie in U by Step 1. By Step 2, applied with ∂f/∂xi in place of f and the index j, ψ is differentiable at every v∈Jj with ψ′(v)=∂xj∂xi∂2f(z[j:v]), in the second-order partial derivative notation of Hessian Matrix of a C^2 Function, that is the iterated partial derivative of clause 4 of C^k Maps on a Euclidean Open Set. Since y[i:uˉ]=z[j:xj+t] and x[i:uˉ]=z[j:xj], we have φ′(uˉ)=ψ(xj+t)−ψ(xj), and Mean Value Theorem on an Open Interval gives vˉ strictly between xj and xj+t, so with ∣vˉ−xj∣<∣t∣, such that φ′(uˉ)=ψ′(vˉ)t. Therefore, with w=x[i:uˉ][j:vˉ],
which is the expression of Step 3 with the roles of the indices i and j, and of s and t, interchanged. Step 3 applied in that form produces u~ with ∣u~−xj∣<∣t∣ and v~ with ∣v~−xi∣<∣s∣ such that, with w′=x[j:u~][i:v~],
Δ=∂xi∂xj∂2f(w′)ts.
Since st=ts is nonzero, multiplying both expressions by (st)−1 gives
∂xj∂xi∂2f(w)=∂xi∂xj∂2f(w′).
Moreover w and w′ each differ from x only in the ith and jth coordinates, by amounts of absolute value less than ∣s∣ and ∣t∣ respectively; so, exactly as in Step 1, the Euclidean distance from each of w,w′ to x has square less than ∣s∣2+∣t∣2.
Step 5 (passing to the limit). Write P=∂xj∂xi∂2f and Q=∂xi∂xj∂2f, functions on U. By clause 2 of C^k Maps on a Euclidean Open Set applied with k=1, each of ∂f/∂xi and ∂f/∂xj is of class C1 on U, so P and Q are continuous at every point of U.
Let ε∈R with 0<ε, and put ηε=ε⋅2−1, positive by claim 8. Continuity of P and of Q at x gives θ with 0<θ, obtained as the least of the two radii by claim 9, such that every z∈U whose Euclidean distance to x is less than θ satisfies ∣P(z)−P(x)∣<ηε and ∣Q(z)−Q(x)∣<ηε.
Choose σ to be the least of ρ and θ⋅2−1 by claim 9, and put s=t=σ⋅2−1, so 0<s<ρ and 0<∣s∣=s, 0<∣t∣=t. Then ∣s∣2+∣t∣2=s2+s2, and s<θ⋅2−1 gives s2<θ2⋅4−1 by Step 0, so s2+s2<θ2⋅2−1<θ2 by claims 3 and 8. By Step 4 and Step 0, the distances from w and from w′ to x are therefore less than θ, and both points lie in U by Step 1.
This holds for every ε with 0<ε. If P(x)=Q(x) then ∣P(x)−Q(x)∣ is positive by claim 1 of Properties of the Absolute Value in an Ordered Field, and taking ε=∣P(x)−Q(x)∣ gives ∣P(x)−Q(x)∣<∣P(x)−Q(x)∣, which is impossible. Hence P(x)=Q(x), which is claim 1.