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.
Admissible cycle around a compact plane set
Statement
Let with compact and open. Then:
- there is a finite polygonal complex cycle in — a finite chain of directed line segments (Complex chains, their traces, and cycles, Filled complex triangles, their oriented three-edge boundary contours, diameter, and perimeter) — such that
- there are two such cycles , both with index on and outside , whose traces are disjoint, and which are nested:
All indices are those of Integration over a complex chain and the index of a chain. The construction is choice-free: the only selections are from the finitely many cells of a grid, and no supremum over an infinite family is used.
Facts & Assumptions
Given: A compact and an open with .
There is a compact Jordan set , a finite union of closed rectangles of one axis-parallel grid with pairwise disjoint interiors, such that ; we write for its finitely many cells (A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set).
A finite sum of closed complex contours with integer coefficients is a complex chain; the trace of a sum is the union of the traces, a closed contour is a cycle, and the concatenation of the four sides of an axis-parallel rectangle is a closed contour whose trace is its boundary (Complex chains, their traces, and cycles, Filled complex triangles, their oriented three-edge boundary contours, diameter, and perimeter, Goursat's theorem for rectangles: a holomorphic function integrates to zero around every rectangle contained in its domain).
For a chain and , the index is ; it is additive over sums of chains, and reversing a contour negates its index (Integration over a complex chain and the index of a chain, Chain integration and the index are additive in the chain, and reverse with it).
For a closed complex contour and , a continuous argument of exists along , and (Every contour missing a point admits a continuous logarithm, unique up to a constant in , The winding number is the increment of a continuous argument divided by ).
The index of a cycle is continuous, hence locally constant, on the complement of its trace, and is constant on every connected component of that complement (The index of a cycle is locally constant off its trace and vanishes far from it).
If is holomorphic on an open set containing a closed axis-parallel rectangle , then for the positively oriented boundary (Goursat's theorem for rectangles: a holomorphic function integrates to zero around every rectangle contained in its domain).
Proof
Cell index inside. Let be one of the closed grid rectangles, with its positively oriented boundary, and let . Along each of the four sides of the point has a continuous argument: by [L4] a continuous argument of exists, and along a side the perpendicular foot from to the side's supporting line lies in the relative interior of the side, because both coordinates of lie strictly between the corresponding coordinates of ; hence varies monotonically along each side by exactly the angle subtended at by that side, and the four such angles sum to because the four triangles from to the sides tile and their angles at cover one full turn. By [L4], .
Cell index outside. Let be one of the closed grid rectangles and let . Then is strictly to the left of the left side, to the right of the right side, below the bottom side, or above the top side of ; in each case the whole trace lies in an open half-plane bounded by a line through , so a continuous argument of takes values in an interval of length ; its increment is a multiple of by [L4], hence , and .
Cell index outside by Goursat. For and the function is holomorphic on an open set containing , so [L6] gives and hence again; the two computations agree and either may be used below.
Choose and its cells as in [L1]. For each cell , write its four positively oriented directed side contours separately. Form directly as the finite list of those directed side occurrences that are not shared with another cell; a shared grid side has exactly two occurrences, with opposite directions, and neither is put in . This is a chain under [L2], without identifying it with or deleting terms from the list . Its trace is exactly the exposed grid sides, hence . It is a cycle: the sum of the endpoint-boundary functions of all four sides of every cell is zero, while each omitted opposite pair also has zero endpoint-boundary function, so the remaining endpoint counts cancel at every grid vertex.
For lying on no grid line, if and if : the first equality holds because the omitted opposite pairs contribute zero to the index by [L3] and the index is additive, and the second because exactly one cell contains in its interior when , while no cell contains when .
The index is continuous on by [L5]; since the points on no grid line are dense in , [step 2.1] extends by continuity to for every and for every .
Claim 1 follows with this : and , so for ; and implies , so ; the trace of is .
For claim 2, choose a compact Jordan set , again a finite union of grid rectangles, with , and let be the cycle obtained from by the construction of [step 1.4]; then and are disjoint, and for every , in particular for every .
With and as in [step 4.2], also for every : indeed because , and [step 3.1] applied to the Jordan set gives for ; moreover for because .
Claims 1 and 2 are established by [step 4.1] and [step 5.1] together with [step 4.2]: the cycle , and the nested pair , have the stated index properties and traces.
Remarks
-
Why the index-one clause is the only one used to define . Both Holomorphic functional calculus and its homomorphism theorem need a cycle whose index is exactly one on the spectrum and zero outside the holomorphy domain; the nested pair of claim 2 is what makes the product rule for the calculus a single separated double integral rather than a limiting argument.
-
Two different cycles, two different constructions of the same index. The argument-increment computation [step 1.1] and the Goursat computation [step 1.3] are independent, and both are used: the first identifies the index of a cell as one, the second as zero outside.
Depends on
- Complex chains, their traces, and cycles
- Chain integration and the index are additive in the chain, and reverse with it
- Goursat's theorem for rectangles: a holomorphic function integrates to zero around every rectangle contained in its domain
- Integration over a complex chain and the index of a chain
- The winding number is the increment of a continuous argument divided by $2\pi$
- Every contour missing a point admits a continuous logarithm, unique up to a constant in $2\pi i\mathbb{Z}$
- The index of a cycle is locally constant off its trace and vanishes far from it
- A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set
- Filled complex triangles, their oriented three-edge boundary contours, diameter, and perimeter
Used by
Dependency tree · two levels
69 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
- Theo Bühler and Dietmar A. Salamon, Functional Analysis — Definition 5.24 and its cycle-existence remark, printed pp. 227–228 (standard reference, not scraped)
- Vahid Shirbisheh, Lectures on C-star Algebras, v2 — §2.5, printed pp. 43–47 (standard reference, not scraped)