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.

A supercompact gives the relative consistency of no S-spaces

Statement

For fixed effective presentations and arithmetizations,

Con(ZFC+there is a supercompact cardinal)  Con(ZFC+there are no S-spaces).

This is a formal relative-consistency implication. It neither extracts a transitive model from consistency nor asserts PFA in ZFC.

Facts & Assumptions

Given: The fixed effective theory presentations and arithmetic base used by the formal supercompact-to-PFA supplier.

[F1]

Formal consistency of PFA from a supercompact supplies, for these presentations, the formal implication Con(ZFC+a supercompact)Con(ZFC+PFA) without a countable-transitive- model inference.

[F2]

PFA implies there are no S-spaces: ZFC+PFA proves the sentence asserting that there are no S-spaces.

[F3]

Finite support, weakening, and composition of derivations: Fixed finite derivations may be concatenated after proved sentence premises are replaced by their proofs, with line references shifted accordingly.

[F4]

Primitive-recursive syntax and certified proof checking supplies verified proof parsing, concatenation, line renumbering, and malformed-input defaults.

[F5]

Primitive-recursive functions are representable in Q: Every true or false standard instance of the primitive-recursive certified-proof checker has the corresponding finite numeral proof in PA.

[F6]

Formal consistency transfer from a verified reduction turns a verified total reduction of contradiction certificates into the corresponding formal consistency implication.

[F7]

Fine measures, strong compactness and supercompactness fixes the supercompactness assertion in the source theory. No new large-cardinal property is inferred here.

Proof

technique · direct
1.1

Let TP be ZFC+PFA and let TN be ZFC plus the sentence that there are no S-spaces. Expand the fixed finite mathematical derivation underlying F2 in the chosen calculus: expand its displayed definitions and abbreviations, and replace every invoked proved premise by its fixed derivation. F3 shows that the resulting finite concatenation is a TP-derivation of the extra axiom of TN. Fix its standard code e. The checker from F4 accepts this particular numeral, and F5 supplies a finite PA proof of that positive closed checker instance. Thus both e and PA's verification of e are constructed here; neither is attributed to F2's interface.

F2F3F4F5Given
2.1

Given a purported TN-refutation p, use F4 to check it and to replace each use of the no-S-space axiom by a renamed copy of e. Retain the ZFC axiom lines and append the same logical inferences. This yields a TP-refutation r(p). The construction is a bounded syntactic substitution into the finite code p, with a fixed default on malformed inputs, so the arithmetic base combines the fixed positive checker proof from step 1.1 with induction on the decoded line list to verify that r is total and that PrfTN(p,)PrfTP(r(p),).

F4F5step 1.1
3.1

Apply [F6] to the reduction in step 2.1. The arithmetic base proves Con(TP)Con(TN). Compose this implication with [F1] to obtain the displayed result.

F1F6step 2.1
4.1

The source theory's large-cardinal clause is exactly the one fixed by [F7]. The argument only transforms finite proof codes: it does not choose a generic filter, construct a model of the whole source theory, or infer a transitive model from its consistency. Empty spaces and singleton spaces need no special consistency argument—[F2]'s no-S-space theorem already treats the complete definition—and no converse implication is asserted.

F2F7step 3.1

Depends on

Used by

Dependency tree · two levels

25 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