Alphabeta Math
PropositionStatement: AI-adaptedProof: 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.

Closed sets are Carathéodory measurable for metric outer measures

Statement

Every closed subset of a metric space is Carathéodory measurable for every metric outer measure.

Facts & Assumptions

Given: A metric outer measure μ∗ on (X,d), a closed set F⊆X, and a test set A⊆X.

[L1]

For a closed set F and a finite-outer-measure test set A, the positive-distance layers inside A∖F increase to A∖F in outer measure. (Boundary layers of finite metric outer measure exhaust the complement of a closed set in 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)

[F1]

An outer measure on a metric space is a metric outer measure when μ∗(A∪B)=μ∗(A)+μ∗(B) for all nonempty A,B with d(A,B)>0. (Metric outer measures)

Proof

technique · direct
1.1F1algebra

If μ∗(A)<+∞, let Bn be the layers of [L1]. The sets A∩F and Bn are disjoint and positively separated whenever both are nonempty, while normalization handles an empty member; hence [F1] and monotonicity give μ∗(A)≥μ∗((A∩F)∪Bn)=μ∗(A∩F)+μ∗(Bn).

2.1step 1.1L1

Taking the supremum over n in step 1.1 and using [L1] gives μ∗(A)≥μ∗(A∩F)+μ∗(A∖F).

3.1step 2.1L2cases∎

If μ∗(A)=+∞, the inequality in step 2.1 is automatic because the right side is at most +∞; in every case [L2] supplies the reverse inequality, so the Carathéodory identity holds for every test set A.

Depends on

Used by

Dependency tree · two levels

10 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