Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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, the countable-cocountable family is a sigma-algebra

Example

Assume ACω. For a set X, define

C:={AX:A is at most countable or XA is at most countable}.

Then C is the countable-cocountable sigma-algebra on X.

Facts & Assumptions

Given: The Axiom of Countable Choice and a set X.

[L1]

Under countable choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ACω, The Axiom of Countable Choice (ACω)).

[L2]

At most countable means finite or countably infinite (Finite, countably infinite, countable, uncountable).

[L3]

Every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

[L4]

A sigma-algebra contains the empty set and is closed under complements and countable unions (Sigma-algebras).

Verification

technique · direct
1.1

The empty set is at most countable. Complementation exchanges the two alternatives in the definition of C, so C contains and is complement-closed.

L2algebra
1.2

Let (An) lie in C. If every An is at most countable, [L1] makes nAn at most countable. If some Aj is cocountable, then XnAnXAj is at most countable by [L3]. In either case the union lies in C.

L1L2L3
2.1

Steps 1.1 and 1.2 verify all axioms in [L4], so C is a sigma-algebra on X.

step 1.1step 1.2L4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 51 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources