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.
The winding number is locally constant by an integral estimate
Statement
Let be a closed rectifiable contour of length and let lie off its trace. If satisfies for all and , then . In particular the winding number is locally constant on the complement of the trace.
Facts & Assumptions
Given: A closed rectifiable contour of length , a point off its trace, and a number with for all .
For a closed complex contour and a point off its trace, . (The winding number of a closed contour about a point off its trace).
For continuous on the trace of a rectifiable contour and , . (Complex line integrals are linear in the integrand).
If on the trace of a rectifiable contour with , then . (ML estimate: a contour integral is bounded by a supremum bound times path length).
A closed box in is a compact subset of Euclidean space. (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
For a closed complex contour and a point off its trace, . (The winding number of a closed contour is an integer).
Proof
Let satisfy ; then for every , so also lies off the trace and both winding numbers are defined by the contour integral of the corresponding .
Subtracting the two integrands gives for , so by linearity of complex line integrals .
On the trace and , so the integrand has modulus at most ; the ML estimate with the length of and the factor give , the displayed estimate.
For the local-constancy assertion fix off the trace; if the estimate of step 2.2 bounds the defining integral by for every point off the trace, so the winding number vanishes near ; if , then for each parameter continuity of the rectifiable contour supplies a relative interval containing on which , the family of all such pairs covers the compact parameter interval, so finitely many cover it by [F4], and the minimum of the finitely many positive numbers is a with on .
With that the estimate of step 2.2 gives , which is less than whenever ; the difference of the two winding numbers is an integer by [F5], so it vanishes for every in that relative neighbourhood of , and since was an arbitrary point off the trace the winding number is locally constant on the complement of the trace; no general Jordan theorem or choice principle is used.
Depends on
- The winding number of a closed contour about a point off its trace
- The winding number of a closed contour is an integer
- Complex line integrals are linear in the integrand
- ML estimate: a contour integral is bounded by a supremum bound times path length
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Used by
Dependency tree · two levels
48 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
- L. V. Ahlfors, Complex Analysis, 3rd ed., Ch. 4 §2.1-2.3 (the index of a closed curve, its local constancy, and the Cauchy integral formula) (standard reference, not scraped)
- J. Lebl, Complex Analysis (open text), Ch. 4 §4.1 (the index of a closed curve) (standard reference, not scraped)