Alphabeta Math
TheoremStatement: 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.

The complex Grassmann polar map is a first-order retraction

Statement

The frame formula of Polar retraction on the complex Grassmannian is smooth on the horizontal tangent bundle, maps into St⁡C(n,r), fixes zero, and has frame differential DRXpol(0)[η]=η for horizontal η. It is right-unitary equivariant, so its range map is representative-independent and has identity differential under the horizontal tangent identification. Thus it is a first-order retraction on Gr⁡C(r,n).

Facts & Assumptions

Given: X∈St⁡C(n,r) and a horizontal tangent η at [X].

[F1]

The polar frame and quotient maps are given by the Gram inverse-square-root formula (Polar retraction on the complex Grassmannian).

[F2]

The positive square root depends smoothly on real symmetric positive-definite matrices, by applying the real bundle theorem to the trivial Euclidean bundle over that open matrix domain (Positive-definite bundle endomorphisms have smooth positive square roots).

[F3]

Horizontal matrices are the representatives of the complex Grassmann tangent (Complex Stiefel and Grassmann tangent projections).

[F4]

The complex Grassmannian has local graph charts and frame fibers related by right unitary changes (Stiefel spaces, Grassmannians, and tautological bundles).

[F5]

The realification ρ respects products and inverses, and matrix inversion preserves Ck regularity on the nonvanishing-determinant domain (Complex Stiefel and Grassmann optimization conventions, Matrix inversion preserves Ck regularity where the determinant is nonzero).

Proof

technique · differentiate the polar factor at zero and use unitary equivariance to descend to the quotient
1.1F1F2F5givenalgebra

The Gram matrix C(X,η)=I+η∗η is Hermitian positive definite by [F1]. Its realification ρ(C) is real symmetric because ρ(C)T=ρ(C∗)=ρ(C), and positive definite because, for z=x+iy, (x,y)Tρ(C)(x,y)=z∗Cz>0. The matrix ρ(C1/2) is real symmetric by the same transpose identity, squares to ρ(C) by [F5], and is positive definite by the same quadratic-form identity. Uniqueness of the positive square root and [F2] therefore make C1/2 smooth in real coordinates. It stays invertible, so [F5] applied to its realification makes its inverse smooth for every finite k, and that inverse is the realification of C−1/2. The frame formula and its range are smooth.

1.2F1F2F3F5givenalgebra

Fix horizontal η and set Y(t)=(X+tη)(I+t2η∗η)−1/2. The Gram factor has value I at zero and derivative zero there because its argument is I+t2η∗η and the inverse-root map is smooth by [F2] and [F5]. The product rule gives Y(0)=X and Y′(0)=η. By [F3], this is precisely identity on the quotient tangent.

2.1F1F3F4givenstep 1.2algebra∎

By [F4], the unitary-equivariant frame formula descends through the smooth Grassmann quotient. The definition's computation shows that replacing (X,η) by (XQ,ηQ) changes Y to YQ, leaving its range unchanged. Its identity differential from step 1.2 is therefore representative-independent.

Depends on

Used by

Dependency tree · two levels

20 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