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.
Completeness, regular opens, and order continuity
Definition
A Boolean algebra is complete, or Dedekind complete, if every subset has a least upper bound . Complements then give greatest lower bounds by . The empty bounds are and . The one-element Boolean algebra is allowed.
For a topological space , is the union of the open subsets of , and is the intersection of the closed subsets containing . An open set is regular open if . Write for the set of regular open subsets, ordered by inclusion. Its proposed operations, justified by Regular open algebra in ZF ↗, are
Here the empty union is and the empty intersection is ; finite meets will be ordinary finite intersections, and the bounds will be . No separation axiom on is assumed.
A Boolean homomorphism is order-continuous if it preserves every supremum and infimum that exists in : whenever exists, , and likewise for infima. This includes empty families. An order-dense Boolean embedding is an injective Boolean homomorphism such that each has some with . A Boolean completion is such an embedding into a complete Boolean algebra. This definition asserts neither existence of a completion nor extension of a homomorphism.