Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 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.

Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume

Statement

Let n≥1. Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then Lebesgue outer measure λn∗ (Lebesgue outer measure on Rn) is an outer measure on Rn (Outer measures): it vanishes at ∅, is monotone, and is countably subadditive.

The agreement clause is a theorem of ZF and needs no choice principle: λn∗(A)=μ0(A) for every elementary set A (Elementary sets: the finite unions of half-open boxes in Rn), where μ0 is elementary volume. In particular λn∗(B)=vol⁡(B) for every half-open box B, and λn∗(∅)=0.

Facts & Assumptions

Given: A natural number n≥1, the Axiom of Countable Choice, the premeasure μ0 on the algebra En, and its induced outer set function λn∗.

[L1]

λn∗ is the outer set function induced by the premeasure μ0 on the algebra En of elementary sets (Lebesgue outer measure on Rn).

[L2]

Elementary volume μ0 is a sigma-finite premeasure on En (Elementary volume is a sigma-finite premeasure on the algebra of elementary sets).

[F1]

Assume the Axiom of Countable Choice. The outer set function induced by a premeasure is an outer measure (Assuming countable choice, the outer set function induced by a premeasure is an outer measure).

[F2]

For every A∈A0, the outer measure induced by a premeasure satisfies μ∗(A)=μ0(A) (The induced outer measure agrees with the premeasure on the source algebra).

[F3]

An outer measure on a set X is a function μ∗:P(X)→[0,+∞] that vanishes at the empty set, is monotone, and is countably subadditive (Outer measures).

[F4]

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

Proof

technique · direct
1.1L1L2

Elementary volume is a premeasure on the algebra En of subsets of Rn, and λn∗ is by definition the outer set function it induces, so both [F1] and [F2] apply to this pair.

1.2F1F3F4

Under the Axiom of Countable Choice, an induced outer set function is an outer measure, which is the first assertion.

1.3F2L2

The identity λn∗(A)=μ0(A) on the source algebra is [F2], whose statement carries no choice hypothesis, so the agreement clause holds in ZF alone; applied to a half-open box B, which is elementary, it gives λn∗(B)=μ0(B)=vol⁡(B), and applied to ∅ it gives λn∗(∅)=0.

2.1step 1.1step 1.2step 1.3∎

Steps 1.1, 1.2 and 1.3 together are the Statement.

Depends on

Used by

Dependency tree · two levels

32 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