Alphabeta Math
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.

✓ 11 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Areas of Elementary Plane Figures

1 · Prerequisites

2 · Summary

Jordan content assigns size to bounded sets through finite inner packings and outer covers, while Fubini evaluates integrals over regions between continuous graphs. Linear change of variables scales content by an absolute determinant, the Euclidean inner product supplies orthogonal projection and distance to a line, and the established characterizations of π give the Riemann graph area of a disc.

Translation invariance is followed by the identification of graph area with Jordan content and then by the disc formula πr2, while the rational points of the unit square show that boundedness alone does not give Jordan area. Orthogonal projection turns a two-dimensional determinant into base times perpendicular height, yielding determinant and base--height formulas for parallelograms and triangles, including their degenerate cases. Compact filled polygonal regions are then defined through their interior, closure, boundary, and connectedness; a finite vertical decomposition gives triangulations, finite additivity sums the triangle contents, and cancellation of internal edges gives the shoelace formula.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Translation of a subset of Rn

Definition

Let n≥1, let E⊆Rn, and let a∈Rn (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). The translate of E by a is

E+a:={x+a:x∈E}.

Translation by a is the bijection τa(x)=x+a, whose inverse is τ−a. In particular, ∅+a=∅.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Jordan inner content, outer content, measurability, and content are translation invariant

Statement

Let n≥1. For every bounded E⊆Rn and every a∈Rn, the translates E+a and E have equal Jordan inner and outer contents. Consequently, E is Jordan measurable if and only if E+a is Jordan measurable, and in that case

cont⁡(E+a)=cont⁡(E).

Here translation is as in Translation of a subset of Rn.

Facts & Assumptions

Given: A natural n≥1, a bounded set E⊆Rn, and a vector a∈Rn.

[L1]

For a bounded set, Jordan outer content is the infimum of the total volumes of finite axis-parallel rectangle covers, and Jordan inner content is the supremum of the total volumes of finite interior-disjoint axis-parallel rectangle families contained in the set (Jordan inner and outer content and Jordan measurable bounded sets in Rm).

[L2]

A rectangle [u,v]⊆Rn has volume ∏j<n(vj−uj) (Axis-parallel rectangles in Rm and their volume).

[L3]

The translate of E by a is E+a={x+a:x∈E}, and translation by a is a bijection with inverse translation by −a (Translation of a subset of Rn).

Proof

technique · direct
1.1L1L2L3

Translation by a sends every axis-parallel rectangle [u,v] bijectively to [u+a,v+a], preserves all side lengths and volumes by [L2], preserves containment and interior-disjointness, and sends finite covers or inner families for E to families of the same total volume for E+a; this also covers the empty family, the empty set, and rectangles with zero side length.

2.1step 1.1L1

Step 1.1 gives outer content of E+a at most that of E and inner content of E+a at least that of E; applying the same argument to translation by −a gives the reverse inequalities, so both respective contents are equal.

3.1step 2.1L1∎

Equality of the two contents for E is therefore equivalent to equality of the two contents for E+a, and when these equalities hold their common values agree.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

Riemann area between continuous graphs equals Jordan content

Statement

Let a<b, let α,β:[a,b]→R be continuous with α≤β, and set

K:={(x,y):a≤x≤b, α(x)≤y≤β(x)}.

Then K is compact and Jordan measurable. Its Jordan content equals its Riemann area between continuous graphs (Riemann area between two continuous graphs and the disc as a vertically simple region):

cont⁡(K)=∫ab(β(x)−α(x)) dx.

Facts & Assumptions

Given: Reals a<b and continuous functions α≤β on [a,b], with K as in the Statement.

[L1]
[L2]

For a continuous H:K→R, that theorem gives ∫KH=∫ab(∫α(x)β(x)H(x,y) dy)dx (A region between two continuous graphs is Jordan measurable, and a continuous integrand extending to its closure integrates by vertical sections).

[L3]

