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.
Extension of finite partial prime-ideal diagrams
Statement
Let be finite Boolean subalgebras of a Boolean algebra . Every homomorphism extends to a homomorphism . Consequently every finite partial prime-ideal diagram extends across any prescribed finite subset of .
Facts & Assumptions
Given: The finite subalgebras and a homomorphism .
A finite partial prime-ideal diagram is a homomorphism on its whole finite subalgebra, and finite generated subalgebras have nonzero cells as atoms. Finite partial prime-ideal diagrams
Proof
The finitely many atoms of have join . At least one has -value , since ; at most one does, since distinct atoms have meet whereas two value- atoms would have meet of value . Let be this unique atom.
The atoms of below have join : intersect the atomic decomposition of with . Because , at least one such -atom is nonzero. This chooses one element from one finite nonempty set, not a choice function on a family.
Define exactly when . Since is an atom, it lies below exactly one of , and exactly when both and ; hence preserves , and therefore . Thus is a Boolean homomorphism.
For , the selected -atom lies below exactly one of , and . If , uniqueness in step 1.1 forces , hence ; if , then , so and . Therefore .
Given a finite , take . The cell description makes finite, step 4.1 extends the original diagram to , and its domain contains ; this is precisely extension across . It is not called a diagram deciding , because the preceding definition reserves that phrase for a diagram whose domain is exactly .
Depends on
Used by
Dependency tree · two levels
2 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
- Tressl, Stone Duality for Boolean Algebras, §2.2, pp. 4–8; finite atom argument (standard reference, not scraped)