Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 B is complete, or Dedekind complete, if every subset A⊆B has a least upper bound ⋁A. Complements then give greatest lower bounds by ⋀A=¬⋁{¬a:a∈A}. The empty bounds are ⋁∅=0 and ⋀∅=1. The one-element Boolean algebra is allowed.

For a topological space X, int⁡E is the union of the open subsets of E, and E‾ is the intersection of the closed subsets containing E. An open set U is regular open if U=int⁡U‾. Write RO⁡(X) for the set of regular open subsets, ordered by inclusion. Its proposed operations, justified by Regular open algebra in ZF ↗, are

⋁U=int⁡⋃U‾,⋀U=int⁡⋂U,¬U=int⁡(X∖U)=X∖U‾.

Here the empty union is ∅ and the empty intersection is X; finite meets will be ordinary finite intersections, and the bounds will be ∅,X. No separation axiom on X is assumed.

A Boolean homomorphism h:B→C is order-continuous if it preserves every supremum and infimum that exists in B: whenever b=⋁BA exists, h(b)=⋁Ch[A], and likewise for infima. This includes empty families. An order-dense Boolean embedding i:B→C is an injective Boolean homomorphism such that each 0<c∈C has some b∈B with 0<i(b)≤c. 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.

Depends on

Dependency tree · 2 levels

Sources