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 Hessian determinant of each holomorphic component is nonpositive; a nondegenerate critical point is a saddle
Statement
Let be holomorphic with components. For either component ,
If is a critical point of and , then the determinant is negative and is neither a local maximum nor a local minimum, hence is a saddle in the Hessian-test sense. If the determinant is zero, the Hessian test is inconclusive.
Facts & Assumptions
Given: A holomorphic whose components are , and one component .
Each such component is harmonic: (The real and imaginary parts of a holomorphic function satisfy Laplace's equation and form a harmonic-conjugate pair).
The Hessian is the matrix of second partial derivatives, and a critical point is one at which the gradient vanishes (The Hessian matrix and critical points of a scalar field).
For a function, (Clairaut--Schwarz theorem for continuous second partial derivatives).
At a critical point of a function of two variables, a negative Hessian determinant gives neither a local minimum nor a local maximum, while determinant zero gives no conclusion (The two-variable Hessian determinant test).
Proof
By [F1] and [L2], . By [L1], , so .
If the determinant at a critical point is nonzero, step 1.1 makes it negative, and [L3] gives neither a local maximum nor a local minimum. If it is zero, [L3] gives no conclusion.
Depends on
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: 35 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
- J. Lebl, Guide to Cultivating Complex Analysis, Exercise 2.1.7 (standard reference, not scraped)