Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Real Stiefel spaces with complement rank at least two are simply connected

Statement

Assume ACω. For integers 1≤k≤N−2, the space Vk(RN)={F∈RN×k:FTF=Ik}, with its Euclidean subspace topology, is nonempty, path connected, and simply connected. In particular, VN−r(RN) is simply connected whenever N>r≥2. Countable choice is used only through relative smooth approximation.

Facts & Assumptions

[A1]

Countable choice is assumed. The Axiom of Countable Choice (ACω)

[F1]

For d≥2, the sphere Sd is nonempty, path connected, and simply connected. A space is simply connected if it is nonempty and path connected and has trivial fundamental group at every basepoint. Sn is simply connected for every n≥2, Simply connected topological spaces

[F2]

A smooth map with surjective derivative along a level set gives that level set its embedded manifold structure. The constant-rank theorem for manifolds

[F3]

Under [A1], a continuous manifold-valued map smooth on a neighbourhood of a closed subset can be smoothly approximated through a homotopy fixed on a smaller neighbourhood of that subset. Relative Whitney approximation for manifold-valued maps

[F4]

A linear matrix ODE with continuous coefficients has a unique solution on any given compact interval. For smooth coefficients depending smoothly on parameters, solutions depend smoothly on those parameters locally in time; uniqueness and finitely many overlapping time intervals give this dependence along an entire compact solution interval. Linear matrix ODEs have unique global solutions on a fixed interval, Smooth dependence of ODE solutions on parameters

Proof

Given: Countable choice and integers N≥k+2, k≥1. Frames are ordered, with no orientation imposed. All matrix sets have ordinary subspace topology.

1.1A1F2F3constructalgebra

The constraint map Φ(F)=FTF−Ik takes values in symmetric k-by-k matrices. Its derivative at an orthonormal frame is A↦FTA+ATF, which is onto: for symmetric B, choose A=FB/2. Thus [F2] makes Vk(RN) an embedded smooth manifold. Every based continuous loop can be represented by a smooth based loop: first reparametrize it to be constant on an arc about the basepoint, using a degree-one circle reparametrization based-homotopic to the identity, then use [F3] relative to a closed smaller arc. A continuous disk filling a smooth boundary loop can likewise be made smooth while keeping its boundary values: first compress the original filling radially into a smaller disk and use the boundary loop, constant in the radial variable, on the remaining annulus. Extend this map outside the unit circle by the same radial-constant formula and apply [F3] on R2 relative to a closed exterior annulus contained in its smooth region. Restrict to the disk. The formula is smooth near the unit circle, so no manifold-with-boundary version of approximation is needed. These operations use [A1] only through [F3].

1.2F4constructalgebra

We record the needed explicit complement construction. Let P(z) be any smooth family of orthogonal projections of fixed rank on a disk, and set Pz(t)=P(tz) for 0≤t≤1. Define Az(t)=P˙z(t)Pz(t)−Pz(t)P˙z(t), and solve Uz′=AzUz, Uz(0)=IN using [F4]. The coefficient is skew symmetric, so differentiating UzTUz makes it constant, equal to IN. Differentiating Pz2=Pz gives PzP˙zPz=0 and P˙zPz+PzP˙z=P˙z, hence [Az,Pz]=P˙z. Therefore Qz=UzP(0)UzT and Pz solve the same linear matrix equation Qz′=[Az,Qz] with the same initial value. Uniqueness, applying [F4] in the coordinate array of matrices, gives Qz=Pz. Consequently transporting an orthonormal basis of im⁡P(0) by Uz(1) gives an orthonormal basis of im⁡P(z). These transported vectors depend smoothly on z by [F4], including at z=0 since P(tz) is jointly smooth there. Smoothness up to the disk boundary follows by extending the smooth projection a little beyond that boundary. This construction uses unique solutions, not a choice of a solution for each parameter.

1.3givenconstructalgebra

For path connectivity, take two frames and extend each to an orthonormal basis of RN, choosing the last complementary vector so the full matrix has determinant one. Such a finite completion exists by ordinary finite-dimensional orthogonal-complement algebra. Every matrix in SO(N) is joined to IN by plane rotations: rotate its first column to e1 within the plane it spans with e1, using an auxiliary coordinate direction in the antipodal case, then restrict to the orthogonal complement of e1 and repeat. Each rotation has a continuous path from the identity, fixes the previously aligned columns, and has determinant one; at the final one-dimensional stage determinant one forces the last entry to be 1. Concatenating these finitely many rotation paths joins the two full matrices, and their first k columns give a path between the original frames. The standard frame proves nonemptiness.

2.1F1step 1.1step 1.2baseihconstruct

Induct on k, simultaneously for all N≥k+2. For k=1, the constraint space is SN−1, so [F1] proves simple connectivity because N−1≥2. Suppose k≥2 and the result holds for k−1 in every allowed ambient dimension. By step 1.1 it suffices to fill a smooth loop γ=(v1,…,vk) in Vk(RN). Its first column is a smooth sphere loop, which bounds a continuous disk by [F1]. Make this filling smooth, with the same boundary values, by step 1.1, and denote it f1:D2→SN−1. Apply step 1.2 to P(z)=IN−f1(z)f1(z)T. It gives a smooth isometric frame C(z):RN−1→f1(z)⊥ throughout the disk. On the boundary the remaining columns have coordinates wi=CTvi, 2≤i≤k, giving a loop in Vk−1(RN−1). Since (N−1)−(k−1)=N−k≥2, induction supplies a continuous disk filling (w~2,…,w~k) of that loop. Then (f1,Cw~2,…,Cw~k) is a continuous disk of orthonormal k-frames with boundary exactly γ. Thus every loop extends over a disk and is nullhomotopic. For the original continuous based loop, attach its basepoint-fixed smoothing homotopy to this disk filling. Disk extension is the usual loop nullhomotopy criterion; contracting the disk towards its chosen boundary basepoint gives a based nullhomotopy.

3.1F1step 1.3step 2.1discharge-induction∎

Step 2.1 applies at every basepoint and proves that each fundamental group is trivial. Together with step 1.3 this establishes simple connectivity for all N≥k+2. For N>r≥2, take k=N−r≥1; then N−k=r≥2, which is exactly the permitted range. No fibration, numerability theorem, general bundle classification, or arbitrary choice is used.

Depends on

Used by

Dependency tree · two levels

41 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