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 two-level nonlinear projector model has a stationary strict maximum
Example
In with , let , , , and define on Hermitian . Then is a self-adjoint real-linear map, so it defines the allowed nonlinear projector energy . At the commutator stationarity condition holds, but is a strict local maximum, not a minimum.
Facts & Assumptions
Given: , , , , , and .
A rank-one orthogonal projector has the form for a unit vector (Rank-r orthogonal projector domain).
The energy gradient is (Finite-basis projector energy model, The finite projector energy is real and has the stated Frobenius gradient).
A projector is stationary exactly when it commutes with its model gradient (Projector-energy stationarity is equivalent to Fock commutation).
Verification
For Hermitian , and are real, and . Thus is self-adjoint and real-linear; the model's quadratic term is .
For an arbitrary unit vector , put . Then by [F1], , and . A neighborhood of is given by ; every distinct projector there has and hence . Thus is a strict local maximum in the full complex projector domain.
At , , which is diagonal and therefore commutes with . By [F3], is stationary, while step 2.1 shows it is not a local minimum.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 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.