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 plane domain with trivial fundamental group is homologically simply connected
Statement
Let be a complex domain. If every based loop in represents the identity class in its fundamental group, then is homologically simply connected.
Facts & Assumptions
Given: A complex domain whose fundamental group is trivial at every basepoint.
A based loop class is trivial exactly when the loop is path-homotopic to the constant loop at its basepoint (Based loops and the fundamental group).
A closed rectifiable contour path-homotopic relative to the endpoints to a constant loop has zero integral against every holomorphic function (A closed contour path-homotopic to a constant loop has zero integral against every holomorphic function).
For a complex domain, homological simple connectivity is equivalent to the condition that every cycle has zero integral against every holomorphic function (Equivalent characterisations of a homologically simply connected domain).
A complex chain is a finite integer linear combination of contours, and its integral is the corresponding finite sum of contour integrals (Complex chains, their traces, and cycles, Integration over a complex chain and the index of a chain).
A complex domain is a nonempty connected open subset of , so under the usual identification with it is polygonally connected (A complex domain is a nonempty connected open subset of , For an open subset of , connectedness, path-connectedness and polygonal connectedness are equivalent, Polygonal paths and polygonally connected subsets of ).
Continuous piecewise- paths are rectifiable, and reversal changes sign while concatenation adds for complex line integrals (A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces, Complex line integrals change sign under reversal and add under concatenation).
Proof
Let be a cycle with trace in , and let be holomorphic on . Choose a basepoint . Let For each , [L5] gives a polygonal path in from to ; by [L6] each is a rectifiable contour.
Fix with , and write and . The contour is a based loop at . By the triviality hypothesis, its loop class is the identity, so [L1] makes path-homotopic relative to the endpoints to the constant loop at . Applying [L2] and then [L6] gives hence
By [L4] and step 1.2, Grouping the two finite sums by endpoint and using the boundary formula from [L4], this becomes because is a cycle. Thus for every holomorphic and every cycle in .
The criterion in [L3] now shows that is homologically simply connected.
Depends on
- Based loops and the fundamental group
- A closed contour path-homotopic to a constant loop has zero integral against every holomorphic function
- Equivalent characterisations of a homologically simply connected domain
- Complex chains, their traces, and cycles
- Integration over a complex chain and the index of a chain
- A complex domain is a nonempty connected open subset of $\mathbb C$
- For an open subset of $\mathbb{R}^n$, connectedness, path-connectedness and polygonal connectedness are equivalent
- Polygonal paths and polygonally connected subsets of $\mathbb{R}^n$
- A continuous piecewise-$C^1$ path is rectifiable and its length is the sum of the speed integrals over its pieces
- Complex line integrals change sign under reversal and add under concatenation
Used by
Dependency tree · two levels
55 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
- E. Stein and R. Shakarchi, Complex Analysis, Ch. 3, §5 (standard reference, not scraped)
- L. V. Ahlfors, Complex Analysis, 3rd ed., Ch. 4, §4.4 (standard reference, not scraped)