Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 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.

The Klein bottle as a square quotient

Definition

The Klein bottle is the quotient K of the unit square Q=[0,1]2 by

(x,0)∼(x,1),(0,y)∼(1,1−y)

with the quotient topology (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). The named surface uses the convention for topological manifolds without boundary in Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces.

The four corners form one vertex class: the horizontal pairing identifies (0,0) with (0,1) and (1,0) with (1,1), while the vertical pairing identifies (0,0) with (1,1) and (0,1) with (1,0). There are two edge classes and one face. The four corner sectors join, under the paired edge germs, in the cycle (00)−(01)−(10)−(11)−(00): the bottom-top pairing joins (00) to (01) and (10) to (11), while the left-right pairing joins (00) to (11) and (01) to (10). Thus a neighborhood of the vertex is a disk. Interior points already have disk neighborhoods, and the two half-disks at an edge interior join to a disk. Thus the quotient has no boundary.

The square Q is compact by Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line. The quotient is compact as the continuous image of Q and connected as the image of a connected square. Its edge-pairing relation is a finite union of the diagonal, closed graphs of the two affine edge maps, and finitely many vertex pairs, hence is closed in Q×Q. The product Q×Q=[0,1]4 is compact by the same Heine–Borel theorem. If q:Q→K is the quotient map, then for closed F⊂Q the saturation q−1(q(F)) is the projection of that closed relation intersected with F×Q; it is compact and therefore closed in Q (In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones). The quotient topology makes q(F) closed. Distinct equivalence classes are disjoint compact subsets of the Hausdorff square, so they have disjoint open neighborhoods U,V (In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones). The open sets K∖q(Q∖U) and K∖q(Q∖V) separate their quotient points, proving Hausdorffness. A countable basis for Q gives a countable basis for K by taking, for each finite union B of basis members, K∖q(Q∖B): these are open, and compactness of each fiber shows they refine every quotient-open neighborhood. (Each fiber is closed in the compact square, hence compact.) The definition and this finite verification use no full choice axiom; any finite selection is covered by finite choice.

Orient the square boundary counterclockwise. The bottom and top sides form the oppositely traversed a,a−1 pair; the right and left sides form the equally traversed b,b pair. The one-polygon word is therefore aba−1b. The later example checks its orientability and Euler characteristic directly.

Depends on

Used by

Dependency tree · two levels

44 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