Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

The zero-one outer measure on a two-point set has only the trivial measurable sets

Example

On X={0,1}, define μ()=0 and μ(E)=1 for every nonempty EX. This is an outer measure, and its Carathéodory measurable sets are exactly and X.

Facts & Assumptions

Given: The finite set and set function in the Example.

[F1]

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)

[F2]

A set EX is Carathéodory measurable for μ when μ(A)=μ(AE)+μ(AE) for every AX. (Carathéodory measurable sets)

Verification

technique · direct
1.1

Exhausting the four subsets gives normalization and monotonicity. For countable subadditivity, an empty union has value 0, while a nonempty union has value 1 and contains a point lying in a nonempty cover member, so the covering sum is at least 1; hence [F1] holds.

F1algebra
2.1

The sets and X satisfy [F2] identically. For either singleton E, the test A=X gives 1=μ(X) but μ(AE)+μ(AE)=1+1, so neither singleton is measurable.

step 1.1F2algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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.