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.
Complex projector tangents are skew-Hermitian commutator directions
Statement
Let and define the tangent space by velocities of differentiable curves in . Then For each skew-Hermitian , the curve can be realized near as , where
Facts & Assumptions
Given: in a finite-dimensional complex inner-product space and a skew-Hermitian matrix .
The rank- projector domain consists of Hermitian idempotents with trace (Rank-r orthogonal projector domain).
At , the tangent directions are exactly the Hermitian off-diagonal blocks between and its orthogonal complement; every such block is realized by the graph chart (Graph charts and tangent directions for complex rank-r projectors).
The inner product is linear in its first argument, conjugate-linear in its second, and positive definite; the adjoint satisfies (Real and complex inner-product spaces and their induced length, The norm induced by a real or complex inner product, The adjoint is characterised by ).
For a linear map on an -dimensional space, (Rank-nullity: ). A subspace of an -dimensional space having dimension equals the whole space (If and is a linear subspace of , then is finite-dimensional, , and if and only if , claim 2).
Matrix inversion has derivative , and matrix differentials obey product and adjoint rules (On the invertible locus, , Matrix differentials obey the sum rule, product rule, and adjoint rule).
Matrix multiplication, identity, and trace use their finite-coordinate definitions (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes, The trace as the sum of the diagonal entries).
Proof
Put . If and for a nonzero , then . By [F3], , while this equation gives , a nonzero real number. This contradiction shows ; is also injective. By [F4], , hence . Thus each vector has a unique preimage. This inverse map is linear: if and , then , so uniqueness identifies the inverse of with . Therefore is invertible for every real .
Put , so . Since and are polynomials in , they commute, and the same holds for . For , the adjoint rules in [F5] give . Thus . In finite dimension this makes unitary.
We have . From and [F5], , hence the product rule gives . The curve lies in : unitarity preserves self-adjointness and idempotence, and by the finite trace identity . Its derivative at zero is , so every such commutator is tangent.
Conversely, by [F2] any tangent at has block form in . Set , which satisfies . With , block multiplication gives . Thus every tangent is a skew-Hermitian commutator direction, proving the equality.
Depends on
- Rank-r orthogonal projector domain
- Graph charts and tangent directions for complex rank-r projectors
- Real and complex inner-product spaces and their induced length
- The norm $\lVert v\rVert=\sqrt{\langle v,v\rangle}$ induced by a real or complex inner product
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- On the invertible locus, $D\operatorname{inv}(A)[H]=-A^{-1}HA^{-1}$
- Matrix differentials obey the sum rule, product rule, and adjoint rule
Used by
Dependency tree · two levels
59 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
- Alan Edelman, Tomás A. Arias, and Steven T. Smith, The Geometry of Algorithms with Orthogonality Constraints, SIAM Journal on Matrix Analysis and Applications 20 (1998), §2.5 (standard reference, not scraped)
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3, Princeton University Press (2008), §§3.4.4 and 3.5.7 (standard reference, not scraped)