If E is Jordan measurable, then the integral of its indicator over a bounding rectangle equals cont⁡(E) (A bounded set is Jordan measurable iff its indicator is Riemann integrable, and the integral is its Jordan content).

[L4]

The Riemann area between continuous graphs α≤β on [a,b] is ∫ab(β(x)−α(x)) dx (Riemann area between two continuous graphs and the disc as a vertically simple region).

Proof

technique · direct
1.1L1L2L3

Apply [L2] to the constant function H=1 on the compact Jordan set supplied by [L1]; by [L3], the left side is cont⁡(K), while the right side is ∫ab(∫α(x)β(x)1 dy)dx.

2.1step 1.1L4∎

The inner integral is β(x)−α(x), including a zero contribution when the two graphs coincide, so step 1.1 is exactly [L4] and proves the formula.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A closed disc of radius r≥0 has Jordan content πr2

Statement

A closed disc of radius r≥0 has Jordan content πr2.

Facts & Assumptions

Given: A real radius r≥0 and the closed disc Dr:={(x,y)∈R2:x2+y2≤r2}.

[L1]

For every r>0, the Riemann area of the closed disc of radius r is πr2 (A disc of radius r has Riemann area pi r squared; in particular the unit disc has area pi).

[L2]

Every degenerate rectangle has Jordan content 0 (Jordan inner and outer content and Jordan measurable bounded sets in Rm).

[L3]

A region between continuous graphs is compact and Jordan measurable, and its graph area equals its Jordan content (Riemann area between continuous graphs equals Jordan content).

Proof

technique · cases
1.1assume-case zeroL2

In the case r=0, the disc is the singleton {(0,0)}=[(0,0),(0,0)], a degenerate rectangle, so [L2] gives cont⁡(D0)=0=π02.

1.2assume-case posL1L3

In the case r>0, the disc is the region on [−r,r] between the continuous graphs y=−r2−x2 and y=r2−x2; [L3] identifies its Jordan content with its Riemann graph area, which [L1] evaluates as πr2.

2.1step 1.1step 1.2cases-exhaustive∎

The cases r=0 and r>0 exhaust r≥0, and each gives cont⁡(Dr)=πr2.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

FALSE: every bounded plane set has Jordan area

Statement

Every bounded subset of R2 is Jordan measurable and therefore has a Jordan area.

Facts & Assumptions

Given: The set E:=(Q∩[0,1])2⊆R2.

[L1]

