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: with union, intersection, and complement.
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.
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
Enumerate the finite subsets as by increasing binary code, and enumerate by , . This is onto, including repetitions such as and .
At levels the generated algebra is and has its unique homomorphism to . At level , after appears, the generated algebra has atoms and and hence two homomorphisms, with respective values and on . Level adds only its complement and has the same two nodes.
At level , the generators include and ; the atoms are , , and . The three homomorphisms select these atoms and have value pairs on the two singletons. The last node restricts to the value- node at level .
At any finite stage let be the finite union of all finite generators seen so far. The generated algebra has the finitely many atomic pieces inside and the single cofinite remainder . Evaluation at is the unique level node assigning to every finite member of that subalgebra and to every cofinite member. These nodes restrict coherently, so they form the branch illustrated by steps 2.1 and 3.1.
The union homomorphism is when is finite and when is cofinite. Its zero fibre is therefore . This is proper and prime: if are both cofinite then is cofinite, so can be finite only when at least one of is finite. This explicit prime ideal agrees with F2's existence conclusion.
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
- Standard finite–cofinite Boolean algebra; explicit instance of the local countable compactness tree (standard reference, not scraped)