Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Determinant classifies loops in complex general linear groups

Statement

For every n1, determinant induces an isomorphism

det:π1(GLn(C),I)π1(C×,1)Z.

A based loop whose determinant has winding number k is homotopic through invertible matrices to zdiag(zk,1,,1). This result is choice-free.

Facts & Assumptions

Given: an integer n1 and based loops at the identity.

[F1]

Invertible complex matrices form GLn(C) (Invertible matrices and the general linear group GLn(F)). Equip Mn(C)Cn2 with its Euclidean topology and GLn(C) with the subspace topology. The determinant is a polynomial in the matrix entries and hence is continuous.

[F2]

A fibration has the pointed long exact sequence of homotopy groups (Long exact sequence of homotopy groups of a fibration).

[F3]

Spheres Sm are simply connected for m2 (Sn is simply connected for every n2).

[F4]

Winding number identifies π1(C×,1) with Z (Winding number identifies the fundamental group of C times with the integers).

Proof

technique · direct
1.1

Continuous Gram–Schmidt on the ordered columns writes every AGLn(C) uniquely as A=QR, where QU(n) and R is upper triangular with positive real diagonal. No denominator vanishes because each initial set of columns is independent. The path Q((1t)R+tI) remains invertible and fixes U(n) pointwise, so it is a deformation retraction of GLn(C) onto U(n).

F1constructalgebra
1.2

The last-column map SU(n)S2n1 is locally trivial: near a chosen unit vector, continuous Gram–Schmidt completes that vector together with a fixed nearby frame, and multiplying the first completed vector by the inverse determinant puts the completion in SU(n). Its fiber over the last basis vector is SU(n1). Thus SU(n1)SU(n)S2n1 is a fibration.

constructalgebra
2.1

Since SU(1) is a point, induct simultaneously that SU(n) is path-connected and simply connected. For n2, the sphere S2n1 is path-connected and has trivial fundamental group by [F3]. The pointed low-degree part of [F2], applied to step 1.2, first carries path-connectedness of the fiber and base to SU(n) and then carries the inductive equality π1(SU(n1))=0 and π1(S2n1)=0 to π1(SU(n))=0.

F2F3step 1.2induction
3.1

Determinant U(n)U(1) is a fibration with fiber SU(n) and section s(z)=diag(z,1,,1). By [F2] and step 2.1, det is injective on π1, while the section makes it surjective. Step 1.1 transfers this isomorphism to GLn(C) and C×.

F2step 1.1step 2.1
4.1

If a loop g has determinant winding k, [F4] says detg is homotopic to zzk. Step 3.1 says that g and s(zk) represent the same based homotopy class, which is precisely the displayed diagonal loop. Every construction was finite and explicit, so no choice principle was used.

F4step 3.1

Depends on

Used by

Dependency tree · two levels

18 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