Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Euler characteristic of a finitely triangulated compact surface

Definition

Let M be a compact smooth two-manifold, possibly disconnected, nonorientable or with boundary, and let T=(V,E,F,ϕ) be a curvilinear face-to-face triangulation of M in the sense of Curvilinear face-to-face triangulation. Write V(T)=∣V∣,E(T)=∣E∣,F(T)=∣F∣, counting each vertex once, each edge once (a boundary edge with one incident face is still a single edge), and each closed triangular face once. The Euler characteristic of the triangulated surface (M;T) is χ(M;T):=V(T)−E(T)+F(T).

The number is defined for the supplied triangulation only. Under the axiom of choice, existence of at least one such triangulation for every compact smooth surface carrying a Riemannian metric follows from Finite curvilinear triangulation of a compact Riemannian surface. The independence of χ(M;T) from the choice of triangulation, and hence the notation χ(M), is not assumed here; it is proved later by the well-definedness theorem on this page. A subdivision that inserts vertices in edges or cones a vertex inside a face does not change the value, as recorded by the subdivision lemma on this page.

Source locator

Lee, Riemannian Manifolds: An Introduction to Curvature, Chapter 9, printed pp. 167-172, counts vertices, edges and faces of a geodesic triangulation in the proof of Theorem 9.7 and in Problem 9-5; Datar, Lectures on Riemannian Geometry, Lecture 2, Section 2.2, printed pp. 13-15, uses the same finite count. The definition above is indexed by the supplied triangulation, and the invariance statement is deliberately deferred to the later theorem of this page rather than imported from the sources.

Depends on

Used by

Dependency tree · two levels

13 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