Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 distribution with zero derivatives on a connected open set is constant

Statement

Assume Countable Choice for the Lebesgue regular-distribution convention. If ΩRn is nonempty, open and connected and ju=0 for every 1jn, then there is a unique cC such that u(ψ)=cψ for every test. Conversely every constant regular distribution has zero first derivatives. On a disconnected open set constants may differ on different connected components.

Facts & Assumptions

[F1]

Smooth local convolutions satisfy j(uρε)=(ju)ρε (Convolution with a test function is smooth).

[F2]

Unit-mass mollifications converge locally in distribution pairings under Countable Choice (Mollifier approximation in distributions).

[F3]

A compact ball admits a nonnegative smooth compact cutoff, so a nonzero such bump inside any open ball can be normalized by its positive finite integral (Test function cutoffs and euclidean localization).

[F5]

Distributions equal on an open cover are equal globally (Distributions form a sheaf).

[F6]

Classical derivatives of smooth regular distributions agree with distribution derivatives under Countable Choice (Distributional differentiation is continuous and commutes). We assume The Axiom of Countable Choice (ACω) for F2 and this regular interpretation.

Proof

Given: the vanishing first derivatives and the stated choice assumption.

1.1

Take any open ball B with compact closure in Ω. For all sufficiently small ε>0, F1 gives a smooth mollification on a neighborhood of B with every first derivative zero. Along the segment between any two points of B, the chain rule gives derivative zero; F4 with bound zero makes their values equal. Denote this value by cε.

givenF1F2F4
2.1

Choose ηD(B) with η=1 using F3. Then F2 gives cε=(uρε)ηu(η)=cB. For every ψD(B), F2 therefore gives u(ψ)=limcεψ=cBψ. A unit-integral test also shows uniqueness of this constant on B.

step 1.1F2F3
3.1

If two such balls overlap, their intersection contains an open ball and hence a unit-integral test by F3. Evaluation on that test proves that their constants agree. Consequently there is a well-defined locally constant function c(x) on Ω, whose value is the unique constant of any sufficiently small ball about x. For a fixed x0, the set {x:c(x)=c(x0)} and its complement are open. It is nonempty, so connectedness forces the complement empty. F5 applied to the ball cover yields u=c(x0) as a regular distribution. A unit-integral test anywhere proves uniqueness.

step 2.1givenF3F5
4.1

F6 proves the converse, since the classical first derivatives of a constant vanish. In any open subset of Euclidean space each connected component is open: a ball about a point is connected and belongs to its component. Applying the preceding argument in each component gives independent constants. Conversely such a componentwise constant function is locally constant, hence smooth, and F6 gives zero derivatives. On the empty domain the sole distribution is zero but its representing constant is not unique; this explains the nonempty hypothesis. Countable Choice is inherited only from the integral mollification and regular-derivative clauses, not from the overlap argument.

step 3.1F6

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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