Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Index of the boundary of a graph-bounded plane region

Statement

A Puiseux-analytic arc is a compact graph whose defining function is analytic on the open parameter interval and has a convergent one-sided Puiseux expansion at each endpoint, as in Slab triangulation of a compact plane region bounded by finitely many piecewise real-analytic curves.

Let w<w′, let α,β:[w,w′]→R be continuous with α≤β, real-analytic on (w,w′), and suppose the graph of α and the graph of β are Puiseux-analytic arcs. Put T:={(x,y)∈C:w≤y≤w′, α(y)≤x≤β(y)}, so that T has interior T∘={(x,y):w<y<w′, α(y)<x<β(y)}, and let γ be the positively oriented boundary contour of T: the concatenation of the bottom segment from (α(w),w) to (β(w),w), the graph of β traversed with y increasing, the top segment from (β(w′),w′) to (α(w′),w′), and the graph of α traversed with y decreasing, degenerate pieces (when α=β at a wall) being constant paths. Then:

  1. γ is a closed complex contour (Rectifiable complex contours, reversal, concatenation, closedness, and orientation);
  2. n(γ,q)=1 for every q∈T∘ and n(γ,q)=0 for every q∈C∖T (The winding number of a closed contour about a point off its trace);
  3. consequently γ is null-homologous in every open set Ω⊆C with T⊆Ω;
  4. the same two index assertions hold for the region σ(T) with boundary contour σ∘γ, for every orientation-preserving similarity σ(z)=cz+d, c∈C×.

No choice principle is used.

Facts & Assumptions

Given: w<w′, continuous α≤β on [w,w′], real-analytic on (w,w′), with Puiseux-analytic-arc graphs, the region T and its boundary contour γ.

[F1]

The boundary contour γ is a finite concatenation of the graph paths y↦(β(y),y) and y↦(α(y),y) over [w,w′] and the two wall segments; for a closed contour γ and q∉γ∗ a continuous logarithm of γ−q along γ exists, and n(γ,q)=12πi∫γdzz−q=θ(1)−θ(0)2π for every continuous argument θ of γ−q (Every contour missing a point admits a continuous logarithm, unique up to a constant in 2πiZ, The winding number is the increment of a continuous argument divided by 2π, The winding number of a closed contour about a point off its trace).

[F2]

If γ is a closed contour, q∉γ∗ and c∈C×, then γ~:=(γ−q)/c is a closed contour with n(γ~,0)=n(γ,q); this is [F1] applied to the logarithms λ of γ−q and λ−log⁡c of γ~ (Every contour missing a point admits a continuous logarithm, unique up to a constant in 2πiZ). Also γ−, the reversal, satisfies n(γ−,q)=−n(γ,q) (Rectifiable complex contours, reversal, concatenation, closedness, and orientation).

[F3]

n(γ,⋅) is continuous on C∖γ∗, constant on each connected component of that complement, and there is R>0 with n(γ,p)=0 whenever ∣p∣>R (The index of a cycle is locally constant off its trace and vanishes far from it).

[F4]

The graph path of a continuous function on [a,b] that is differentiable with continuous derivative on [a,b] is rectifiable, with finite length (If f is continuous on [a,b], differentiable on (a,b), and f′ extends continuously to [a,b], then the graph of f has length ∫ab1+f′(t)2 dt); a finite concatenation of rectifiable paths is rectifiable (Rectifiable complex contours, reversal, concatenation, closedness, and orientation).

[F5]

For a closed rectifiable loop γ:[0,1]→C× with γ(0)=γ(1)=1 one has n(γ,0)=deg⁡(α) for α=γ/∣γ∣ (For loops in C times, the winding number about 0 equals the circle degree); path-homotopic based circle loops have the same degree (Path-homotopic based circle loops have the same degree, Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints).

[F6]

For a∈C, r>0 and γ1(t)=a+reit, t∈[0,2π], one has n(γ1,z)=1 for ∣z−a∣<r and =0 for ∣z−a∣>r (A circle traversed k times has winding number k inside and 0 outside).

