Alphabeta Math
Pipeline-generated
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.

Ribbon knots and the slice-ribbon problem — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The square knot is a nontrivial ribbon knot

Example

Assume ACω. Let T be the standard right-handed trefoil, represented by the closure of the standard two-strand braid with three positive half-twists, and let T† be its reverse mirror. Choose the connected-sum balls on arcs colored 0 in the Fox 3-colorings described below. The square knot T#T† is nontrivial, is ribbon, and bounds a smooth properly embedded disk in B4.

Facts & Assumptions

Given: ACω, the standard right-handed trefoil T, its reverse mirror T†, and the connected-sum datum specified in the Example.

[F1]

Under ACω, every smooth oriented knot K has K#K† bounding a ribbon immersion in S3, and separately bounding a smooth proper disk whose squared radial function is Morse with only index-0 and index-1 critical points. (A reverse-mirror sum admits an explicit ribbon immersion, A knot summed with its reverse mirror bounds a ribbon disk)

[F6]

Resolving a ribbon immersion gives a smooth proper disk with the same boundary. (Local resolution of ribbon singularities)

[F7]

Under ACω, a ribbon immersion yields a no-maximum disk movie with the stipulated radial product boundary collar. (Ribbon immersions and disk movies without maxima are equivalent)

[F2]

The reverse mirror is reflection of the knot followed by reversal of its knot orientation, and the connected sum uses the fixed orientation-matching gluing convention. (Reverse mirror of an oriented knot, Oriented connected sum and prime knot)

[F3]

A Fox 3-coloring assigns an element of F3 to each diagram arc and satisfies 2xo=xi+xj at every crossing. (Quandles and knot-diagram colorings, The dihedral operation is a quandle)

[F4]

For p=3, the number of Fox p-colorings is unchanged by planar isotopy and every oriented Reidemeister move. (Dihedral Fox coloring counts are preserved by Reidemeister moves)

[F5]

Under ACω, two regular diagrams represent the same oriented knot exactly when connected by a finite sequence of planar isotopies and oriented Reidemeister moves. (Reidemeister's theorem for oriented diagrams)

[A1]

ACω is the sequence-choice axiom used by [F1] and [F5]. (The Axiom of Countable Choice (ACω))

Verification

Given: ACω, T the standard right-handed trefoil, T†, and the stated connected-sum datum.

1.1givenF1F6F7A1construct

Apply [F1] with K=T. Its explicit ribbon immersion has oriented boundary T#T†, so the square knot is ribbon by the A-page definition. Apply [F6] to that immersion to obtain a smooth properly embedded disk in B4 with the same boundary, proving smooth sliceness as well. Applying [F7] to the same immersion also gives a no-maximum disk movie with its required radial product boundary collar.

1.2F2F3constructalgebra

In the two-strand braid chart with parameter increasing from bottom to top, let S be the color transfer for the positive generator whose overstrand runs from lower left to upper right. By [F3], S(a,b)=(2a−b,a); the inverse crossing has transfer S−1. Direct calculation gives S2(a,b)=(3a−2b,2a−b) and S3(a,b)=(4a−3b,3a−2b)=(a,b) in F32. Hence S−3 is also the identity. Starting each trefoil tangle with the ordered pair (0,1) therefore satisfies the braid closure conditions for both the trefoil and its mirror. The first arc in each closure has color 0; choose those arcs for the connected-sum datum. The colorings glue because the shared arc colors agree, and the color-1 arcs remain, giving a nonconstant Fox 3-coloring of the square knot.

2.1F4F5step 1.2algebra∎

A crossing-free diagram of the unknot has one arc and exactly three Fox 3-colorings, one for each residue. The square-knot diagram has those three constant colorings and the nonconstant coloring from step 1.2, so its coloring count is at least four. If it were isotopic to the unknot, [F5] would give a finite Reidemeister sequence between their diagrams, and [F4] would preserve the coloring count, a contradiction. Thus the square knot is nontrivial.

Diagram

The schematic depicts one positive generator and its inverse in the two-strand braid. The braid parameter increases upward; the continuous strand is over, and the understrand has a gap. The top and bottom labels are ordered by left and right position. The calculation in step 1.2, rather than the drawing, verifies the three-crossing closure colorings.

ab2a¡baS(a;b)=(2a¡b;a)abS¡11(a;b)S¡12(a;b)S¡1

Remarks

The Fox-coloring calculation proves nontriviality. The direct ribbon immersion in [F1] proves ribbonness, and its resolution in [F6] proves smooth sliceness. The general conversion between arbitrary no-maximum disk movies and ribbon immersions is supplied separately on the A page; this example also has the explicit immersion from [F1].

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Under full AC, the right-handed trefoil is not ribbon

Statement refuted

Assume the full Axiom of Choice. The standard right-handed trefoil is a ribbon knot.

Facts & Assumptions

Given: Full AC and the standard right-handed trefoil T.

[A1]

Full AC is the choice-function principle. (The Axiom of Choice)

[F1]

Under full AC, the standard right-handed trefoil does not bound a smooth properly embedded disk in B4. (The trefoil does not bound a smooth proper disk in the four-ball)

[F2]

Under ACω, every ribbon knot bounds a smooth properly embedded disk in B4. (Every ribbon knot is smoothly slice)

[F3]

Counterexample

The standard right-handed trefoil T has no smooth proper disk in B4, so it cannot admit a ribbon disk whose resolution is such a disk.

1.1givenA1F1

The given full AC is the choice-function principle in [A1]. Applying [F1] under that hypothesis, no smooth properly embedded disk in B4 has boundary T.

1.2givenF2F3construct

If T were ribbon, [F3] would supply the ACω hypothesis of [F2], and [F2] would give a smooth properly embedded disk in B4 with boundary T.

2.1givenstep 1.1step 1.2contradiction∎

Step 1.2 contradicts step 1.1. Therefore the trefoil is not ribbon, refuting the statement.

Diagram

The box denotes the three-crossing positive two-strand braid whose closure is the standard right-handed trefoil. The closure arcs join equal endpoint positions outside the box. This encoded diagram fixes the standard trefoil used in the counterexample; the proof relies on the nonsliceness supplier, not on the drawing.

¾31leftendpointrightendpoint

Sources