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.
Type I, Type II, and elementary regions for Green's theorem
Definition
A compact Type I region is
where , the continuous piecewise- functions satisfy , and on . A compact Type II region is defined analogously by continuous piecewise- functions on :
An elementary Green region admits both descriptions. By A region between two continuous graphs is Jordan measurable, and a continuous integrand extending to its closure integrates by vertical sections, each Type I description is compact and Jordan measurable.
A finite elementary Green region is a nonempty finite union of elementary Green regions with pairwise disjoint interiors. Pairwise intersections must be finite unions of complete shared boundary arcs and endpoints, and every positive-length internal arc must belong to exactly two pieces with opposite induced orientations. This supplied decomposition is part of the data; it is not inferred from an arbitrary closed curve.
Depends on
Used by
- Green's theorem is the curl statement for a planar field lifted to ℝ³ Corollary
- The normal component of the curl is the limiting circulation per unit area of shrinking discs Corollary
- The planar divergence theorem: the flux form of Green's theorem Corollary
- Positive orientation of elementary-region boundaries Definition
- The induced boundary chain and circulation of a C² patch over a finite elementary Green region Definition
- Stokes' theorem on a flat disc and on a hemisphere with the same induced boundary circle Example
- The planar divergence theorem on a rectangle, checked against a direct boundary computation Example
- FALSE: Stokes' theorem requires the surface to be a graph over a coordinate plane False statement
- Shared boundary arcs cancel when finitely many elementary regions are glued Lemma
- The Type II boundary identity for the Q dy term Lemma
- Green's theorem for finite unions of elementary regions Theorem
- The area theorem for exterior univalent functions Theorem
- The classical Stokes theorem for a C² patch over a finite elementary Green region Theorem
Dependency tree · two levels
9 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
- J. Lebl, Basic Analysis II, section 10.6 (standard reference, not scraped)