Alphabeta Math
TheoremStatement: 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.

Conditional independence of SH

Statement

In the external metatheory, if ZFC is consistent, then both ZFC+SH and ZFC+¬SH are consistent. Consequently, under the same consistency hypothesis,

ZFCSHandZFC¬SH.

Here consistency and derivability refer to the fixed certified finite proof predicates. The conclusion is conditional metamathematical independence; it is not the assertion that ZFC internally proves its own consistency or either non-derivability statement.

Facts & Assumptions

Given: external Con(ZFC) for the fixed proof predicate and contradiction sentence.

[F1]

External consistency of ZFC implies external consistency of ZFC+SH. External relative consistency of the Suslin Hypothesis

[F2]

PA proves, and hence the external metatheory validates, that consistency of ZFC implies consistency of ZFC+¬SH. Formal relative consistency of not SH

[F3]

Con(T) means that there is no actual certified finite T-refutation of the fixed contradiction. The standard certified provability predicate

[F4]

SH is the assertion that no strong-convention Suslin line exists, so ¬SH is its literal logical negation. The Suslin Hypothesis and Suslin algebras

Proof

technique · contradiction by adjoining the opposite axiom
1.1

By the given consistency hypothesis and [F1], ZFC+SH has no certified finite refutation. By [F2], ZFC+¬SH has no certified finite refutation. These are external conclusions about the two fixed proof predicates; the weaker first supplier prevents promoting this conjunction to a new PA theorem here.

F1F2F3assume-hyp
2.1

Suppose that d were a certified ZFC proof of SH. Every ZFC axiom and logical inference used by d is also available in ZFC+¬SH. Regard d as a derivation in that extension, append its one added axiom ¬SH, and then append a fixed propositional derivation of the chosen contradiction from SH and ¬SH. This would be a certified finite ZFC+¬SH refutation, contrary to step 1.1. Hence ZFCSH.

F3F4step 1.1construct
2.2

Conversely, suppose that e were a certified ZFC proof of ¬SH. View e in ZFC+SH, append the single added SH axiom, and use the same fixed propositional contradiction block with its two premises interchanged. This would refute ZFC+SH, again contradicting step 1.1. Hence ZFC¬SH.

F3F4step 1.1construct
3.1

Steps 1.1-2.2 give both consistency conclusions and both non-derivability conclusions under external Con(ZFC). The argument transforms only actual certified finite proofs. Malformed codes do not satisfy the proof predicate, and the empty line sequence is not silently treated as a refutation. Each hypothetical non-derivability witness uses exactly one occurrence of the opposite extension's added axiom; no set-theoretic choice is made in either proof splice.

F3step 1.1step 2.1step 2.2

Remarks

  • The result says neither SH nor its negation is derivable from ZFC, provided ZFC is consistent. It does not choose a true side of SH in the ambient universe.
  • All uses of the axiom of choice occur inside the object-theoretic suppliers. The final metamathematical proof splices finite derivations and makes no family choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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