Proof

technique · direct
1.1F4given

(γ is a closed complex contour.) The wall segments are straight paths. Near either endpoint the Puiseux expansion of β has the form β(w+t)=∑j≥0cjtj/m, or the analogous expansion in w′−t. Substituting t=sm parametrizes that graph segment by s↦(∑cjsj,w+sm); both coordinates are C1 on a closed short interval, so the segment has finite length by [F4]. On the remaining compact subinterval the graph is C1 because β is analytic on (w,w′), again giving finite length by [F4]. The same argument applies to α. Thus all four (possibly degenerate) pieces are rectifiable, their concatenation γ is a rectifiable path, and it is closed because consecutive endpoints agree, so γ is a closed complex contour.

1.2F2F5given

(Based homotopies preserve the index.) Let γ0,γ1:[0,1]→C∖{q} be closed rectifiable loops with γ0(0)=γ1(0)=q0≠q, and let F:[0,1]×[0,1]→C∖{q} be continuous with F(j,u)=γj(u) for j∈{0,1} and F(t,0)=F(t,1)=q0 for all t. Put c=q0−q≠0, F~(t,u)=(F(t,u)−q)/c and α(t,u)=F~(t,u)/∣F~(t,u)∣; then F~ takes values in C×, is a path homotopy between the loops γ~j=(γj−q)/c based at 1, and α is a path homotopy between the based circle loops αj=γ~j/∣γ~j∣; by [F5] the degrees of α0 and α1 are equal, and by [F5] and [F2] applied to the closed rectifiable loops γ~j based at 1, n(γj,q)=n(γ~j,0)=deg⁡(αj); hence n(γ0,q)=n(γ1,q).

1.3F3given

(Exterior case.) Let q=(xq,yq)∈C∖T. If yq<w, the vertical ray {(xq,y):y≤yq} is disjoint from T because every point of T has y≥w>yq; if yq>w′, the upward vertical ray {(xq,y):y≥yq} has the same property; if w≤yq≤w′ and xq>β(yq) (the endpoint case yq∈{w,w′} included, since every point of T at height yq has first coordinate in [α(yq),β(yq)]), the rightward horizontal ray {(x,yq):x≥xq} is disjoint from T; and if xq<α(yq) the leftward horizontal ray {(x,yq):x≤xq} is disjoint from T. These cases exhaust C∖T, since a point with w≤yq≤w′ and α(yq)≤xq≤β(yq) lies in T. Each chosen ray is a connected set containing q, contained in C∖γ∗ (because γ∗⊆T) and meeting {p:∣p∣>R} for R as in [F3]; hence n(γ,q)=0 by [F3].

2.1step 1.2givenalgebrachoose

(Interior case: reduction to a rectangle.) Let q=(xq,yq)∈T∘. Choose M>max⁡{xq, sup⁡[w,w′]β} and M′′>−min⁡{xq, inf⁡[w,w′]α}, and put q0:=(α(w),w)≠q. For t∈[0,2] let Rt be the region bounded by the graphs αt,βt:[w,w′]→R, αt:=(1−s(t))α−s(t)M′′ and βt:=(1−r(t))β+r(t)M, where r(t)=min⁡{t,1} and s(t)=max⁡{0,t−1}; then αt≤βt are continuous, real-analytic on (w,w′), and q0 lies on the bottom wall of Rt because αt(w)≤α(w)≤β(w)≤βt(w). Parametrize the boundary of Rt by the five arcs bottom-from-q0, right graph of βt, top wall, left graph of αt, bottom-to-q0, the parameter on each arc being proportional to the arc parameter; every coordinate is built from s(t),r(t) and the continuous functions α,β by affine operations, so (t,u)↦P(t,u) is continuous, P(t,0)=P(t,1)=q0, and P(t,⋅) is a positively oriented closed contour. Moreover q∈Rt∘ for every t: indeed αt(yq)≤α(yq)<xq<β(yq)≤βt(yq) in the first stage and αt(yq)≤α(yq)<xq<M in the second, with w<yq<w′ fixed by q∈T∘. Hence (t,u)↦P(t,u) is a based homotopy in C∖{q} from P(0,⋅)=γ to P(2,⋅)= the positively oriented boundary of the rectangle R:=[−M′′,M]×[w,w′], which is rectifiable as a finite concatenation of segments; by step 1.2, n(γ,q)=n(∂R,q).

