Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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, Carathéodory measurability of a finite-outer-measure set is equivalent to source-algebra approximation

Statement

Assume the Axiom of Countable Choice. Let μ∗ be induced by a premeasure μ0 on A0, and let E⊆X satisfy μ∗(E)<+∞. Then E is Carathéodory measurable if and only if for every ε>0 there is A∈A0 such that μ∗(E△A)<ε.

Facts & Assumptions

Given: Countable choice, the induced outer set function μ∗, a set E of finite outer measure, and a positive real ε.

[F1]

The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. (The outer set function induced by a premeasure)

[L1]

Assuming countable choice, every member of the source algebra is Carathéodory measurable for the induced outer measure. (Assuming countable choice, every source-algebra set is measurable for the induced outer measure)

[L3]

Assuming 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)

[L2]

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). (In the Carathéodory identity, the subadditive inequality is automatic)

Proof

technique · direct
1.1F1givenchoosealgebra

For the forward direction, suppose E is Carathéodory measurable. Choose by [F1] a cover (Ck) of E with finite cost below μ∗(E)+ε/4 and put H=⋃kCk. Applying the Carathéodory identity for E to the test set H shows that μ∗(H∖E)<ε/4; the finite total covering cost also has a tail below ε/4, so some finite union A=⋃k<nCk∈A0 satisfies μ∗(H∖A)<ε/4.

2.1step 1.1L1L3algebra

For the forward direction, step 1.1 gives E△A⊆(H∖E)∪(H∖A) and hence μ∗(E△A)<ε. For the reverse direction, assume the approximation property, fix a test set T, and choose A∈A0 with μ∗(E△A)<δ; since μ∗ is an outer measure by [L3] and A is measurable by [L1], subadditivity gives μ∗(T∩E)+μ∗(T∖E)≤μ∗(T∩A)+μ∗(T∖A)+2δ=μ∗(T)+2δ.

3.1step 2.1L2L3algebra∎

For the reverse direction, letting δ decrease to 0 in step 2.1 gives μ∗(T∩E)+μ∗(T∖E)≤μ∗(T), and [L2] applied to the outer measure of [L3] gives the opposite inequality; thus the Carathéodory identity holds for every T, completing both implications.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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