A set is bounded if it is empty or is contained in some metric ball (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

[L2]
[L3]

A boundary consists exactly of the points every ball about which meets both the set and its complement (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

[L4]

Every finite inner-packing sum is at most every finite outer-cover sum, and the Jordan contents are their supremum and infimum (Jordan inner and outer content and Jordan measurable bounded sets in Rm).

[L5]

The unit square [(0,0),(1,1)] has rectangle volume (1−0)(1−0)=1 (Axis-parallel rectangles in Rm and their volume).

[L6]

A metric-bounded set is Jordan measurable if and only if its boundary has content zero (A bounded set in Rm is Jordan measurable iff its boundary is null, equivalently of content zero).

Refutation

technique · direct
1.1givenL1

The set E lies in the unit square, hence in a sufficiently large ball about the origin, so it is bounded by [L1].

1.2L4L5algebra

The unit square is both a one-rectangle inner family and a one-rectangle outer cover of itself, each of total volume 1 by [L5]; the inner-versus-outer inequality in [L4] therefore forces both contents to equal 1, so the square does not have content zero.

2.1step 1.1L2L3

By coordinatewise use of [L2], every ball centred at a point of [0,1]2 meets E and also meets its complement, including at the four sides; no point outside the closed square is adherent to E. Thus [L3] gives ∂E=[0,1]2.

3.1step 2.1step 1.2L6

By steps 2.1 and 1.2, the boundary of E does not have content zero, so [L6] shows that E is not Jordan measurable.

4.1step 1.1step 3.1∎

The bounded set E has no Jordan area, contradicting the universal Statement.

Remarks

The same witness is developed further in The rational points of [0,1]2 form a bounded null set that is not Jordan measurable, where its nullity is also proved. That item is not used in this refutation.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Parallelograms and triangles in R2

Definition

For p,v,w∈R2 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn), the closed parallelogram with base point p and spanning vectors v,w is

P(p;v,w):={p+sv+tw:0≤s≤1, 0≤t≤1}.

For A,B,C∈R2, the closed triangle with vertices A,B,C is

T(A,B,C):={A+s(B−A)+t(C−A):s≥0, t≥0, s+t≤1}.

These definitions include singular cases: a spanning vector may vanish, and vertices may be repeated or collinear. They also satisfy P(p;v,w)=p+P(0;v,w) and T(A,B,C)=A+T(0,B−A,C−A) in the notation of Translation of a subset of Rn.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Base and perpendicular height for a chosen side of a plane figure

Definition

Let p,v,w∈R2 with v≠0. For the parallelogram P(p;v,w) (Parallelograms and triangles in R2), the base length along v is ∥v∥2, and the corresponding perpendicular height is

d(w,Rv):=inf⁡t∈R∥w−tv∥2,Rv:={tv:t∈R}.

The infimum is the Euclidean point-to-set distance; it is defined because the line Rv is nonempty (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

For the triangle T(A,B,C) with chosen nonzero side AB, the base length is ∥B−A∥2 and the corresponding height is d(C−A,R(B−A)). This is the distance from C to the full line through A and B, not necessarily to the segment [A,B].

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

∥v∥2 d(w,Rv)=∣det⁡[v w]∣ for v≠0 in R2

Statement

For v≠0, ∥v∥2 d(w,Rv)=∣det⁡[v w]∣.

The nearest point realizing the distance is the orthogonal projection of w onto Rv.

Facts & Assumptions

Given: Vectors v,w∈R2 with v≠0, and the Euclidean base and height of Base and perpendicular height for a chosen side of a plane figure.

[L1]

For an orthonormal basis (ei) of a subspace W, the orthogonal projection is PWu=∑i⟨u,ei⟩ei (Orthogonal projection is linear, and an orthonormal basis (ei) of W gives PWv=∑i⟨v,ei⟩ei).

[L2]

The vector PWu is the unique point of W nearest to u (The orthogonal projection is the unique nearest point in the subspace).

[L3]

For a real 2×2 matrix, the determinant is the signed permutation sum and ∣det⁡A∣ is its ordinary absolute value (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

Proof

technique · direct
1.1L1L2

Put e:=v/∥v∥2. Then (e) is an orthonormal basis of Rv, so [L1] and [L2] give PRvw=(⟨w,v⟩/∥v∥22)v and d(w,Rv)=∥w−PRvw∥2.

2.1step 1.1L3algebra

Writing v=(v1,v2) and w=(w1,w2), inner-product expansion of step 1.1 gives ∥v∥22d(w,Rv)2=∥v∥22∥w∥22−⟨v,w⟩2=(v1w2−v2w1)2=det⁡[v w]2.

3.1step 2.1L4algebra∎

Both ∥v∥2d(w,Rv) and ∣det⁡[v w]∣ are nonnegative, so equality of their squares in step 2.1 and [L4] give the claimed identity.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A parallelogram has Jordan content ∣det⁡[v w]∣, equal to base times height when v≠0

Statement

A parallelogram has Jordan content ∣det⁡[v w]∣, equal to base times height when v≠0.

More precisely, P(p;v,w) (Parallelograms and triangles in R2) is Jordan measurable and

cont⁡(P(p;v,w))=∣det⁡[v w]∣,

including the singular case. If v≠0, this value is ∥v∥2d(w,Rv) in the convention of Base and perpendicular height for a chosen side of a plane figure.

Facts & Assumptions

Given: A base point p∈R2 and spanning vectors v,w∈R2.

[L1]

For column vectors v1,…,vn, the closed parallelepiped is Jordan measurable with content equal to the absolute determinant; this includes the singular case, when the content is zero (The Jordan content of the parallelepiped spanned by the columns of a square real matrix is the absolute value of its determinant).

[L2]

For v≠0, ∥v∥2d(w,Rv)=∣det⁡[v w]∣ (∥v∥2 d(w,Rv)=∣det⁡[v w]∣ for v≠0 in R2).

[L3]

Proof

technique · direct
1.1L1L3

Specialize [L1] to n=2 and use [L3] to translate the origin-based parallelepiped by p; it gives Jordan measurability and cont⁡(P(p;v,w))=∣det⁡[v w]∣, including dependent or zero spanning vectors.

2.1step 1.1L2∎

When v≠0, substitute [L2] into the determinant formula of step 1.1 to obtain content equal to base length times perpendicular height.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

A triangle has content 12∣det⁡[B−A C−A]∣, equal to half base times height when the chosen side is nonzero

Statement

Every triangle T(A,B,C) is Jordan measurable and has content 12∣det⁡[B−A C−A]∣.

If A≠B, then in the convention of Base and perpendicular height for a chosen side of a plane figure,

cont⁡(T(A,B,C))=12∥B−A∥2d(C−A,R(B−A)).

Facts & Assumptions

Given: Vertices A,B,C∈R2 and the triangle of Parallelograms and triangles in R2.

[L1]

A region between continuous graphs is compact and Jordan measurable, and its content equals its graph area (Riemann area between continuous graphs equals Jordan content).

[L2]

A linear map with matrix M sends a bounded Jordan set E to a bounded Jordan set with content ∣det⁡M∣cont⁡(E), including singular M (A linear endomorphism of Rn sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant).

[L3]

For bounded E⊆R2 and a∈R2, E+a and E have equal inner and outer contents (Jordan inner content, outer content, measurability, and content are translation invariant).

[L4]

For v≠0, ∥v∥2d(w,Rv)=∣det⁡[v w]∣ (∥v∥2 d(w,Rv)=∣det⁡[v w]∣ for v≠0 in R2).

[L5]

Proof

technique · direct
1.1L1L5L6L7

The standard triangle S=T((0,0),(1,0),(0,1)) is the region 0≤x≤1, 0≤y≤1−x; [L1], [L5], [L6], and [L7] give cont⁡(S)=∫01(1−x) dx=1/2.

2.1step 1.1L2L3

Let M have columns B−A and C−A. Then T(A,B,C)=A+M(S), so [L2], [L3], and step 1.1 give cont⁡(T(A,B,C))=∣det⁡M∣/2=12∣det⁡[B−A C−A]∣, with the singular cases included.

3.1step 2.1L4∎

If A≠B, apply [L4] with v=B−A and w=C−A in step 2.1 to obtain the half-base-times-height formula.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A triangle has zero Jordan content if and only if its vertices are collinear

Statement

A triangle has zero Jordan content if and only if its vertices are collinear.

Here collinear means that the displacement list (B−A,C−A) is linearly dependent.

Facts & Assumptions

Given: Vertices A,B,C∈R2.

[L1]

Every triangle T(A,B,C) has content 12∣det⁡[B−A C−A]∣ (A triangle has content 12∣det⁡[B−A C−A]∣, equal to half base times height when the chosen side is nonzero).

[L2]

For a real square matrix, ∣det⁡M∣ is the ordinary absolute value of its real determinant (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

Proof

technique · direct
1.1L1L2L3algebra

For the forward implication from collinearity to zero content, dependence in [L3] makes one of the two displacement vectors a scalar multiple of the other, including when either is zero; the two columns then have determinant zero, so [L1] and [L2] give content zero.

2.1L1L2L3algebra∎

For the converse implication, suppose the content is zero. By [L1] and [L2], det⁡[B−A C−A]=0. If B−A=0 the list is dependent by [L3]; otherwise one coordinate of B−A=(u1,u2) is nonzero, and the equation u1v2−u2v1=0 for C−A=(v1,v2) shows by division in that nonzero coordinate that C−A is a scalar multiple of B−A. Thus [L3] gives collinearity.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Simple polygonal regions, diagonals, and triangulations

Definition

A simple polygonal region is a compact connected set P⊆R2 such that int⁡P is nonempty and connected, P=int⁡P‾, and ∂P is the union of the edges of an irredundant simple closed finite polygonal chain.

Explicitly, the boundary chain has distinct cyclic vertices v0,…,vn−1 with n≥3. With indices read modulo n, its closed edges are [vi,vi+1]. Nonconsecutive edges are disjoint, consecutive edges meet only at their common endpoint, and no three consecutive vertices are collinear. Compactness, interior, closure, boundary, and connectedness are taken in the Euclidean metric d2(x,y)=∥x−y∥2 of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, with the notions of Open cover, subcover, compact metric space, and compact subset of a metric space, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, and Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets; finiteness is that of The cardinality ∣A∣ of a finite set.

A diagonal [vi,vj] joins two nonadjacent boundary vertices and its open segment {(1−t)vi+tvj:0<t<1} lies in int⁡P.

A triangulation is a finite family of nondegenerate closed triangles with union P such that the intersection of any two distinct triangles is empty, a common vertex, or a full common edge. It is frugal when the set of all triangle vertices is exactly the boundary-vertex set of P; a general triangulation may also use finitely many subdivision vertices on boundary edges or in the interior.

Remarks

This definition begins with an already given filled set P and imposes conditions on it. It does not assert that every simple closed polygonal chain determines such a set. The boundary-chain convention is called a polygon in Polygonal arcs and polygons as non-self-intersecting finite unions of line segments in R2 ↗, and Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each ↗ supplies the corresponding complementary-region theorem.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

Every simple polygon admits a triangulation

Statement

Every simple polygon admits a triangulation.

Facts & Assumptions

Given: A simple polygonal region with n≥3 boundary vertices, in the sense of Simple polygonal regions, diagonals, and triangulations.

[L1]

A triangulation is a finite family of nondegenerate closed triangles whose union is the polygon and whose pairwise intersections are empty, a common vertex, or a full common edge (Simple polygonal regions, diagonals, and triangulations).

Proof

technique · constructive
1.1givenchooseconstruct

Choose a direction e such that the scalar projections ⟨vi,e⟩ of the finitely many boundary vertices are pairwise distinct. Such a direction exists because only finitely many directions perpendicular to a difference vi−vj are forbidden. Use the projection onto e as the horizontal coordinate and the perpendicular coordinate as the vertical one. No boundary edge is vertical in these coordinates.

2.1step 1.1given

Between two consecutive vertex projections, every boundary edge that crosses the open vertical slab is the graph of an affine function, and disjoint boundary edges have a fixed vertical order throughout the slab. On a vertical line in the slab, the compact set P can change between membership and nonmembership only at one of these boundary crossings. Near such a crossing the boundary is a single straight segment and, because the crossing point is not an interior point of P, the two local sides cannot both lie in P; since P=int⁡P‾, exactly the side belonging to P is filled. Starting below the bounded set and moving upward therefore expresses the part of P in the slab as a finite union of closed bands between consecutive affine boundary graphs.

3.1step 2.1construct

Take the closures of all those bands in the finitely many closed slabs. Insert every boundary--wall intersection as a subdivision vertex and use their common finite refinement on each vertical wall. Before this common refinement, the closure of a nonempty band is a convex triangle or quadrilateral: it is bounded by two vertical segments and two affine graphs that retain their vertical order. The common refinement may add collinear vertices to a vertical side, so each resulting two-dimensional cell is a convex polygon whose boundary carries all wall-subdivision vertices. These cells cover P, and two distinct cells meet only in a union of full consecutive wall segments, a common vertex, or not at all.

4.1step 3.1L1discharge-construct: finite face-to-face triangulation∎

Choose one interior point in each two-dimensional cell. Join it to every boundary vertex of that cell in cyclic order. Convexity keeps every joining segment in the cell, and each consecutive boundary pair with the interior point forms a nondegenerate triangle. These triangles cover the cell. On a shared vertical wall, both adjacent cells use the same refined boundary segments, so triangles from opposite sides meet in a full common refined segment, a common endpoint, or not at all; within one cell the fan triangles meet in a full radial edge, the chosen interior point, or not at all. The resulting finite family is therefore face-to-face, covers P, and is a triangulation by [L1].

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

A simple polygon is Jordan measurable and its content is the sum of the contents of its triangles

Statement

A simple polygon is Jordan measurable and its content is the sum of the contents of the triangles in any triangulation.

Facts & Assumptions

Given: A simple polygonal region P.

[L1]

Every simple polygon admits a triangulation (Every simple polygon admits a triangulation).

[L3]

If bounded Jordan measurable sets E,F have content-zero intersection, then their union is Jordan measurable and cont⁡(E∪F)=cont⁡(E)+cont⁡(F) (Jordan content is finitely additive when the overlap has content zero).

[L4]

The graph of a continuous function on a closed nondegenerate rectangle has content zero (The graph of a continuous function on a closed nondegenerate rectangle in Rm has content zero in Rm+1).

Proof

technique · direct
1.1L1L2choose

Choose a triangulation by [L1]. Each of its finitely many closed triangular faces is Jordan measurable by [L2].

1.2givenL4L5

Distinct faces meet only in a common edge, a common vertex, or not at all. An edge is a graph of a continuous affine function after interchanging coordinates if necessary, so [L4] gives it content zero. A common vertex or the empty set is a subset of such a graph, so [L5] gives it content zero as well. Thus every face intersection has content zero.

2.1step 1.1step 1.2L3

Apply [L3] repeatedly to the finite face family using step 1.2. The union P is Jordan measurable and its content is the sum of all face contents.

3.1step 2.1∎

The same argument applies to any triangulation, and every resulting sum equals the intrinsic number cont⁡(P), so the sum is independent of the triangulation.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

The shoelace formula for the area of a counterclockwise simple polygon

Statement

The shoelace formula gives the Jordan content of a counterclockwise simple polygon.

Precisely, if its cyclic boundary vertices are vi=(xi,yi) for i<n, with vn=v0, then

cont⁡(P)=12∑i<n(xiyi+1−yixi+1).

Facts & Assumptions

Given: A counterclockwise simple polygonal region P with cyclic vertices v0,…,vn−1 and vn=v0 (Simple polygonal regions, diagonals, and triangulations).

[L1]

A simple polygon is Jordan measurable and its content is the sum of the triangle contents in any triangulation (A simple polygon is Jordan measurable and its content is the sum of the contents of its triangles).

[L0]

Every simple polygon admits a triangulation (Every simple polygon admits a triangulation).

[L3]

Finite sums are additive and commute with scalar multiplication (Laws of finite sums and finite products).

Proof

technique · direct
1.1L0L1L2choose

Choose a triangulation by [L0] and orient every triangular face counterclockwise. By [L1] and [L2], the polygon content is the sum over faces of one half of the signed boundary-edge expression det⁡[p,q]+det⁡[q,r]+det⁡[r,p].

2.1step 1.1L3algebra

By [L3], the finite face sum may be regrouped by oriented edges. Every internal edge is traversed once in each direction by its two incident faces, so its two determinant terms cancel.

3.1step 2.1L3algebra∎

Only the counterclockwise boundary edges remain. A triangulation may subdivide the polygon edge from vi to vi+1 at ordered points pj=(1−tj)vi+tjvi+1, but direct bilinearity gives det⁡[pj,pj+1]=(tj+1−tj)det⁡[vi,vi+1], so [L3] makes the subdivision sum equal det⁡[vi,vi+1]. This includes the final edge from vn−1 to v0; expanding the determinants gives the stated cyclic shoelace sum.

5 · Examples, counterexamples and false statements

None yet.

Sources