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.
Positive orientation of elementary-region boundaries
Definition
For a Type I region of Type I, Type II, and elementary regions for Green's theorem, the positive boundary traverses the lower graph from left to right, the right endpoint arc upward, the upper graph from right to left, and the left endpoint arc downward, omitting zero-length arcs. For a Type II description it traverses the right graph upward, the top endpoint arc from right to left, the left graph downward, and the bottom endpoint arc from left to right. In both cases the region remains locally on the left.
For a finite elementary Green region, delete every shared internal arc together with its oppositely oriented copy and retain the orientations of all surviving arcs. Reversal and concatenation are those of Reversal, concatenation, closed paths, and oriented piecewise-C1 reparametrizations.
The surviving arcs form a finite list of oriented piecewise- arcs, called the positive boundary chain . A finite elementary Green region need not be connected and need not be simply connected, so this list need not assemble into a single closed path. Accordingly, for a continuous field on a neighbourhood of the boundary integral is defined as the finite sum
and likewise for the field . When the surviving arcs do assemble into one closed path — in particular for a single elementary region, whose positive boundary is the concatenation of its four arcs — this sum is that path's integral, because vector line integrals add under concatenation (Line integrals under reversal and concatenation). The value is independent of the order of the list, since a finite sum of reals does not depend on its order.
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
- 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 I boundary identity for the P dx term Lemma
- The Type II boundary identity for the Q dy term Lemma
- The classical Stokes theorem for a C² patch over a finite elementary Green region Theorem
Dependency tree · two levels
12 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)