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 contour formula for a locally single-valued holomorphic inverse
Statement
Let be open, let be holomorphic on , let be a closed complex contour null-homologous in , and let satisfy for every . Suppose has exactly one solution inside , that solution is simple, and . Then
Thus, on a contour enclosing exactly one simple preimage branch, the inverse value is recovered by a contour integral.
Facts & Assumptions
Given: A holomorphic function on an open set , a closed null-homologous contour , and a value satisfying the hypotheses of the statement.
The weighted argument principle multiplies each zero contribution by the value of the holomorphic test function there (The weighted argument principle).
The preimage-count corollary identifies the zeros of inside (The argument principle counts preimages of a target value).
Proof
Because is holomorphic, the meromorphic function has no poles. The hypotheses say that its only zero inside is the simple zero .
Apply [L1] to the meromorphic function and the holomorphic test function . By step 1.1, there is only one zero contribution, its multiplicity is , and the additional hypothesis makes that contribution exactly . The left-hand side is exactly the displayed contour integral.
Therefore the contour integral equals . The role of [L2] is to identify the unique enclosed zero as the unique preimage of .
Depends on
Used by
Dependency tree · two levels
7 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
- J. Lebl, Guide to Cultivating Complex Analysis, §5.4 discussion after Theorem 5.4.1 (standard reference, not scraped)
- R. W. Howell and J. H. Mathews, Complex Analysis, §8.7 (standard reference, not scraped)