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

MA plus not CH implies SH

Statement

In ZFC, Martin's Axiom together with the failure of the continuum hypothesis implies the Suslin Hypothesis:

MA+¬CHSH.

Facts & Assumptions

Given: ZFC, MA, and ¬CH.

[F1]

MA is the scheme MA(κ) for every infinite cardinal κ<20. Martin's Axiom at a cardinal and Martin's Axiom

[F2]

CH says that there is no set A with NAP(N). The continuum hypothesis, and what this page does not prove

[F3]

Every well-orderable set has a cardinality equinumerous with it, and equinumerous well-orderable sets have equal cardinalities. A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used

[F4]

For well-orderable sets X,Y, an injection XY implies XY; for cardinals, κλ is equivalent to an injection κλ. Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and κλ if and only if κ injects into λ

[F5]

Under AC, P(N)=20 and 0<20. Assuming the Axiom of Choice, 2κ=P(κ), and Cantor's theorem in cardinal form: κ<2κ

[F7]

MA(1) implies that no Suslin tree exists. MA(aleph-one) eliminates Suslin trees

[F8]

In ZFC, SH is equivalent to the nonexistence of a Suslin tree. Kurepa equivalence

[A1]

AC well-orders the CH witness and its power-set bound, so their strict injection comparisons can be converted into cardinal inequalities. The Axiom of Choice

Proof

1.1

Since CH fails, negating F2 gives a set A with NAP(N). By A1 all three sets are well-orderable. F3 and F4 turn the two injections into 0AP(N). Both inequalities are strict: equality on the left would give AN by F3, and equality on the right would give AP(N), contradicting the two strict comparisons that define the witness. With F5 this is 0<A<20.

F2F3F4F5A1
2.1

The middle term A is a cardinal by F3. Since F6 makes 1 the least cardinal strictly above 0, step 1.1 gives 1A<20, and hence 1<20.

F3F6step 1.1
3.1

The cardinal 1 is infinite, so F1 and step 2.1 instantiate the MA scheme at 1. Thus MA(1) holds, and F7 implies that no Suslin tree exists.

F1F7step 2.1
4.1

Apply the direction “no Suslin tree implies SH” of F8. This yields SH, as required. AC was used in step 1.1 to cardinalize the witness and is also propagated through F7 and F8; no choice-free conclusion is asserted.

F7F8A1step 1.1step 3.1

Depends on

Used by

Dependency tree · two levels

49 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