Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passaudited 2026-09-06
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.

Absolutely continuous functions have Luzin's property (N)

Statement

Assume the Axiom of Countable Choice. Every absolutely continuous F:[a,b]→R has property (N).

Facts & Assumptions

Given: Countable choice, F∈AC[a,b], and a null set E⊆[a,b].

Proof

technique · direct
1.1givenchoose

Given ε>0, choose δ from Absolute continuity on a compact interval. The endpoints have a finite image, so it suffices to consider E∩(a,b). Outer regularity Assuming countable choice, the Lebesgue outer measure of an arbitrary subset of Rn is the infimum of the measures of the open sets containing it gives an open U⊆(a,b) containing it with λ(U)<δ.

2.1step 1.1algebra

Write U=⨆j(aj,bj). On each [aj,bj], continuity gives points cj,dj of minimum and maximum value, ordered so that cj≤dj. Hence F([aj,bj]) is an interval of length ∣F(dj)−F(cj)∣. The intervals [cj,dj] are disjoint and have total length at most λ(U); the AC estimate applies to every finite subfamily, so its nonnegative countable sum is at most ε.

3.1step 2.1∎

Subadditivity gives λ∗(F(E∩(a,b)))≤∑j∣F(dj)−F(cj)∣≤ε. Letting ε↓0 and restoring the finite endpoint image proves property (N) as defined in Luzin's property (N) on a compact interval.

Depends on

Used by

Dependency tree · two levels

28 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