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.
Connected sums of compact connected surfaces, with disk and gluing choices retained
Definition
Let and be nonempty compact connected boundaryless topological 2-manifolds (Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces). Choose embedded closed disks and whose boundaries lie in the respective coordinate charts, and choose a homeomorphism . Define the connected-sum model to be
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), where for every and all other points are identified only with themselves. When and are oriented, we require to reverse the induced orientations of the two boundary circles. For unoriented factors, the homeomorphism is part of the model data.
An iterated connected sum retains the disks, boundary maps, and parentheses used at every binary gluing. In this library, a displayed standard normal form uses the fixed polygonal model obtained by concatenating its indicated handle blocks or crosscap blocks . No assertion that changing the disk or gluing choices preserves the homeomorphism type is included in this definition; later proofs use the explicit models they construct.
Depends on
Used by
Dependency tree · two levels
10 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
- Gallier and Xu, A Guide to the Classification Theorem for Compact Surfaces (standard reference, not scraped)
- Koch, Classification of Surfaces (standard reference, not scraped)