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 of an orientable compact surface
Statement
Assume the Axiom of Choice (The Axiom of Choice). A nonempty compact connected orientable boundaryless topological surface has a unique genus and Euler characteristic . The sphere has , represented by a genuine paired digon. In particular, is even and at most .
Facts & Assumptions
Given: as in the statement.
Classification of compact connected surfaces identifies every nonempty compact connected orientable boundaryless surface with either the sphere or the explicit -torus sum for some . Its canonical finite CW cell counts are respectively and , and it proves uniqueness of the model integer. Its only AC use is inherited from finite triangulation.
For a finite CW complex the Euler characteristic is the alternating cell count (Euler characteristic of a finite CW complex).
Proof
Apply [L1]. In the sphere case define ; its paired digon gives by [L2]. In the remaining orientable case [L1] supplies the -fold torus word, with , one vertex, paired edges and one face. Hence by [L2].
The formula gives . Thus no second nonnegative integer can be the genus of the same surface; this agrees with the uniqueness in [L1]. Because is integral, is even and at most . The AC assumption enters only through [L1], not through this arithmetic.
Remarks
The empty reduced word is only notation for the genus-zero terminal case; the geometric sphere model remains the paired digon.
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
- Gallier and Xu, A Guide to the Classification Theorem for Compact Surfaces (standard reference, not scraped)