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.
Boolean ideals, filters, prime ideals and ultrafilters
Definition
Let be a Boolean algebra. An ideal contains , is downward closed, and is closed under binary joins. Thus and imply . A filter contains , is upward closed, and is closed under binary meets. These definitions include the improper ideal and filter .
An ideal is proper when ; a filter is proper when . A prime ideal is a proper ideal such that implies or . A prime filter is a proper filter such that implies or .
An ultrafilter is a maximal proper filter under inclusion. A maximal ideal is a maximal proper ideal. Maximality always refers to proper objects. Consequently the trivial algebra has no prime ideals, maximal ideals, proper filters or ultrafilters. These are algebraic filters; a forcing preorder has a different filter definition.
The ideal convention here is downward closure. The upward inequality printed in Tressl 2.2.6(iv)(b) is not adopted.
Depends on
Used by
Dependency tree · one level
1 result within one dependency step 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.2–2.2.6 and 2.2.13, pp. 4–8 (standard reference, not scraped)