Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge 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.

Global Gauss-Bonnet for closed oriented surfaces

Statement

Assume the axiom of choice through the parent triangulation and metric-extension suppliers. Let M be a closed oriented Riemannian surface, that is, a compact oriented smooth surface with empty boundary carrying a Riemannian metric g. Then ∫MK dA=2πχ(M), where K is the Gaussian curvature, dA the area form of the orientation, and χ(M) the Euler characteristic of Topological well-definedness of the surface Euler characteristic. For the empty surface M=∅ the identity is the true statement 0=0, since χ(∅)=0.

Facts & Assumptions

Given: A closed oriented Riemannian surface, possibly empty and possibly disconnected, with its metric and orientation.

[A1]

Full AC is inherited exactly through the parent theorem's curvilinear triangulation supplier and is used nowhere else (The Axiom of Choice).

[F1]

A closed oriented Riemannian surface is a compact oriented Riemannian surface with smooth (empty) boundary; when it is viewed as a compact regular region in itself, the regular-region convention admits the empty boundary, and the parent theorem gives ∫MK dA+∫∂Mkg ds+∑jαj=2πχ(M) with both boundary terms omitted when ∂M=∅ (Gauss-Bonnet for compact oriented surface regions with boundary and corners, Regular oriented surface regions with corners).

[F2]

A curvilinear triangulation of the empty surface has V=E=F=∅, so its count is χ(∅)=0−0+0=0, and for a nonempty compact smooth surface the invariant χ(M) is the common value V−E+F of the finite curvilinear triangulations (Topological well-definedness of the surface Euler characteristic).

Proof

technique · apply the boundary-and-corners theorem with empty boundary and split off the empty-surface case
1.1A1F1F2given

If M≠∅, view M as a compact oriented Riemannian surface presented in presentation (a) of the parent theorem with Σ=M and empty boundary, or equivalently in presentation (b) with empty smooth boundary; by [F1] the theorem applies and both the boundary integral and the corner sum are omitted, giving ∫MK dA=2πχ(M), with χ(M) the common count of [F2].

1.2F2givenalgebra

If M=∅, then every finite curvilinear triangulation has no vertices, edges or faces by [F2], so χ(∅)=0; the integral of a function over the empty surface is 0 and the identity reads 0=2π⋅0, which is true.

2.1A1step 1.1step 1.2∎

In both cases the asserted identity holds, and the full-choice assumption was inherited unchanged from the parent theorem through its triangulation supplier; no new choice, orientation cover or classification statement is used.

Source locator

Lee, Riemannian Manifolds: An Introduction to Curvature, Chapter 9, Theorem 9.7, printed pp. 167-172, proves the global formula ∫MK dA=2πχ(M) for a compact oriented surface without boundary; Datar, Lectures on Riemannian Geometry, Lecture 2, Theorem 2.2.4, printed pp. 14-15, gives the same statement. The reduction to the boundary-and-corners theorem with empty boundary is performed here using the library conventions of Regular oriented surface regions with corners, and the Euler characteristic is the invariant of Topological well-definedness of the surface Euler characteristic; the empty-surface case is handled from the triangulation-indexed definition rather than by convention.

Depends on

Used by

Dependency tree · two levels

23 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