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.
The Jacobian determinant of a holomorphic map is and is positive exactly where
Statement
Let be holomorphic on an open set . At every ,
The determinant is positive exactly where , and it is zero exactly where ; it is never negative.
Facts & Assumptions
Given: A holomorphic map and a point in its open domain.
If , then the real derivative matrix is (Complex differentiability is equivalent to real total differentiability together with a complex-linear derivative, with , or with the Cauchy–Riemann equations).
The Jacobian matrix is the matrix of the first partial derivatives (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).
Complex modulus satisfies , and if and only if (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Proof
By [L1] and [F1], .
The sum is nonnegative and, by [L2], is zero exactly when ; otherwise it is positive.
Depends on
- Complex differentiability is equivalent to real total differentiability together with a complex-linear derivative, with $\partial_{\bar z}f=0$, or with the Cauchy–Riemann equations
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
Used by
Dependency tree · two levels
19 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, §2.2.4 (standard reference, not scraped)