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

Least-weight lexicographic essential normal disks are fundamental

Statement

Let M be a compact PL three-manifold with a finite simplicial triangulation T. Among its essential normal disks choose one of least edge weight, and among those choose F with lexicographically least normal vector. Then F is fundamental in the original seven-coordinate system of T.

Consequently, if M contains a properly embedded PL disk whose boundary is not null-homotopic in ∂M, it contains such a disk that is a fundamental normal surface. No ambient orientability, irreducibility or exclusion of projective planes is required, and no choice hypothesis is introduced.

Statement references

Normal-surface coordinates and the Haken cone — admissible normal vectors and fundamentalness in the original triangulation.

Minimum boundary exchange cycles force an impossible zero-edge normal component — the final finite cycle contradiction.

Facts & Assumptions

Given: The finite triangulation and either the extremal normal disk of the first assertion or an essential proper PL disk for the consequence.

[F1]

Every essential proper PL disk has an essential normal replacement in the same triangulation. (Essential PL disks admit normal disk replacements)

[F2]

A nontrivial admissible decomposition of a least-weight essential normal disk produces the reduced original-triangulation pair of an inessential-boundary disk and an annulus or Mobius band, with at least two proper double arcs. This reduction includes the finite exclusions of spherical and projective-plane summands. (A nonfundamental least-weight essential disk has a pure boundary obstruction)

[F3]

Such a reduced boundary pair cannot occur for a least-weight essential disk whose vector is lexicographically least: its finite minimum-leaf cycle produces a nonempty zero-edge component of a genuine partial regular resolution. (Minimum boundary exchange cycles force an impossible zero-edge normal component)

Proof

1.1givenF2F3contradictionalgebra

Suppose the vector of F were not fundamental. By Normal-surface coordinates and the Haken cone, it would be x+y for two nonzero admissible integer vectors. Their quad supports are compatible, since their nonnegative sum has at most one quad type in any tetrahedron. Thus [F2] supplies its actual original-triangulation reduced boundary pair. The assumed weight and lexicographic minimality are exactly those of [F3], which excludes that pair. This contradiction proves fundamentalness of F.

2.1givenF1step 1.1construct∎

For the consequence, normalize the given essential disk by [F1]. The set of essential normal disks is therefore nonempty. Its edge weights are positive integers, so choose their least value. Among vectors at this value, lexicographic minimization requires only finitely many natural-number minima: minimize the first coordinate, then the second among those retained, and so on through the 7t coordinates. Each step leaves a nonempty set, and the resulting vector is realized by an essential normal disk. This finite construction uses no selection from an infinite family. Apply step 1.1 to that disk to obtain the claimed fundamental one in the same triangulation.

Depends on

Used by

Dependency tree · two levels

16 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