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 and symplectic clutching groups in low degrees
Statement
Assume AC. Clutching and stabilization give natural additive identifications, for ,
At the right sides mean component groups under block sum. Then by real and quaternionic dimension, respectively, and
Here is the compact group of right--linear isometries of . These calculations use no Bott periodicity or KO coefficient table.
Facts & Assumptions
Given: AC, the standard block inclusions of compact matrix groups, and .
The real clutching construction and its hemisphere gauge equivalence are proved in Clutching classifies vector bundles over spheres in the stable range. Quaternionic disk triviality, complements and homotopy invariance are supplied in Finite-CW relative KO triples and homotopy invariance.
A fibration has its homotopy exact sequence (Long exact sequence of homotopy groups of a fibration), and numerable fiber bundles are fibrations under AC (Numerable fiber bundles are hurewicz fibrations).
for , and is simply connected for (Lower-dimensional sphere maps are based nullhomotopic, is simply connected for every ).
Covering paths and homotopies lift uniquely (Existence and uniqueness of path lifts through a covering map, Existence and uniqueness of homotopy lifts through a covering map).
Unit-quaternion conjugation gives the two-sheeted covering with kernel (The quaternion double cover generates the third homotopy group of SO(3)); in particular (The second homotopy group of SO(3) vanishes).
Proof technique: elementary compact-group clutching.
Proof
The last-column maps and are locally trivial bundles. To see local sections near a unit vector , first choose an orthonormal basis with last vector . For near , project the other basis vectors onto and Gram–Schmidt them; their Gram determinants stay nonzero nearby. Append as last column. In the real case keep the orientation positive by the sign chosen at ; it remains positive by continuity. In the quaternionic case use the right-Hermitian inner product and divide by positive real lengths; the resulting frame change is right-linear. Translate these local sections to all points. Their stabilizers are exactly the indicated smaller groups. A finite partition on each compact sphere makes the bundles numerable, so [F2] applies. Starting with , the circle of plane rotations, and , the component part of the exact sequence and connectedness of the spheres inductively prove connectedness of all for and all for . The groups and are points.
Cover by two disks. Disk bundles are trivial by [F1]; hence a rank- real bundle has transition map , deformable by polar normalization into . The same proof over gives transition maps into : positive square roots exist by the convergent real matrix power-series construction, and all matrices commute with right scalar multiplication. An isomorphism between clutched bundles consists of two disk-defined gauge matrices, exactly as in [F1]; a homotopy of transitions gives an isomorphism by homotopy invariance. Thus the clutching and gauge classification holds over as well.
The covering in [F4] has simply connected total space by [F3]. By [F5], lifting a loop in from gives endpoint or . This is unchanged by based homotopy, is multiplicative under loop concatenation because the cover is a group homomorphism, and has kernel the loops whose lifts close. Such a closed lift contracts in by [F3], so the kernel is zero. A path from to in projects to a loop, showing surjectivity. Hence . The second group is zero by [F4].
For , choose a point on the connected equator and multiply a transition map by the inverse of its value there. This normalizes it to a based map into the identity component. Disk gauges restrict to maps homotopic to constants; after this normalization their only residual action is conjugation by a constant group element. This action is trivial for once its path connectedness is proved in step 1.1. For the real case conjugation by a determinant-positive constant is trivial in homotopy by path connectedness of ; conjugation by a reflection becomes trivial after adding one coordinate, because is path connected to identity and conjugates in exactly the same way as conjugates . Therefore the real orientation-orbit ambiguity disappears on stabilization. For , a transition on is a pair of matrices; change gauges to make the first identity. The component of the second is the complete invariant, since each hemisphere is an interval. This yields the component-group formulation.
The determinant map is onto for , with fibers and a reflection translate of it. Step 1.1 therefore proves . Stabilization preserves determinant, and block sum multiplies determinants. Thus the first colimit is . The symplectic component colimit is zero by the same connectedness result.
For , the exact sequence of and give an isomorphism on . Therefore the stable first group is the of step 1.3. For , the segment shows , since its source is zero; no false assertion that is used. For both and vanish by [F3], so stabilization on is an isomorphism and its stable value is zero. Based positive homotopy groups of equal those of its identity component.
Direct sum of bundles corresponds to block sum of transitions. Stable block sum agrees with homotopy-group addition: in any topological group pointwise multiplication agrees with concatenation on based homotopy classes, by cutting a square into horizontal and vertical paths; after moving one block into the other by a path of real block rotations, the two commuting block matrices multiply to the block sum. For the same block movement proves the component assertion. Every stable class has an additive inverse because contracts by from to , with the two-block rotation. Group completion therefore introduces no new stable classes. Conversely, equality of reduced differences is stable isomorphism after a common trivial summand by [F1], and the clutching criterion in step 1.2 and step 2.1 identifies exactly the same stable transitions. This proves both stated colimit identifications; it does not silently identify finite-rank unoriented bundles with a based homotopy group.
For , [F3] gives , and step 1.1 gives . For the sphere in has dimension at least seven. Its homotopy groups in degrees one, two and three vanish by [F3]. The exact sequence in [F2] therefore makes stabilization an isomorphism on and ; the component groups remain zero. Finally bundles over a point are classified by their nonnegative integer real or quaternionic dimension, whose group completion is . The definition , its quaternionic analogue, and the colimit identifications of step 3.1 now yield every displayed coefficient. No periodicity assertion enters any step.
Depends on
- Real and quaternionic bundle K-groups
- Reduced and relative real K-theory and compact support
- Finite-CW relative KO triples and homotopy invariance
- Clutching classifies vector bundles over spheres in the stable range
- Long exact sequence of homotopy groups of a fibration
- Numerable fiber bundles are hurewicz fibrations
- Lower-dimensional sphere maps are based nullhomotopic
- $S^n$ is simply connected for every $n\ge2$
- The quaternion double cover generates the third homotopy group of SO(3)
- The second homotopy group of SO(3) vanishes
- Existence and uniqueness of path lifts through a covering map
- Existence and uniqueness of homotopy lifts through a covering map
- The Axiom of Choice
Used by
Dependency tree · two levels
117 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
- M. F. Atiyah, K-Theory, §§1.3–1.4 and 2.4 (complex source; real arguments supplied locally) (standard reference, not scraped)