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.
Cauchy's theorem on a convex complex domain
Statement
Let be a complex domain whose image in is convex in the sense of Complex star-shaped and convex domains are the published Euclidean notions under the identification . If is holomorphic and is a closed rectifiable contour in , then
Facts & Assumptions
Given: A convex complex domain , a holomorphic , and a closed rectifiable contour in .
A complex domain is nonempty and open, and every convex open subset of Euclidean space is star-shaped with respect to each of its points (A complex domain is a nonempty connected open subset of , Star-shaped open subsets of Euclidean space).
Cauchy's theorem on a star-shaped domain makes every closed rectifiable contour integral of a holomorphic function zero (Cauchy's theorem on a star-shaped domain: every closed rectifiable contour integral of a holomorphic function is zero).
Proof
By [L1], choose any and regard as star-shaped with respect to .
Now [L2] applied to the given and gives the displayed zero integral.
Depends on
- Complex star-shaped and convex domains are the published Euclidean notions under the identification $\mathbb C=\mathbb R^2$
- Cauchy's theorem on a star-shaped domain: every closed rectifiable contour integral of a holomorphic function is zero
- Star-shaped open subsets of Euclidean space
- A complex domain is a nonempty connected open subset of $\mathbb C$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 36 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Tang-Kai Lee, Complex Analysis Notes, Section 2.1.2 (standard reference, not scraped)