Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
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.

AC zero-derivative constancy and integrable-derivative reconstruction under Countable Choice

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) and let a≤b.

  1. If F:[a,b]→R is absolutely continuous and F′=0 almost everywhere on (a,b), then F is constant.
  2. Let n≥1, let y:[a,b]→Rn have absolutely continuous coordinates, and let h∈L1([a,b];Rn). If yj′=hj almost everywhere for each coordinate j, then, for every t∈[a,b], y(t)=y(a)+∫ath(s) ds. Here h∈L1([a,b];Rn) means that each coordinate hj is Lebesgue integrable, and the integral is the componentwise Lebesgue integral. For a=b it is zero.

Facts & Assumptions

Given: Countable Choice, a compact interval, and the scalar or vector data in the Statement.

[F1]

Absolute continuity controls sums of absolute endpoint increments over finite families with pairwise disjoint interiors and sufficiently small total length (Absolute continuity on a compact interval).

[F2]

Every gauge on a compact interval admits one finite fine tagged partition; every cell lies in its tag's open gauge neighborhood (Cousin's lemma: every gauge on a compact interval admits a fine tagged partition, Gauges and gauge-fine tagged partitions of a compact interval).

[F3]
[F4]

Under Countable Choice, Lebesgue measure is complete, monotone and additive on disjoint measurable sets and agrees with interval length; finite sets are null and finite unions of null sets are null (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume).

[F6]

For hj∈L1, its indefinite Lebesgue integral is absolutely continuous and, under Countable Choice, has derivative hj almost everywhere (The indefinite integral of an L1 function is absolutely continuous, The indefinite integral of an L1 function is differentiable almost everywhere).

Proof

1.1givenF1F3F4choose

If a=b, both conclusions hold directly. Otherwise fix a≤s<t≤b and ε>0 for claim 1. Let E be a null exceptional set for F′=0 on [s,t], enlarged by s,t; it is null by [F4]. Restricting [F1] to [s,t], choose d>0 so that total interval length below d implies total absolute increment below ε/2. Put η=ε/(2(t−s+1)). By [F3], choose one open U⊇E with λ(U)<d.

2.1F2F5F7step 1.1construct

For x∉E, define k(x) as the least k∈N0 such that ∣F(y)−F(x)∣≤η∣y−x∣ whenever y∈[s,t] and ∣y−x∣<2−k. This set is nonempty by F′(x)=0, [F7] and [F5], including y=x by equality. For x∈E, instead take the least k with (x−2−k,x+2−k)⊆U; openness and [F5] give existence. Set γ(x)=2−k(x). These uniquely specified least integers define one positive gauge; no arbitrary pointwise radius selections are needed. Obtain one finite γ-fine partition {([xi−1,xi],ξi)}i=1m from [F2].

3.1F1F4step 1.1step 2.1algebra

Cells tagged in E lie in U. Their interiors are disjoint, and their total length is the measure of their finite union, since shared endpoints form a finite null set. By [F4] this sum is at most λ(U)<d, so [F1] bounds their total absolute F-increment by ε/2; for an empty family the sum is zero.

4.1F2step 1.1step 2.1step 3.1algebra

For every other cell, strict fineness and step 2.1 give ∣F(xi)−F(xi−1)∣≤∣F(xi)−F(ξi)∣+∣F(ξi)−F(xi−1)∣≤η(xi−xi−1), because the tag lies in the cell. The sum over these cells is at most η(t−s)<ε/2. Telescoping all cells and applying step 3.1 yields ∣F(t)−F(s)∣<ε. Arbitrary positive ε gives equality, and arbitrary s,t prove claim 1.

5.1givenF1F4F6F7step 4.1algebra∎

For claim 2 with a<b, fix a coordinate j and put Ij(t)=∫athj(s) ds. By [F6], Ij is absolutely continuous and Ij′=hj almost everywhere. The function Hj=yj−yj(a)−Ij is absolutely continuous: for each positive tolerance use the [F1] moduli for yj,Ij at half that tolerance and take their minimum. Outside the union of the two exceptional null sets, [F7] gives Hj′=0. Claim 1 makes Hj constant, and Hj(a)=0, so yj(t)=yj(a)+Ij(t) for all t. Applying this argument to the finitely many coordinates proves the displayed vector identity.

Depends on

Used by

Dependency tree · two levels

86 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