Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

A prime-ideal compactness tree for the finite–cofinite algebra

Example

For the finite–cofinite Boolean algebra on ω, the canonical compactness-tree branch which always selects the cofinite remainder has the finite-set ideal as its zero fibre.

Facts & Assumptions

Given: B={Aω:A is finite or ωA is finite} with union, intersection, and complement.

[F1]

Finite partial prime-ideal diagrams identifies a finite partial prime-ideal diagram with a homomorphism on its whole finite generated subalgebra and identifies the nonzero Boolean cells as its atoms.

[F2]

The compactness tree yields a prime ideal for an enumerated Boolean algebra proves that an enumerated nontrivial Boolean algebra has a prime ideal; the explicit levels and branch below are computed directly rather than attributed to this Statement.

Verification

1.1

Enumerate the finite subsets as F0=,F1={0},F2={1},F3={0,1}, by increasing binary code, and enumerate B by b(2n)=Fn, b(2n+1)=ωFn. This is onto, including repetitions such as b(0)= and b(1)=ω.

givenconstruct
2.1

At levels 0,1,2 the generated algebra is {,ω} and has its unique homomorphism to 2. At level 3, after {0} appears, the generated algebra has atoms {0} and ω{0} and hence two homomorphisms, with respective values 1 and 0 on {0}. Level 4 adds only its complement and has the same two nodes.

F1step 1.1
3.1

At level 5, the generators include {0} and {1}; the atoms are {0}, {1}, and R2=ω{0,1}. The three homomorphisms select these atoms and have value pairs (1,0),(0,1),(0,0) on the two singletons. The last node restricts to the value-0 node at level 3.

F1step 2.1
4.1

At any finite stage let E be the finite union of all finite generators seen so far. The generated algebra has the finitely many atomic pieces inside E and the single cofinite remainder R=ωE. Evaluation at R is the unique level node assigning 0 to every finite member of that subalgebra and 1 to every cofinite member. These nodes restrict coherently, so they form the branch illustrated by steps 2.1 and 3.1.

F1step 1.1step 2.1step 3.1construct
5.1

The union homomorphism is h(A)=0 when A is finite and h(A)=1 when A is cofinite. Its zero fibre is therefore Fin. This is proper and prime: if A,B are both cofinite then AB is cofinite, so AB can be finite only when at least one of A,B is finite. This explicit prime ideal agrees with F2's existence conclusion.

F1F2step 4.1

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.

Sources