Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

Knot genus is invariant under mirroring and reversal

Statement

Assume the Axiom of Countable Choice. Let K be a smooth oriented knot in S3, and let r:S3→S3 be an orientation-reversing reflection. Give r(K) the image orientation, and let −K denote reversal of the knot orientation. Then g(K)=g(r(K))=g(−K)=g(−r(K)).

Facts & Assumptions

Given: ACω, a smooth oriented knot K, and a smooth reflection r of S3.

[F1]

Knot genus is the minimum genus among connected compact smooth oriented surfaces whose oriented boundary is the knot. (Seifert surfaces and smooth knot genus)

[F2]

For a connected compact orientable surface with one boundary component, reversing its orientation or applying a diffeomorphism preserves its genus. (Finite surface normal forms, Jordan disks, and torsion control)

[A1]

ACω is the sequence-choice principle. (The Axiom of Countable Choice (ACω))

Proof

Given: The knot K, reflection r, and ACω.

1.1givenF1F2A1construct

If F is any spanning surface for K, its image r(F) is a connected compact smooth surface with boundary r(K). Push the orientation of F forward to orient r(F); reversing the boundary orientation instead is achieved by reversing the orientation on r(F). By [F2], all these surfaces have genus g(F). Thus every genus admissible for K is admissible with the same value for r(K) and −K.

2.1givenstep 1.1algebra∎

Apply the same argument using r−1=r and orientation reversal again. This gives the reverse inclusion of the sets of admissible genera, so their minima agree for all four knots.

Depends on

Used by

Dependency tree · two levels

32 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