Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Cochran–Davis–Ray satellite injectivity

Statement

Let P be a pattern of nonzero winding number n. Then P induces an injective function C^{1/n}→C^{1/n}. If P has strong winding number ±1, then it induces injective functions C_ex→C_ex and C_top→C_top. If, in addition, the smooth 4-sphere has a unique smooth structure up to diffeomorphism, then P induces an injective function C_sm→C_sm. No sliceness hypothesis on P(U) is required in this theorem; the proof constructs an auxiliary pattern with ribbon closure.

Facts & Assumptions

Given: A pattern P and two knots K,J with P(K) concordant to P(J) in the category under consideration.

[F1]

Strong winding means normal generation by the axis meridian (Satellite operators on concordance classes).

[F2]

The four concordance categories have the ambient and coefficient conventions in their definition (Exotic and localized homology concordance classes).

[F3]

Weak injectivity and the auxiliary connected-sum reduction are proved with their category hypotheses (Weak injectivity and auxiliary-pattern reduction).

[F4]

The finite connected-sum/inverse instances for these actual knots and concordances are available without an ambient choice axiom by the compact-input construction in [F3], step 1.1. The general group theorem records these same operations with AC_omega (The CDR concordance categories are abelian groups); its stronger choice assumption is not a premise of this unqualified theorem.

[F5]

The satellite assignment descends to the concordance classes after concordance preservation (Satellite operators preserve concordance).

[F6]

The ordinary smooth branch uses the special smooth S⁴-complement assertion (The CDR smooth four-ball complement under the smooth four-sphere hypothesis).

Proof

1.1F2F3F4givenconstruct

Use the finite-input choice qualification in [F3]: encode the actual finite knots, pattern and witnessing concordance, including the finite smooth presentation and chain homotopies when localized coefficients are involved. Execute only the unconditional geometry in L[r] and decode actual compact witnesses, finite group words and chain identities into V. Thus the finite uses of [F4] below do not apply an AC_omega theorem without its premise. No countable collection of representatives is selected. In the conditional ordinary smooth direction, the actual contractible smooth ball and capped sphere are constructed and decoded before the supplied smooth sphere-uniqueness hypothesis is applied in V. No transfer of that conditional hypothesis to L[r] is made.

2.1F2F4F5step 1.1givenalgebra

Suppose P(K)=P(J) as concordance classes. By [F5] these values are defined in the chosen category, and the group law gives −[P(K)]#[P(J)]=0.

3.1F3step 2.1

Apply the auxiliary-pattern reduction [F3] to obtain R with R(−K#J)=U, closure R(U)=−P(K)#P(K) ribbon, and winding w(R)=w(P).

4.1F1F3step 3.1

If P has strong winding ±1, [F3] preserves strong winding for R; in the localized branch R has the same nonzero winding.

5.1F2F3F4F6step 4.1algebra∎

The weak-injectivity part of [F3] applies to R and yields −K#J=U, hence K=J. In ordinary smooth concordance the last step uses [F6] and assumes uniqueness of the smooth structure on S⁴.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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