Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Closure, distributivity, and chain conditions for forcing orders

Definition

Let κ be an infinite regular cardinal and let P be a nonempty forcing preorder, with stronger conditions smaller. The order is κ-closed if every descending sequence ⟨pξ:ξ<γ⟩ of length γ<κ has a common lower bound. It is κ-distributive if the intersection of every family of fewer than κ dense open subsets of P is dense. It is κ-cc if every antichain has cardinality below κ.

Thus ccc is ℵ1-cc. “Countably closed” or “σ-closed” means ℵ1-closed: all countable descending chains have lower bounds. It does not mean ω-closed, which only addresses finite chains and is automatic for a preorder with its last member as a lower bound.

Depends on

Dependency tree · 2 levels

Sources