Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 zero distributional gradient is constant on a connected domain

Statement

Assume Countable Choice. Let Ω⊆Rn be open and connected. If u∈Lloc1(Ω) satisfies ∂iu=0 as a distribution for every coordinate i, then there is a constant c∈C such that u=c almost everywhere on Ω. If u is real-valued almost everywhere, c may be chosen in R.

Facts & Assumptions

Given: Countable Choice, an open connected Ω⊆Rn, and u∈Lloc1(Ω) with zero distributional gradient.

[A1]

Countable Choice is assumed for the local mollifier approximation. (The Axiom of Countable Choice (ACω))

[F1]

A smooth compactly supported cutoff exists between nested balls. (A smooth bump between concentric Euclidean balls)

[F2]

Zero distributional derivative means ∫u ∂iϕ=0 for every compactly supported smooth test function. (Distributional derivative)

[F3]

Mollification makes a locally integrable function smooth and differentiates by convolution on compactly contained subdomains. (Convolution with a mollifier is smooth, and derivatives pass under the integral sign)

[F5]

A connected space admits no separation into two disjoint nonempty relatively open subsets. (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets)

Proof

Given: The open connected set Ω and u∈Lloc1(Ω) with zero distributional gradient.

1.1A1F1F2F3givenconstruct

If Ω=∅, choose c=0. If n=0 and Ω≠∅, then Ω=R0 is a singleton and its function u is constant. Henceforth assume n≥1 and Ω≠∅. Let B⋐Ω be any open ball and choose concentric balls B⋐B′⋐B′′⋐Ω. By [F1] take χ∈Cc∞(B′′) equal to one on B′, and extend w:=χu by zero to Rn. For sufficiently small ε, every mollifier centered at a point of B is supported in B′. For such a point x, differentiating the convolution gives ∂i(w∗ρε)(x)=−∫B′u(y)∂yiρε(x−y) dy=0 by the distributional identity [F2]. Thus w∗ρε is constant on the convex ball B by the one-dimensional fundamental theorem along each segment.

2.1A1F4step 1.1choosealgebra

Since w=u on B′, the approximate-identity property [F4] gives w∗ρεj→u in L1(B) for a sequence εj↓0. Write each constant from step 1.1 as cj. The L1(B) convergence makes (cj) Cauchy because ∣B∣∣cj−ck∣≤∥cj−u∥L1(B)+∥ck−u∥L1(B). Its limit cB satisfies u=cB almost everywhere on B.

3.1F5F6step 2.1givenconstruct∎

If Ω=∅, any constant satisfies the conclusion. Otherwise fix one ball and let c be its almost-everywhere value. Let S be the set of points of Ω having a neighborhood on which u=c almost everywhere. It is nonempty and open. If x∈S‾∩Ω, choose a ball B⋐Ω containing x and a point of S; step 2.1 makes u almost everywhere constant on B, and its positive-measure intersection with a neighborhood from S forces that constant to be c. Thus x∈S, so S is relatively closed. Connectedness [F5] gives S=Ω. By the countable rational base [F6], choose a countable cover of Ω by rational balls contained in these neighborhoods; the union of their exceptional null sets is null, hence u=c almost everywhere on all of Ω. The constants cj and cB may be complex; completeness of C justifies their limits. When u is real almost everywhere on a nonempty domain, its a.e. constant c is real because each ball has positive measure.

Depends on

Used by

Dependency tree · two levels

64 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