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 index of a cycle is locally constant off its trace and vanishes far from it
Statement
Let be a complex chain which is a cycle, and put . Then the trace is compact, is open, and:
- for with and , so is continuous on ;
- is constant on every connected component of , and each such component is open, so the index is locally constant;
- there is with for every with .
Consequently is open and contains .
If then is the infimum of the empty set and clause 1 is not asserted; in that case for every and clauses 2 and 3 hold with .
Facts & Assumptions
Given: A cycle ; the plane carries the Euclidean metric of as the Euclidean plane and as a normed real algebra: what the identification preserves.
The index of a cycle about a point off its trace is an integer (The index of a cycle about a point off its trace is an integer).
A complex chain is a finite list of pairs and its trace is the union of the with (Complex chains, their traces, and cycles).
If on the trace of a rectifiable contour , with , then (ML estimate: a contour integral is bounded by a supremum bound times path length).
For continuous on the trace of a rectifiable contour and , (Complex line integrals are linear in the integrand).
A compact subset of a metric space is closed and bounded (A compact subset of a metric space is closed and bounded); the continuous image of a compact subset is compact (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset); a finite union of compact subsets is compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact); a closed bounded interval is compact (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).
The connected component is the union of all connected subsets containing (Connected components, quasicomponents, and totally disconnected spaces), and every component of an open subset of is open and polygonally connected (Every connected component of an open subset of is open and polygonally connected).
The continuous image of a connected subset is connected (A continuous image of a connected space is connected, and connectedness is a topological property), and a connected subset of is order-convex (The connected subspaces of with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in ").
A set is closed exactly when its complement is open, and a set is open exactly when each of its points admits a ball inside it (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space); a subset is bounded when it is empty or lies inside some ball (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
A nonempty subset of bounded below has a greatest lower bound (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).
Finite sums in the additive commutative monoid of are additive, and complex-field distributivity permits scaling term by term (A finite sum in a commutative monoid indexed by an arbitrary finite set, is a field, every element is uniquely , and every nonzero element has inverse ).
The integers form an ordered commutative ring and are discrete in ; in particular the only integer of modulus below is , and if then lies strictly between them and is not an integer (The integers form a commutative ring, The integers form a totally ordered ring, Integer part: for every real there is exactly one integer with ).
Proof
Each is the continuous image of a compact interval, hence compact by [L6], so the trace of [L2] is a finite union of compact sets and is compact by [L6], closed and bounded by [L6], and its complement is open by [L9].
Suppose , fix and put , which exists by [L10] and is positive because the complement of the closed set is open, so some ball misses and by [L9]. For and one has and by [L11], so and .
Let satisfy , available from the boundedness in step 1.1 and [L9]. For and , [L11] gives , so [L3], [L4] and [L12] give .
For with the trace lies in , so the bound of step 2.1 holds on it and [L4] gives ; combining the terms with [L3], [L5], [L11] and [L12] yields , which is clause 1 and makes continuous at .
Take . For step 2.2 gives , and is an integer by [L1], so it is by [L13]; this is clause 3.
Let be a connected component of . By [L7], applied to the open set of step 1.1, the component is open and polygonally connected, hence connected; by [L1] the index is integer-valued and by step 3.1 it is continuous, so [L8] makes its image on a connected subset of . That image lies in , so [L13] forces it to be a single point. This is clause 2.
By step 4.1 the set is a union of components of the open set , each open by [L7], hence open; and it contains by step 3.2. If then every is zero or , so for every by [L3] and for every , giving .
Depends on
- The index of a cycle about a point off its trace is an integer
- Complex chains, their traces, and cycles
- Integration over a complex chain and the index of a chain
- ML estimate: a contour integral is bounded by a supremum bound times path length
- Complex line integrals are linear in the integrand
- A compact subset of a metric space is closed and bounded
- The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset
- A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact
- 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
- Connected components, quasicomponents, and totally disconnected spaces
- Every connected component of an open subset of $\mathbb{R}^n$ is open and polygonally connected
- A continuous image of a connected space is connected, and connectedness is a topological property
- The connected subspaces of $\mathbb{R}$ with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in $\mathbb{R}$"
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Open ball, closed ball and sphere in a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Every nonempty set bounded below has an infimum
- Greatest lower bound (infimum)
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- The integers as equivalence classes of pairs of naturals
- The integers form a commutative ring
- The integers form a totally ordered ring
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- $\mathbb C=\mathbb R[x]/(x^2+1)$ as the Euclidean plane and as a normed real algebra: what the identification preserves
Used by
Dependency tree · two levels
147 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 §4.4 (standard reference, not scraped)