Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-21
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.

A differentiable map on a connected open Euclidean set has zero derivative exactly when it is constant

Statement

Let m,q1, let URm be nonempty, open, and connected, and let f:URq be totally differentiable at every point (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(h2) remainder, Vector-valued functions f:ARm, their limits and continuity, with the dictionary to the metric notions). Then Df=0 on U if and only if f is constant on U.

Facts & Assumptions

Given: The map and domain in the Statement, with polygonal paths interpreted by Polygonal paths and polygonally connected subsets of Rn.

[L1]

Let URn be open. Then U is connected if and only if it is path-connected, if and only if it is polygonally connected (For an open subset of Rn, connectedness, path-connectedness and polygonal connectedness are equivalent).

[L2]

If g is totally differentiable at a and h is totally differentiable at g(a), then hg is totally differentiable at a and D(hg)(a)=Dh(g(a))Dg(a) (The chain rule for total derivatives: D(gf)(a)=Dg(f(a))Df(a)).

Proof

technique · direct
1.1

For the implication from constancy to zero derivative, a constant map has increment zero for every displacement. The zero linear map therefore leaves an identically zero remainder, so Df(a)=0 at every aU.

givenalgebra
2.1

For the implication from zero derivative to constancy, fix x,yU. By [L1], a finite polygonal path in U joins them. On each affine segment, [L2] makes every scalar component of the composite differentiable with derivative zero; [L3] makes that composite constant on the segment. The endpoint values agree successively along the finite path, so f(x)=f(y). Since x,y were arbitrary, f is constant.

L1L2L3given

Depends on

Used by

Dependency tree · two levels

41 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources