Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Genus-two orientable polygon

Example

The octagon schema of Polygonal schemas and paired boundary edges with boundary word a b a−1b−1c d c−1d−1 realizes the connected sum of two tori (Connected sums of compact connected surfaces, with disk and gluing choices retained). It is orientable and has V=1, E=4, F=1, hence χ=−2 (Euler characteristic of a finite CW complex). This finite cut-and-paste computation uses no choice axiom.

Facts & Assumptions

Given: The convex octagon P with vertices v0,…,v7 in cyclic order and sides a=v0v1, b=v1v2, a−1=v2v3, b−1=v3v4, c=v4v5, d=v5v6, c−1=v6v7 and d−1=v7v0, with each side pair identified by the affine reversal and Y=P/R the realization.

[L1]

Schema conventions: a polygonal schema is finite data of oriented nondegenerate disks with boundary sides paired by specified homeomorphisms (affine when the sides are straight), and its realization is the quotient; a bigon (a disk with two sides meeting at its two corners) occurs as an intermediate piece of cut-and-paste moves; the quotient vertices are the corner classes, the edges the paired side classes and the faces the disk interiors, giving a finite cell structure with counts (V,E,F); in a one-polygon word a pair with opposite exponents is orientation compatible and a pair with equal exponents is twisted (Polygonal schemas and paired boundary edges). The same definition proves that the quotient map of a finite polygonal schema is closed.

[L2]

Quotient conventions: a subset A of a quotient's source is saturated when it is a union of fibres, and the open sets of the quotient correspond exactly to the saturated open sets; a subset of the quotient is closed exactly when its preimage is closed (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[L3]

For one-polygon schemas, cutting along an embedded polygonal diagonal whose interior lies in the polygon interior and regluing the two new boundary sides to each other preserves the quotient homeomorphism type, as does the inverse operation of gluing two faces along a paired pair of sides. The same reduction lemma permits cancellation of an adjacent inverse pair of sides when another paired letter remains (Homeomorphism-preserving polygonal schema moves).

[L4]

The square schema with boundary word a b a−1b−1 realizes the torus T2 (Torus commutator polygon).

[L5]

The connected-sum model of Connected sums of compact connected surfaces, with disk and gluing choices retained is the quotient of the disjoint union of S∖int⁡DS and T∖int⁡DT by a homeomorphism of the boundary circles; the disks and the gluing homeomorphism are part of the model data, and no independence of those choices is asserted.

[L6]

An orientation is a continuous generating section of the local homology system, which is locally constant over coordinate balls, so a generator prescribed on the face of a schema continues across an edge exactly when the pairing is orientation compatible (R-orientation of a topological manifold, Orientation local system and orientation cover).

[L7]

The Euler characteristic of a space with finitely many cells is χ(X)=∑n(−1)ncn(X) (Euler characteristic of a finite CW complex).

Verification

technique · direct
1.1L1

Each of the four side pairs identifies two corners: pairing a with a−1 gives v0∼v3 and v1∼v2, pairing b with b−1 gives v1∼v4 and v2∼v3, pairing c with c−1 gives v4∼v7 and v5∼v6, and pairing d with d−1 gives v5∼v0 and v6∼v7; the chain v0∼v5∼v6∼v7∼v4∼v1∼v2∼v3∼v0 shows that all eight corners form a single vertex class. Hence Y has V=1 vertex class, E=4 paired side classes and F=1 face, and these are the cells of its finite CW structure.

1.2L1L3

Let δ be the straight diagonal from v0 to v4; its relative interior lies in the interior of the convex octagon, and cutting P along δ produces the pentagon P1 with vertices v0,v1,v2,v3,v4 and sides a,b,a−1,b−1,δ, together with the pentagon P2 with vertices v4,v5,v6,v7,v0 and sides c,d,c−1,d−1,δ′. By the split identity of [L3] the quotient of P1⊔P2 by the pentagon pairings R1,R2 together with the identification S of the two copies of δ by the natural reversal is homeomorphic to Y; write Y1=P1/R1 and Y2=P2/R2 for the two punctured pieces.

2.1L1L2L3L4

In the notation of step 1.2, each pentagon quotient Yi is homeomorphic to T2 minus an open disk. For i=1, subdivide the free boundary side δ of P1 at an interior point into consecutive sides e,f, and glue a bigon M with boundary word e−1f−1 to P1 by the affine reversals pairing e with e−1 and f with f−1. Merging the two faces along e by [L3] gives a one-face schema with cyclic boundary word f a b a−1b−1f−1; it contains the adjacent inverse pair f−1f after cyclic rotation, and since the pairs a,a−1 and b,b−1 remain, cancellation by [L3] gives the square schema a b a−1b−1, whose quotient is T2 by [L4]. Let q:P1⊔M→T2 be the quotient map followed by this homeomorphism. The interior M∘ is a saturated open subset of the source, and q is injective on it, so D1:=q(M∘) is an open disk in T2 and q(P1)=T2∖D1. The summand P1 is closed in P1⊔M, though it is not saturated because each point of the subdivided boundary side is also represented on ∂M. The finite-schema quotient map q is closed by [L1], so its restriction q∣P1:P1→q(P1)=T2∖D1 is a closed continuous surjection and hence a quotient map. Its fibers are exactly the R1-classes: the bigon pairings identify each subarc of δ with its corresponding bigon side, and the two endpoints of δ are already in one R1-class by the a,b pairings. Consequently Y1=P1/R1≅T2∖D1, with boundary circle the image of δ. The same construction with c,d,δ′ in place of a,b,δ gives Y2≅T2∖D2 for an open disk D2, with boundary circle the image of δ′.

3.1L1L2L5step 1.2step 2.1

The identification S glues the boundary circle of Y1 to the boundary circle of Y2 by a homeomorphism, because both are images of the same diagonal arcs; iterating the quotient by the pairings on each summand gives Y≅(Y1⊔Y2)/S, and by step 2.1 this is exactly the connected-sum model ((T2∖D1)⊔(T2∖D2))/ ⁣∼ϕ of [L5], with the disks and the boundary homeomorphism just constructed. Hence the octagon word realizes the connected sum of two tori.

4.1L1L6step 1.1step 3.1

Each of the four letters occurs once with exponent +1 and once with exponent −1, so by [L1] all four pairings are orientation compatible; the generator carried by the oriented face continues unchanged across each edge class, and its locally constant generator classes supply a continuous generating section as in [L6]. Hence Y is orientable.

5.1L1L7step 1.1step 3.1step 4.1∎

The cell counts of step 1.1 give χ(Y)=V−E+F=1−4+1=−2 by [L7], and this is the Euler characteristic of the connected sum of two tori by step 3.1. Every construction used is a finite explicit quotient, cut or gluing of polygons, so no choice axiom is used.

Remarks

The word a b a−1b−1c d c−1d−1 is the genus-two case g=2 of the commutator word ∏i=1gaibiai−1bi−1, and the count V−E+F=1−4+1=−2 matches 2−2g at g=2. The argument identifies the surface as the connected sum of two copies of the torus of Torus commutator polygon by an explicit double splitting, and never uses the classification theorem or the Axiom of Choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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