Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-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.

A square-grid cycle enclosing a compact set

Statement

Let KUC, where K is compact and U is open. Then there is a complex chain Γ with polygonal trace such that

  1. Γ is a cycle;
  2. ΓUK;
  3. n(Γ,z)=1 for every zK.

Facts & Assumptions

Given: A compact set K contained in an open set UC.

[L1]

A compact subset of an open Euclidean set has a compact Jordan neighbourhood inside that open set, and it may be taken to be a finite union of closed grid rectangles (A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set).

[L2]

The winding number of a closed contour is its continuous-argument increment divided by 2π (The winding number is the increment of a continuous argument divided by 2π).

[L3]

Chain integrals and indices are additive, and reversing an oriented edge negates its contribution (Chain integration and the index are additive in the chain, and reverse with it).

[L4]

The index of a cycle is locally constant off its trace (The index of a cycle is locally constant off its trace and vanishes far from it).

Proof

technique · constructive
1.1

By [L1], choose a compact Jordan set J such that KintJJU, and write J as a finite union of closed cells from one square grid. Give every cell boundary its positive orientation. Each edge internal to J then occurs twice with opposite orientations; cancel those pairs and let Γ be the finite chain of the remaining oriented frontier edges. At every grid vertex the incoming and outgoing coefficients balance, so Γ is a cycle. Its trace is the frontier of J, hence ΓUK.

givenL1L3construct
2.1

Let pintJ lie on no grid line. Summing the positively oriented boundaries of all cells gives the same integral and index as Γ, because the two orientations of every internal edge cancel by [L3]. For one grid cell Q, the four-edge continuous argument of ζp makes one positive turn when pintQ and returns with zero net turn when pQ; hence [L2] gives n(+Q,p)=1 in the first case and 0 in the second. Exactly one cell containing p contributes 1, so additivity in [L3] gives n(Γ,p)=1.

step 1.1L2L3algebra
3.1

Fix zK. Choose a disc D(z,r)intJ and a point pD(z,r) on no grid line. The disc misses Γ and is connected, so local constancy in [L4] and step 2.1 give n(Γ,z)=n(Γ,p)=1.

step 1.1step 2.1L4choosedischarge-construct

Depends on

Used by

Dependency tree · two levels

50 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