Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 Stiefel and Grassmann optimization conventions

Definition

For 1≤r≤n, set St⁡C(n,r)={X∈Cn×r:X∗X=Ir} and Gr⁡C(r,n)=St⁡C(n,r)/U⁡(r). The class [X] represents the complex column space of X; two orthonormal frames represent the same space exactly when they differ by right multiplication by a unitary r×r matrix. Regard each complex matrix space as a real vector space and use the real Frobenius inner product ⟨U,V⟩R:=Re⁡tr⁡(U∗V). Give the complex Stiefel manifold its induced metric. On the complex Grassmann quotient, represent tangent vectors horizontally by matrices Z with X∗Z=0 and pair these representatives by ⟨⋅,⋅⟩R. For A=A0+iA1∈Cn×r, write ρ(A):=(A0−A1A1A0)∈R2n×2r for its realification, the real matrix acting on real/imaginary coordinates as A acts on complex coordinates. Write Herm⁡(A)=(A+A∗)/2.

Facts & Assumptions

Given: Integers 1≤r≤n and complex matrix spaces with their usual real-coordinate topology.

[F1]

A Riemannian metric is a smooth positive-definite real bilinear pairing on each tangent space (Riemannian metric and riemannian manifold).

[F2]

The coordinatewise product on a finite real coordinate space is its Euclidean inner product (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F3]

Complex Stiefel frames are quotiented by the right unitary action, and graph charts give the Grassmannian's local coordinates (Stiefel spaces, Grassmannians, and tautological bundles).

Proof

technique · identify complex matrices with pairs of real matrices and verify the quotient pairing
1.1F1F2givenalgebra

Write U=A+iB and V=C+iD with real matrices. For z=x+iy, ρ(U)(x,y)=(Ax−By,Bx+Ay), the real and imaginary parts of Uz; hence ρ(UV)=ρ(U)ρ(V), ρ(U)T=ρ(U∗), and, when U is invertible, ρ(U−1)=ρ(U)−1. Also ⟨U,V⟩R=tr⁡(ATC+BTD), the ordinary Euclidean inner product on the real and imaginary coordinates. It is real bilinear, symmetric, and positive on nonzero matrices by [F2]; its restriction to each real tangent space is positive definite, as required by [F1].

1.2F1F2F3givenalgebra

In a local complex Grassmann graph chart, choose a smooth orthonormal frame section X(u) from the frame-bundle trivialization in [F3], and set P(u)=X(u)X(u)∗. For a chart tangent v, differentiating X(u)∗X(u)=I makes A=X(u)∗DXu[v] skew-Hermitian. The first term X(u)A is vertical: for every skew-Hermitian A, the Cayley curve Q(t)=(Ir−t2A)−1(Ir+t2A) satisfies Q(t)∗Q(t)=Ir near zero and Q(t)=Ir+tA+O(t2). Thus the horizontal component Z=(I−X(u)X(u)∗)DXu[v] is the unique representative of v. Then DPu[v]=ZX(u)∗+X(u)Z∗. For horizontal Z,W, direct expansion gives 12Re⁡tr⁡((ZX∗+XZ∗)∗(WX∗+XW∗))=Re⁡tr⁡(Z∗W). Hence the quotient pairing has smooth coefficients in every graph chart. In a local product chart of the frame bundle, matrix entries vary smoothly, so the ambient real Frobenius pairing has smooth coefficients on the complex Stiefel space as well.

2.1F3givenstep 1.1algebra∎

The complex frame quotient and its local graph charts are those of [F3]. For unitary Q, cyclicity of trace and QQ∗=I give ⟨UQ,VQ⟩R=Re⁡tr⁡(Q∗U∗VQ)=Re⁡tr⁡(U∗V). Thus the right unitary action is isometric, and the Frobenius pairing of horizontal representatives is independent of the chosen orthonormal frame.

Depends on

Used by

Dependency tree · two levels

21 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