Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Positive relative consistency of CH and GCH

Statement

Con⁡(ZF) implies Con⁡(ZFC+GCH) and Con⁡(ZFC+CH); consequently Con⁡(ZFC) implies both positive consistency statements.

Facts & Assumptions

Given: The fixed effective presentations used by the preceding theorem; CH is the ℵ0 instance of its selected GCH sentence.

[F1]

Formal consistency of ZFC plus GCH relative to ZF proves in PA that Con⁡(ZF) implies Con⁡(ZFC+GCH).

Proof

1.1givenconstruct

There is a fixed finite ZFC+GCH proof of CH: instantiate GCH at the first infinite initial ordinal and expand the selected cardinal notation. Hence appending this proof and replacing uses of the CH axiom gives a primitive-recursive map from any ZFC+CH refutation to a ZFC+GCH refutation, and PA verifies the map by its finite line-prefix check. Therefore Con⁡(ZFC+GCH) implies Con⁡(ZFC+CH).

2.1F1step 1.1∎

Combining step 1.1 with F1 gives both implications from Con⁡(ZF). Separately, the inclusion of every certified ZF axiom in ZFC gives an identity-on-lines primitive-recursive map from ZF refutations to ZFC refutations. Thus PA proves Con⁡(ZFC)→Con⁡(ZF). Composing this with the two implications already proved gives both conclusions from Con⁡(ZFC) as claimed.

Depends on

Dependency tree · 2 levels

Sources