Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 Γ=k<rmkγk be a complex chain which is a cycle, and put M(Γ)=k<r,mk0mkL(γk). Then the trace Γ is compact, CΓ is open, and:

  1. for p0Γ with d=inf{wp0:wΓ} and pp0<d/2, n(Γ,p)n(Γ,p0)M(Γ)pp0πd2, so n(Γ,) is continuous on CΓ;
  2. n(Γ,) is constant on every connected component of CΓ, and each such component is open, so the index is locally constant;
  3. there is R>0 with n(Γ,p)=0 for every p with p>R.

Consequently Ω0:={pCΓ:n(Γ,p)=0} is open and contains {p:p>R}.

If Γ= then d is the infimum of the empty set and clause 1 is not asserted; in that case n(Γ,p)=0 for every pC and clauses 2 and 3 hold with Ω0=C.

Facts & Assumptions

Given: A cycle Γ=k<rmkγk; the plane carries the Euclidean metric of C=R[x]/(x2+1) as the Euclidean plane and as a normed real algebra: what the identification preserves.

[L1]

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).

[L2]

A complex chain is a finite list of pairs (mk,γk) and its trace is the union of the γk with mk0 (Complex chains, their traces, and cycles).

[L3]

Γfdz=k<r,mk0mkγkfdz, and n(Γ,p)=(2πi)1Γdz/(zp) for pΓ (Integration over a complex chain and the index of a chain).

[L4]

If f(z)M on the trace of a rectifiable contour γ, with M0, then γf(z)dzML(γ) (ML estimate: a contour integral is bounded by a supremum bound times path length).

[L5]

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

[L7]

The connected component C(x) is the union of all connected subsets containing x (Connected components, quasicomponents, and totally disconnected spaces), and every component of an open subset of Rn is open and polygonally connected (Every connected component of an open subset of Rn is open and polygonally connected).

[L9]

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).

[L10]

A nonempty subset of R bounded below has a greatest lower bound (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).

[L11]

zw=zw and z+wz+w for complex z,w (Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive).

[L13]

The integers form an ordered commutative ring and are discrete in R; in particular the only integer of modulus below 1 is 0, and if m<n then m+12 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 x there is exactly one integer m with mx<m+1).

Proof

technique · direct
1.1

Each γk 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].

givenL2L6L9
2.1

Suppose Γ, fix p0Γ and put d=inf{wp0:wΓ}, which exists by [L10] and is positive because the complement of the closed set Γ is open, so some ball B(p0,ε) misses Γ and dε by [L9]. For pp0<d/2 and zΓ one has zp0d and zp>d/2>0 by [L11], so pΓ and 1zp1zp0=pp0(zp)(zp0)2pp0/d2.

step 1.1L9L10L11algebra
2.2

Let R0>0 satisfy Γ{z:zR0}, available from the boundedness in step 1.1 and [L9]. For p>R0 and zΓ, [L11] gives zppR0>0, so [L3], [L4] and [L12] give n(Γ,p)M(Γ)/(2π(pR0)).

step 1.1L3L4L9L11L12
3.1

For k with mk0 the trace γk lies in Γ, so the bound of step 2.1 holds on it and [L4] gives γk(1zp1zp0)dz2pp0L(γk)/d2; combining the terms with [L3], [L5], [L11] and [L12] yields n(Γ,p)n(Γ,p0)M(Γ)pp0/(πd2), which is clause 1 and makes n(Γ,) continuous at p0.

step 2.1L3L4L5L11L12
3.2

Take R=R0+M(Γ)/(2π)+1. For p>R step 2.2 gives n(Γ,p)<1, and n(Γ,p) is an integer by [L1], so it is 0 by [L13]; this is clause 3.

step 2.2L1L13
4.1

Let C be a connected component of CΓ. By [L7], applied to the open set of step 1.1, the component C 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 C a connected subset of R. That image lies in Z, so [L13] forces it to be a single point. This is clause 2.

step 1.1step 3.1L1L7L8L13
5.1

By step 4.1 the set Ω0 is a union of components of the open set CΓ, each open by [L7], hence open; and it contains {p:p>R} by step 3.2. If Γ= then every mk is zero or r=0, so Γfdz=0 for every f by [L3] and n(Γ,p)=0 for every pC, giving Ω0=C.

step 3.2step 4.1L3L7

Depends on

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