2.2step 1.2F6givenalgebra

(Interior case: reduction of the rectangle to a circle.) Write q=(xq,yq) and for each direction θ let ρ(θ) be the unique positive number with q+ρ(θ)eiθ∈∂R; explicitly ρ(θ) is the minimum of the positive numbers among (M−xq)/cos⁡θ for cos⁡θ>0, (−M′′−xq)/cos⁡θ for cos⁡θ<0, (w′−yq)/sin⁡θ for sin⁡θ>0 and (w−yq)/sin⁡θ for sin⁡θ<0, so ρ is continuous and positive on [0,2π]. With θ0 the argument of q0−q and r0:=∣q0−q∣=ρ(θ0), put G(t,θ):=q+((1−t)ρ(θ)+tr0)eiθ for t∈[0,1] and θ∈[θ0,θ0+2π]; then G is continuous, G(t,θ0)=q+ρ(θ0)eiθ0=q0 for every t, so G is a based homotopy of closed curves in C∖{q}, with G(0,⋅) a positively oriented parametrization of ∂R and G(1,⋅) the circle of radius r0 about q traversed once positively. By step 1.2 and [F6], n(∂R,q)=n(circle,q)=1.

3.1step 2.1step 2.2

(Interior case concluded.) For q∈T∘ steps 2.1 and 2.2 give n(γ,q)=n(∂R,q)=1.

4.1step 1.3step 3.1F1given

(Similarity invariance.) Let σ(z)=cz+d with c≠0 and let q∉γ∗. By [F1] there is a continuous logarithm λ of γ−q along γ; then λ+log⁡c is a continuous logarithm of σ∘γ−σ(q)=c(γ−q) along σ∘γ, so by [F1] the two contours have the same index, n(σ∘γ,σ(q))=n(γ,q). Hence for q′∈σ(T∘), writing q′=σ(q) with q∈T∘, step 3.1 gives n(σ∘γ,q′)=1; and for q′∉σ(T) the point q=σ−1(q′) lies in C∖T, so step 1.3 gives n(γ,q)=0 and therefore n(σ∘γ,q′)=0. Multiplication by c≠0 is orientation-preserving, so σ∘γ is the positively oriented boundary contour of σ(T), and clause 4 follows.

5.1step 3.1step 1.3given∎

(Conclusion.) Steps 3.1 and 1.3 give the two index assertions. For the homology claim, define H:[0,1]2→T,H(s,t)=((1−s)α(y(t))+sβ(y(t)), y(t)),y(t)=w+(w′−w)t. This is continuous and its restriction to the positively oriented boundary of the square traces γ. Thus γ is null-homotopic in T⊆Ω, and a null-homotopic loop represents zero in singular homology, so it is null-homologous in Ω. The construction selected only finitely many explicit numbers (M, M′′, the parameters of the arcs), so no choice principle is used.

Remarks

The two index computations replace the unavailable general Jordan curve theorem by explicit deformations: the graph-bounded region is straightened into a rectangle by moving its two graph sides to distant vertical lines while the basepoint stays on the bottom wall, and the rectangle is then deformed radially onto a circle through the basepoint. Only the circle theorem A circle traversed k times has winding number k inside and 0 outside supplies a numerical index; the deformations are compared through the degree of the normalized loop, whose invariance under path homotopy is Path-homotopic based circle loops have the same degree. For a point outside the region the index vanishes by the ray argument, which is the same device used in Admissible cycle around a compact plane set. This lemma is the plane-local input of the residue theorem on a compact Riemann surface; it is stated for regions, not for the interior of an arbitrary closed curve, exactly because the general Jordan curve theorem is not available here.

Depends on

Used by

Dependency tree · two levels

88 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