Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

External relative consistency of the Suslin Hypothesis

Statement

For the fixed proof predicates and contradiction sentence of The standard certified provability predicate, the following external relative-consistency implication holds:

Con(ZFC)Con(ZFC+SH).

Here consistency means that no standard natural number is a certified finite refutation. This corollary does not assert that PA, or any other named arithmetic base, proves the displayed implication, and it does not extract a transitive model of full ZFC from consistency.

Facts & Assumptions

Given: the fixed arithmetizations of ZFC, ZFC+MA+¬CH, and ZFC+SH, with their certified finite proof checkers and the fixed contradiction sentence.

[F1]

Externally, consistency of ZFC implies consistency of ZFC+MA+¬CH by a fixed-finite-fragment model argument; its supplier explicitly does not claim a PA-verified uniform proof-code reduction. Externally fixed-fragment relative consistency of MA and not CH

[F2]

ZFC+MA+¬CH has a fixed finite derivation of SH. MA plus not CH implies SH

[F3]

A formal implication inside an arithmetic base requires that base to verify a total map carrying every certified target refutation to a certified source refutation; external finite-fragment assemblies alone do not provide that conclusion. Formal consistency transfer from a verified reduction

[F4]

Con(T) abbreviates absence of a certified proof of the fixed contradiction for the chosen effective theory T. The standard certified provability predicate

Proof

technique · direct transformation of a hypothetical finite refutation
1.1

Let p be a standard certified ZFC+SH refutation. It has finitely many lines and therefore finitely many occurrences at which the added SH axiom is used; zero occurrences are allowed. All its remaining nonlogical axiom lines are ZFC axioms.

F4assume-hyp
2.1

Fix once and for all the finite ZFC+MA+¬CH derivation dSH supplied by [F2]. Scan p in proof order. Copy logical and ZFC-axiom lines and their inference certificates, and replace each SH-axiom line by a fresh variable-renamed copy of dSH, redirecting later line references to its concluding SH line. Finite recursion on the line number produces a finite certified ZFC+MA+¬CH derivation with the same final contradiction. If p contains no SH-axiom line, this is just the original ZFC refutation regarded in the stronger theory; a single occurrence receives one copy.

step 1.1F2F4construct
3.1

Thus an actual inconsistency of ZFC+SH would give an actual inconsistency of ZFC+MA+¬CH. By [F1] the latter would give an inconsistency of ZFC. Contraposition proves the displayed external implication.

F1step 2.1
4.1

The first transformation is an explicit standard finite-proof splice, but [F1] promises only an external fixed-fragment assembly. Since no arithmetic base and no base-verified total code map for that second leg have been supplied, [F3] forbids upgrading step 3.1 to an internal PA proof of the consistency implication. Likewise, consistency alone is not a transitive-model existence theorem, so no such model is inferred.

F1F3step 3.1

Remarks

  • The stronger MA theory is used only as an intermediate proof system. The conclusion retains SH but does not retain MA or ¬CH.
  • The argument concerns standard certified finite proofs. It does not replace the fixed proof predicate by an informal notion of derivability.

Depends on

Used by

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources