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.
Areas of Elementary Plane Figures
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 , 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
Translation of a subset of
Definition
Let , let , and let (The Euclidean inner product on ). The translate of by is
Translation by is the bijection , whose inverse is . In particular, .
Jordan inner content, outer content, measurability, and content are translation invariant
Statement
Let . For every bounded and every , the translates and have equal Jordan inner and outer contents. Consequently, is Jordan measurable if and only if is Jordan measurable, and in that case
Here translation is as in Translation of a subset of .
Facts & Assumptions
Given: A natural , a bounded set , and a vector .
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 ).
A rectangle has volume (Axis-parallel rectangles in and their volume).
The translate of by is , and translation by is a bijection with inverse translation by (Translation of a subset of ).
Proof
Translation by sends every axis-parallel rectangle bijectively to , preserves all side lengths and volumes by [L2], preserves containment and interior-disjointness, and sends finite covers or inner families for to families of the same total volume for ; this also covers the empty family, the empty set, and rectangles with zero side length.
Step 1.1 gives outer content of at most that of and inner content of at least that of ; applying the same argument to translation by gives the reverse inequalities, so both respective contents are equal.
Equality of the two contents for is therefore equivalent to equality of the two contents for , and when these equalities hold their common values agree.
Riemann area between continuous graphs equals Jordan content
Statement
Let , let be continuous with , and set
Then 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):
Facts & Assumptions
Given: Reals and continuous functions on , with as in the Statement.
For this , the region-between-graphs theorem states: is compact and Jordan measurable (A region between two continuous graphs is Jordan measurable, and a continuous integrand extending to its closure integrates by vertical sections).
For a continuous , that theorem gives (A region between two continuous graphs is Jordan measurable, and a continuous integrand extending to its closure integrates by vertical sections).
If is Jordan measurable, then the integral of its indicator over a bounding rectangle equals (A bounded set is Jordan measurable iff its indicator is Riemann integrable, and the integral is its Jordan content).
The Riemann area between continuous graphs on is (Riemann area between two continuous graphs and the disc as a vertically simple region).
Proof
Apply [L2] to the constant function on the compact Jordan set supplied by [L1]; by [L3], the left side is , while the right side is .
The inner integral is , including a zero contribution when the two graphs coincide, so step 1.1 is exactly [L4] and proves the formula.
A closed disc of radius has Jordan content
Statement
A closed disc of radius has Jordan content .
Facts & Assumptions
Given: A real radius and the closed disc .
For every , the Riemann area of the closed disc of radius is (A disc of radius r has Riemann area pi r squared; in particular the unit disc has area pi).
Every degenerate rectangle has Jordan content (Jordan inner and outer content and Jordan measurable bounded sets in ).
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
In the case , the disc is the singleton , a degenerate rectangle, so [L2] gives .
In the case , the disc is the region on between the continuous graphs and ; [L3] identifies its Jordan content with its Riemann graph area, which [L1] evaluates as .
The cases and exhaust , and each gives .
FALSE: every bounded plane set has Jordan area
Statement
Every bounded subset of is Jordan measurable and therefore has a Jordan area.
Facts & Assumptions
Given: The set .
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).
The rationals and the irrationals are both dense in (Both and are dense in , and every nonempty open subset of is uncountable).
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).
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 ).
The unit square has rectangle volume (Axis-parallel rectangles in and their volume).
A metric-bounded set is Jordan measurable if and only if its boundary has content zero (A bounded set in is Jordan measurable iff its boundary is null, equivalently of content zero).
Refutation
The set lies in the unit square, hence in a sufficiently large ball about the origin, so it is bounded by [L1].
The unit square is both a one-rectangle inner family and a one-rectangle outer cover of itself, each of total volume by [L5]; the inner-versus-outer inequality in [L4] therefore forces both contents to equal , so the square does not have content zero.
By coordinatewise use of [L2], every ball centred at a point of meets and also meets its complement, including at the four sides; no point outside the closed square is adherent to . Thus [L3] gives .
By steps 2.1 and 1.2, the boundary of does not have content zero, so [L6] shows that is not Jordan measurable.
The bounded set has no Jordan area, contradicting the universal Statement.
Remarks
The same witness is developed further in The rational points of form a bounded null set that is not Jordan measurable, where its nullity is also proved. That item is not used in this refutation.
Parallelograms and triangles in
Definition
For (The Euclidean inner product on ), the closed parallelogram with base point and spanning vectors is
For , the closed triangle with vertices is
These definitions include singular cases: a spanning vector may vanish, and vertices may be repeated or collinear. They also satisfy and in the notation of Translation of a subset of .
Base and perpendicular height for a chosen side of a plane figure
Definition
Let with . For the parallelogram (Parallelograms and triangles in ), the base length along is , and the corresponding perpendicular height is
The infimum is the Euclidean point-to-set distance; it is defined because the line 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 on ).
For the triangle with chosen nonzero side , the base length is and the corresponding height is . This is the distance from to the full line through and , not necessarily to the segment .
for in
Statement
For , .
The nearest point realizing the distance is the orthogonal projection of onto .
Facts & Assumptions
Given: Vectors with , and the Euclidean base and height of Base and perpendicular height for a chosen side of a plane figure.
For an orthonormal basis of a subspace , the orthogonal projection is (Orthogonal projection is linear, and an orthonormal basis of gives ).
The vector is the unique point of nearest to (The orthogonal projection is the unique nearest point in the subspace).
For a real matrix, the determinant is the signed permutation sum and is its ordinary absolute value (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Every nonnegative real has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
Proof
Put . Then is an orthonormal basis of , so [L1] and [L2] give and .
Writing and , inner-product expansion of step 1.1 gives .
Both and are nonnegative, so equality of their squares in step 2.1 and [L4] give the claimed identity.
A parallelogram has Jordan content , equal to base times height when
Statement
A parallelogram has Jordan content , equal to base times height when .
More precisely, (Parallelograms and triangles in ) is Jordan measurable and
including the singular case. If , this value is in the convention of Base and perpendicular height for a chosen side of a plane figure.
Facts & Assumptions
Given: A base point and spanning vectors .
For column vectors , 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).
For , ( for in ).
Translation preserves Jordan measurability and content (Jordan inner content, outer content, measurability, and content are translation invariant).
Proof
Specialize [L1] to and use [L3] to translate the origin-based parallelepiped by ; it gives Jordan measurability and , including dependent or zero spanning vectors.
When , substitute [L2] into the determinant formula of step 1.1 to obtain content equal to base length times perpendicular height.
A triangle has content , equal to half base times height when the chosen side is nonzero
Statement
Every triangle is Jordan measurable and has content .
If , then in the convention of Base and perpendicular height for a chosen side of a plane figure,
Facts & Assumptions
Given: Vertices and the triangle of Parallelograms and triangles in .
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).
A linear map with matrix sends a bounded Jordan set to a bounded Jordan set with content , including singular (A linear endomorphism of sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant).
For bounded and , and have equal inner and outer contents (Jordan inner content, outer content, measurability, and content are translation invariant).
For , ( for in ).
If on and is integrable, then (The second fundamental theorem: if is differentiable on with and is integrable, then ).
The Riemann integral is linear (Integrable functions on form a set closed under sums and scalar multiples, and ).
Proof
The standard triangle is the region , ; [L1], [L5], [L6], and [L7] give .
Let have columns and . Then , so [L2], [L3], and step 1.1 give , with the singular cases included.
If , apply [L4] with and in step 2.1 to obtain the half-base-times-height formula.
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 is linearly dependent.
Facts & Assumptions
Given: Vertices .
Every triangle has content (A triangle has content , equal to half base times height when the chosen side is nonzero).
For a real square matrix, is the ordinary absolute value of its real determinant (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
A finite vector list is linearly dependent when a nonzero scalar list has zero linear combination (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent).
Proof
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.
For the converse implication, suppose the content is zero. By [L1] and [L2], . If the list is dependent by [L3]; otherwise one coordinate of is nonzero, and the equation for shows by division in that nonzero coordinate that is a scalar multiple of . Thus [L3] gives collinearity.
Simple polygonal regions, diagonals, and triangulations
Definition
A simple polygonal region is a compact connected set such that is nonempty and connected, , and is the union of the edges of an irredundant simple closed finite polygonal chain.
Explicitly, the boundary chain has distinct cyclic vertices with . With indices read modulo , its closed edges are . 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 of The Euclidean inner product on and as the set of functions , and , , 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 of a finite set.
A diagonal joins two nonadjacent boundary vertices and its open segment lies in .
A triangulation is a finite family of nondegenerate closed triangles with union 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 ; 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 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 ↗, and Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each ↗ supplies the corresponding complementary-region theorem.
Every simple polygon admits a triangulation
Statement
Every simple polygon admits a triangulation.
Facts & Assumptions
Given: A simple polygonal region with boundary vertices, in the sense of Simple polygonal regions, diagonals, and triangulations.
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
Choose a direction such that the scalar projections of the finitely many boundary vertices are pairwise distinct. Such a direction exists because only finitely many directions perpendicular to a difference are forbidden. Use the projection onto as the horizontal coordinate and the perpendicular coordinate as the vertical one. No boundary edge is vertical in these coordinates.
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 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 , the two local sides cannot both lie in ; since , exactly the side belonging to is filled. Starting below the bounded set and moving upward therefore expresses the part of in the slab as a finite union of closed bands between consecutive affine boundary graphs.
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 , and two distinct cells meet only in a union of full consecutive wall segments, a common vertex, or not at all.
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 , and is a triangulation by [L1].
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 .
Every simple polygon admits a triangulation (Every simple polygon admits a triangulation).
Every closed triangle is Jordan measurable and has the determinant content formula (A triangle has content , equal to half base times height when the chosen side is nonzero).
If bounded Jordan measurable sets have content-zero intersection, then their union is Jordan measurable and (Jordan content is finitely additive when the overlap has content zero).
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 has content zero in ).
Content zero passes to subsets (Measure zero and content zero in by countable and finite cube covers).
Proof
Choose a triangulation by [L1]. Each of its finitely many closed triangular faces is Jordan measurable by [L2].
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.
Apply [L3] repeatedly to the finite face family using step 1.2. The union is Jordan measurable and its content is the sum of all face contents.
The same argument applies to any triangulation, and every resulting sum equals the intrinsic number , so the sum is independent of the triangulation.
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 for , with , then
Facts & Assumptions
Given: A counterclockwise simple polygonal region with cyclic vertices and (Simple polygonal regions, diagonals, and triangulations).
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).
Every simple polygon admits a triangulation (Every simple polygon admits a triangulation).
A triangle has content one half of the absolute determinant of two displacement vectors (A triangle has content , equal to half base times height when the chosen side is nonzero).
Finite sums are additive and commute with scalar multiplication (Laws of finite sums and finite products).
Proof
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 .
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.
Only the counterclockwise boundary edges remain. A triangulation may subdivide the polygon edge from to at ordered points , but direct bilinearity gives , so [L3] makes the subdivision sum equal . This includes the final edge from to ; expanding the determinants gives the stated cyclic shoelace sum.
5 · Examples, counterexamples and false statements
None yet.
Sources
- M. E. Taylor, Introduction to Analysis in Several Variables, §3.1
- W. F. Trench, Introduction to Real Analysis, §7.3
- W. F. Trench, Introduction to Real Analysis, Theorem 7.2.6
- M. E. Taylor, Introduction to Analysis in Several Variables, Theorem 3.1.9
- W. F. Trench, Introduction to Real Analysis, §§7.2–7.3
- J. Lebl, Basic Analysis, Jordan Measurable Sets
- A. Treibergs, MATH 3225 final solutions
- M. E. Taylor, Introduction to Analysis in Several Variables, Proposition 3.1.10
- W. F. Trench, Introduction to Real Analysis, Theorem 7.3.7
- Geometry: Combinatorics & Algorithms 2020, Chapter 4
- J. Erickson, Simple Polygons, §1.4
- Geometry: Combinatorics & Algorithms 2020, Theorem 4.9
- J. Erickson, Simple Polygons, Theorem 1.5
- Geometry: Combinatorics & Algorithms 2020, Exercise 4.14