Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)
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 L and let p0 lie off its trace. If d>0 satisfies ∣z−p0∣≥d for all z∈Γ∗ and ∣p−p0∣<d/2, then ∣n(Γ,p)−n(Γ,p0)∣≤L∣p−p0∣/(πd2). In particular the winding number is locally constant on the complement of the trace.

Facts & Assumptions

Given: A closed rectifiable contour Γ of length L, a point p0 off its trace, and a number d>0 with ∣z−p0∣≥d for all z∈Γ∗.

[F1]

For a closed complex contour γ and a point p off its trace, n(γ,p)=12πi∫γdzz−p. (The winding number of a closed contour about a point off its trace).

[F2]

For continuous f,g on the trace of a rectifiable contour γ and α,β∈C, ∫γ(αf+βg) dz=α∫γf dz+β∫γg dz. (Complex line integrals are linear in the integrand).

[F3]

If ∣f(z)∣≤M on the trace of a rectifiable contour γ with M≥0, then ∣∫γf(z) dz∣≤ML(γ). (ML estimate: a contour integral is bounded by a supremum bound times path length).

[F5]

For a closed complex contour γ and a point p off its trace, n(γ,p)∈Z. (The winding number of a closed contour is an integer).

Proof

technique · direct
1.1givenF1

Let p satisfy ∣p−p0∣<d/2; then ∣z−p∣≥∣z−p0∣−∣p−p0∣>d−d/2=d/2>0 for every z∈Γ∗, so p also lies off the trace and both winding numbers are defined by the contour integral of the corresponding 1/(z−p).

2.1F1F2step 1.1

Subtracting the two integrands gives 1z−p−1z−p0=p−p0(z−p)(z−p0) for z∈Γ∗, so by linearity of complex line integrals n(Γ,p)−n(Γ,p0)=12πi∫Γp−p0(z−p)(z−p0) dz.

2.2F3step 1.1

On the trace ∣z−p∣≥d/2 and ∣z−p0∣≥d, so the integrand has modulus at most 2∣p−p0∣/d2; the ML estimate with the length L of Γ and the factor (2πi)−1 give ∣n(Γ,p)−n(Γ,p0)∣≤L∣p−p0∣/(πd2), the displayed estimate.

3.1F4step 2.2

For the local-constancy assertion fix p0 off the trace; if L=0 the estimate of step 2.2 bounds the defining integral by 0 for every point off the trace, so the winding number vanishes near p0; if L>0, then for each parameter t continuity of the rectifiable contour supplies a relative interval J containing t on which ∣Γ(s)−p0∣>∣Γ(t)−p0∣/2, the family of all such pairs (t,J) covers the compact parameter interval, so finitely many cover it by [F4], and the minimum of the finitely many positive numbers ∣Γ(ti)−p0∣/2 is a d>0 with ∣z−p0∣≥d on Γ∗.

4.1F5step 3.1∎

With that d the estimate of step 2.2 gives ∣n(Γ,p)−n(Γ,p0)∣≤L∣p−p0∣/(πd2), which is less than 1 whenever ∣p−p0∣<min⁡(d/2,πd2/L); the difference of the two winding numbers is an integer by [F5], so it vanishes for every p in that relative neighbourhood of p0, and since p0 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

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