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

Euler characteristic and genus of a Seifert disk-and-band surface

Statement

Assume the Axiom of Countable Choice. If a connected compact oriented disk-and-band surface F is built from s disjoint disks by attaching c rectangular bands along boundary intervals and has one boundary component, then χ(F)=s−c and g(F)=(1−s+c)/2. In particular, if the Seifert algorithm on an oriented knot diagram D has s Seifert circles and c crossings, its output surface has genus (1−s+c)/2 and the knot genus satisfies g(K)≤(1−s+c)/2. This is an upper bound from one spanning surface, not a minimality assertion.

Facts & Assumptions

Given: ACω, a connected disk-and-band surface made from s disks and c bands with one boundary component; for the final clause, F is the output for an oriented knot diagram D representing K.

[F1]

The finite-cell Euler characteristic is the alternating sum of the numbers of cells. (Euler characteristic of a finite CW complex)

[F2]

Under ACω, a connected compact oriented surface with b>0 boundary circles has χ=2−2g−b. (Finite surface normal forms, Jordan disks, and torsion control)

[F3]

A connected compact oriented embedded surface with boundary K is admissible in the set defining g(K). (Seifert surfaces and smooth knot genus)

[F4]

For a one-component regular diagram with s smoothed circles and c crossings, the algorithm uses s disk records and one band record per crossing. (Seifert disk-and-band construction from an oriented knot diagram)

[F5]

For such a knot diagram, the realized disk-and-band surface is connected, oriented, embedded, and has boundary the represented knot. (Seifert disks and bands form an embedded oriented spanning surface)

[A1]

The Axiom of Countable Choice is the sequence principle stated in the item. (The Axiom of Countable Choice (ACω))

Proof

1.1givenF1constructalgebra

Subdivide the disk boundaries so all band-attachment intervals are subcomplexes. Start with s disjoint disks, each with Euler characteristic 1. Relative to the two attaching intervals, a rectangular band has two free long sides and one square 2-cell; collapsing the square across one free long side leaves one relative 1-cell joining the intervals. Thus the band changes the alternating cell count by −1. By [F1], after c bands χ(F)=s−c.

2.1step 1.1F2A1algebra

The single boundary component gives b=1. By [F2] and [A1], s−c=χ(F)=2−2g(F)−1=1−2g(F), so g(F)=(1−s+c)/2.

3.1F3F4F5step 2.1givenalgebra∎

For the algorithm output on D, [F4] identifies the counts with its s circles and c crossings, and [F5] makes the output an admissible Seifert surface. By [F3], the minimum defining knot genus is at most this surface's genus, yielding g(K)≤(1−s+c)/2.

Depends on

Used by

Dependency tree · two levels

38 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