Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

L(Rn) is exactly the completion of the restriction of λn to the Borel sets

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Write βn for the restriction of λn to the Borel sigma-algebra B(Rn) (The Borel sigma-algebra of a topological space). Then L(Rn) is exactly the completion domain of (Rn,B(Rn),βn) (The completion domain and proposed completed set function of a measure space), and λn is the completed measure there. Explicitly,

EL(Rn)    E=AN for some A,ZB(Rn) with NZ and βn(Z)=0,

and then λn(E)=βn(A).

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, Lebesgue measure λn on L(Rn), and the restriction βn of λn to B(Rn).

[L1]

Assume the Axiom of Countable Choice and let μ0 be a sigma-finite premeasure; the Carathéodory sigma-algebra of its induced outer measure is exactly the completion of σ(A0) under the extended measure, and the Carathéodory restriction equals the completed measure there (Assuming countable choice, the Carathéodory domain is the completion of the sigma-finite extension).

[L2]

Elementary volume μ0 is a sigma-finite premeasure on the algebra En of elementary sets (Elementary volume is a sigma-finite premeasure on the algebra of elementary sets, Elementary sets: the finite unions of half-open boxes in Rn).

[L3]

λn is the outer set function induced by the premeasure μ0 on En (Lebesgue outer measure on Rn), and L(Rn) is the family of sets Carathéodory measurable for λn, with λn its restriction (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn).

[L5]
[F1]

The completion domain of (X,A,μ) is A:={EX:E=AN for some A,ZA and NZ with μ(Z)=0}, and the completed set function is μ(E):=μ(A) (The completion domain and proposed completed set function of a measure space).

[F2]

Assume the Axiom of Countable Choice; then μ is a complete measure on A extending μ, and it is the unique complete measure on A that extends μ (Assuming countable choice, every measure space has a unique complete extension to its completion).

[F3]

The Axiom of Countable Choice says that for every family (Xn)nN of nonempty sets indexed by N there is a function f with domain N such that f(n)Xn for every nN (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1

Elementary volume is a sigma-finite premeasure on the algebra En, and λn is exactly the outer set function it induces, so the hypotheses of the Carathéodory-domain theorem are met with A0:=En.

L2L3F3
1.2

The sigma-algebra generated by En is B(Rn), and the measure that the extension theorem places on it is the restriction βn of λn, since every Borel set is Lebesgue measurable and λn is the restriction of λn.

L3L4L5
2.1

The Carathéodory-domain theorem therefore says that L(Rn), the Carathéodory sigma-algebra of λn, is the completion domain of βn on B(Rn) and that λn agrees there with the completed measure; unwinding the published description of that domain gives the displayed equivalence and the value λn(E)=βn(A), which is well posed because the completed measure is a measure extending βn and is the unique complete one.

step 1.1step 1.2L1F1F2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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