Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Cardinal effects of collapse and Lévy-collapse forcing

Statement

In ZFC, if κ is infinite regular and κ≤λ, Col⁡(κ,λ) is κ-closed and its generic union is a surjection κ onto λ. If θ is regular uncountable, Lv⁡(θ) is θ-cc, collapses every nonzero α<θ to countable size, preserves θ, and therefore forces θ=ℵ1.

Facts & Assumptions

Given: AC and the stated regularity hypotheses.

[F1]

Cohen, collapse, and Lévy-collapse forcing orders gives both partial-function orders.

[F4]

Forcing theorem turns dense-set calculations into extension assertions.

Proof

1.1F1F4

A descending sequence of fewer than κ collapse conditions has union of domain size below κ, so Col⁡(κ,λ) is κ-closed. For each ξ<κ and β<λ, the sets requiring ξ in the domain and β in the range are dense (using a fresh coordinate for the latter). Hence the generic union is a total surjection κ↠λ.

1.2F1F3

Given θ many Lévy conditions, F3 thins their finite domains to a delta system with a fixed finite root. At each root coordinate (α,n) there are only ∣α∣<θ possible values; regularity and finiteness of the root therefore leave fewer than θ possible root assignments. Thin the θ conditions until their root restrictions agree. Two remaining conditions then have compatible union, so Lv⁡(θ) is θ-cc.

2.1F2F4step 1.2∎

For every 0<α<θ, the union of the generic restrictions to {α}×ω is total by coordinate dense sets and hits every β<α by range dense sets. It is a surjection ω↠α. step 1.2 and F2 preserve the cardinal and regularity of θ, while all smaller infinite ordinals become countable; hence the extension identifies θ with ℵ1.

Depends on

Dependency tree · 2 levels

Sources