Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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 curvature identity for an arc reduced disc diagram

Statement

For a finite diagram D with arbitrary corner angles and with the arc-reduction conventions below,

vk(v)+fk(f)=2(VE+F)=2.

This includes zero-face trees, the isolated point, and spurs, with all boundary and link incidences counted with multiplicity.

Facts & Assumptions

Given: A finite planar simply connected diagram D, with V vertices, E edges and F faces, and an arbitrary real angle on every face corner.

[F1]

The curvature formulas use edge germs and corner multiplicities; an isolated point has empty link and a spur tip has singleton link (Arc reduction and combinatorial curvature of a disc diagram).

Proof

1.1

The total number of vertices in all links is 2E, one per edge germ, including two for a loop. The total number of link edges is fd(f), one per corner. Hence vχ(lk(v))=2Efd(f). Each angle occurs once in the vertex sums and once in the face sums, with opposite signs. Substitution into [F1] therefore gives vk(v)+fk(f)=2V2E+fd(f)f(d(f)2)=2(VE+F).

F1algebra
1.2

If a planar diagram has a face, some edge of a face borders the unbounded region of the union of faces: take a ray from an interior point in a generic direction and its last crossing of this finite union. Such an edge has only one incident face. Remove that open edge and the open face. A polygon retracts to the complementary boundary path, with all other cells fixed; thus the remainder is connected and simply connected and still planar. This operation removes one edge and one face and preserves VE+F. Repeating removes every face. The remaining graph is connected and has no cycle, since a cycle in a planar graph without faces is a hole.

given
2.1

The remaining finite tree, if not a point, has an end vertex: a longest simple path cannot extend at either end. Removing an end vertex and its edge preserves VE and leaves a tree. It ends at one vertex, where VE+F=1. Reversing all these operations yields VE+F=1 for D. Arc suppression also removes one edge and one vertex at each degree-two suppression, preserving this value; the whole-circle convention avoids deleting the final marked vertex.

step 1.2F1
3.1

In a tree there are no angles or faces and k(v)=2deg(v), so the total is 2V2E=2. A deleted spur tip contributes one; at its neighbour the link loses one isolated vertex, raising that neighbour's curvature by one. Thus retaining or removing the spur preserves the total, rather than silently assigning its tip zero curvature. The one-point case contributes two. Combining step 1.1 with step 2.1 gives the identity in every case.

F1step 1.1step 2.1algebra

Depends on

Used by

Dependency tree · two levels

2 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