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 homologically simply connected plane domain has connected spherical complement
Statement
Let be a homologically simply connected complex domain. Then is connected.
Facts & Assumptions
Given: A homologically simply connected complex domain .
A homologically simply connected complex domain is a complex domain in which every cycle with trace in the domain has index at every omitted point (Homologically simply connected complex domains, A complex domain is a nonempty connected open subset of ).
A compact subset of an open Euclidean set lies in the interior of a compact Jordan set contained in that open set, and that Jordan set may be chosen as a finite union of closed grid rectangles (A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set).
Chain integrals and indices are additive in the chain, reversing orientation negates the index, and a sum of cycles is a cycle (Chain integration and the index are additive in the chain, and reverse with it).
For a closed contour, the winding number about a point off the trace equals the increment of a continuous argument divided by (The winding number is the increment of a continuous argument divided by ).
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
Suppose, toward a contradiction, that is disconnected. Then for disjoint nonempty closed subsets . Since , relabel so that . Because the Riemann sphere is a metric space, the disjoint closed sets and have disjoint open neighbourhoods and in with and . The inclusion forces , so is compact in and . Hence .
Apply [L2] to the compact set , viewing as . It gives a finite union of closed grid rectangles with . Give each rectangle boundary its positive orientation, sum those boundary chains, and cancel every interior edge with its opposite by [L3]. Let be the remaining chain. Then is a cycle, and its trace is the frontier of , so .
Let lie on no grid line. Exactly one grid cell of contains . Along the positively oriented boundary of , the continuous argument of increases by , while along the boundary of every other grid cell it has increment because lies outside that cell. Therefore [L4] gives winding number for about and for every other cell boundary, and additivity from [L3] yields .
Fix . Because , choose a disc and then choose on no grid line. The disc misses , so local constancy from [L5] and step 3.1 give .
The point lies in , while step 2.1 gives . Step 4.1 yields , so [L1] says that is not null-homologous in , contradicting the homological simple connectivity of . Therefore the assumption of step 1.1 was false, and is connected.
Depends on
- Homologically simply connected complex domains
- A complex domain is a nonempty connected open subset of $\mathbb C$
- A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set
- Chain integration and the index are additive in the chain, and reverse with it
- The winding number is the increment of a continuous argument divided by $2\pi$
- The index of a cycle is locally constant off its trace and vanishes far from it
Used by
Dependency tree · two levels
54 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
- L. V. Ahlfors, Complex Analysis, 3rd ed., Ch. 4, §§4.2-4.3 (standard reference, not scraped)
- J. Lebl, Guide to Cultivating Complex Analysis, Ch. 4, §4.3 (standard reference, not scraped)