Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

The general linear group scheme and its coordinate ring

Statement

Assume the Axiom of Choice for the finite-type assertion. Let k be a field, let n≥1, and put d=det⁡(xij)∈k[xij:1≤i,j≤n]. Then GL⁡n=Spec⁡k[xij,d−1] is a group scheme of finite type over k (Group schemes of finite type over a field) whose structure comorphisms are Δ(xij)=∑l=1nxil⊗xlj,ε(xij)=δij,S(xij)=the (i,j)-entry of d−1adj⁡(X), and for every commutative unital k-algebra R the group GL⁡n(R) is the group of invertible n×n matrices over R. If V is a k-vector space with basis e1,…,en, then the functor R↦Aut⁡R(V⊗kR) is naturally identified with GL⁡n. In particular GL⁡1=Gm=Spec⁡k[t,t−1] is the multiplicative group scheme, with Δ(t)=t⊗t, ε(t)=1 and S(t)=t−1. For V=0 put GL⁡0=Spec⁡k, with the trivial group structure and GL⁡0(R)=Aut⁡R(0)={1}; its coordinate ring is k and its matrix has no entries. The coordinate constructions and point identifications are choice-free; AC is used for affine quasi-compactness in the finite-type assertion.

Facts & Assumptions

[F2]

Ring homomorphisms correspond contravariantly to morphisms of affine spectra, and Spec⁡(B⊗kC)≅Spec⁡B×kSpec⁡C. (Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products)

[F3]

If a unital homomorphism B→C of commutative rings sends every element of a multiplicative set S⊆B to a unit, then it factors uniquely through the localisation B→S−1B. (Universal property of localisation: maps that invert S factor uniquely through S−1R, Principal localisation Rf={1,f,f2,…}−1R)

[F4]

Under the assumed Axiom of Choice (The Axiom of Choice), for a finitely generated k-algebra R the structure morphism Spec⁡R→Spec⁡k is locally of finite type by its single affine chart, and it is quasi-compact because affine schemes are quasi-compact; hence it is of finite type. (Locally finite type and finite type morphisms, Subalgebra generated by a subset, algebras of finite type, and module-finite algebras, Every affine scheme is quasi-compact)

[F5]

For a k-vector space V with basis e1,…,en, an R-linear automorphism of V⊗kR is determined by, and equivalent to, its invertible matrix in that basis. (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Invertible linear maps, linear isomorphisms, and inverse linear maps, Vector space over a field)

Proof

Given: A field k, an integer n≥1, the polynomial algebra B=k[xij] with d=det⁡(xij), and the principal localisation A=Bd=k[xij,d−1] with localisation map λ ⁣:B→A.

1.1F1F3givenalgebra

Define a k-algebra homomorphism Δˉ ⁣:B→A⊗kA by Δˉ(xij)=∑lxil⊗xlj (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums). With X(1)=(xij⊗1) and X(2)=(1⊗xij) one has Δˉ(X)=X(1)X(2), so [F1] gives Δˉ(d)=det⁡(X(1))det⁡(X(2))=(d⊗1)(1⊗d)=d⊗d, a unit of A⊗kA; the identities det⁡(X(1))=d⊗1 and det⁡(X(2))=1⊗d are the Leibniz formula (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix) applied termwise to the ring homomorphisms B→A⊗kA, xij↦xij⊗1 and xij↦1⊗xij (Ring homomorphism: additive, multiplicative, and required to send 1 to 1). By [F3] there is a unique k-algebra homomorphism Δ ⁣:A→A⊗kA with Δλ=Δˉ.

1.2F1F3algebra

Define εˉ ⁣:B→k by εˉ(xij)=δij; then εˉ(d)=det⁡(In)=1 is a unit, so by [F3] there is a unique k-algebra homomorphism ε ⁣:A→k with ελ=εˉ.

1.3F1F3algebra

Let M=(mij) be the matrix over A with entries mij=d−1(adj⁡X)ij, and define the k-algebra homomorphism Sˉ ⁣:B→A by Sˉ(xij)=mij. Since Xadj⁡(X)=adj⁡(X)X=dIn over A by [F1], multiplying by d−1 gives XM=In=MX; multiplicativity of the determinant gives Sˉ(d)⋅d=det⁡(M)det⁡(X)=det⁡(MX)=det⁡(In)=1, so Sˉ(d)=d−1 is a unit and [F3] yields a unique k-algebra homomorphism S ⁣:A→A with Sλ=Sˉ.

2.1F1F3step 1.1algebra

Coassociativity holds on the generators: (Δ⊗id⁡)Δ(xij)=∑l,kxik⊗xkl⊗xlj=(id⁡⊗Δ)Δ(xij) by associativity of matrix multiplication in [F1]. Both sides are k-algebra homomorphisms A→A⊗kA⊗kA agreeing on all xij, hence on d and on d−1, so they agree on A by [F3].

3.1F1step 1.1step 1.2algebra

The counit identities hold on the generators: (ε⊗id⁡)Δ(xij)=∑lδilxlj=xij=∑lxilδlj=(id⁡⊗ε)Δ(xij), with the canonical identification k⊗kA≅A≅A⊗kk; agreement on generators and on d−1 as in step 2.1 extends this to A.

3.2F1step 1.1step 1.2step 1.3algebra

The antipode identities hold on the generators: mA(S⊗id⁡)Δ(xij)=∑lS(xil)xlj=(MX)ij=δij=ε(xij) and mA(id⁡⊗S)Δ(xij)=(XM)ij=δij, so mA(S⊗id⁡)Δ=uAε=mA(id⁡⊗S)Δ on generators, both sides being k-algebra homomorphisms A→A; agreement on the generators extends the identity to A as in step 2.1.

4.1F2F4step 2.1step 3.1step 3.2algebra

By [F2] the ring maps Δ,ε,S are comorphisms of morphisms m ⁣:GL⁡n×kGL⁡n→GL⁡n, e ⁣:Spec⁡k→GL⁡n and i ⁣:GL⁡n→GL⁡n, where GL⁡n=Spec⁡A: the identifications Spec⁡(A⊗kA)≅GL⁡n×kGL⁡n and Spec⁡(A⊗kA⊗kA)≅GL⁡n×kGL⁡n×kGL⁡n hold. The comorphisms of m∘(m×id⁡) and m∘(id⁡×m) are (Δ⊗id⁡)Δ and (id⁡⊗Δ)Δ, equal by step 2.1, so the two composites agree since Spec⁡ is a contravariant equivalence; the identities m∘(e×id⁡)=id⁡=m∘(id⁡×e) and m∘(i,id⁡)=e∘p=m∘(id⁡,i) follow in the same way from steps 3.1 and 3.2. Thus GL⁡n is a k-group scheme, and it is of finite type because A is the finitely generated k-algebra k[xij,d−1] and [F4] applies.

5.1F1F3step 1.1step 1.3step 4.1algebra

For every commutative unital k-algebra R there is a natural bijection between k-algebra homomorphisms A→R and n×n matrices N over R with unit determinant: a map restricts to B→R giving N=(Nij) with det⁡(N)=φ(d) a unit, and conversely a matrix with unit determinant gives B→R, xij↦Nij, which sends d to a unit and factors uniquely through A by [F3]; by [F1] the unit-determinant matrices are exactly the invertible ones. Under this bijection the group law induced by m is matrix multiplication, (φψ)(xij)=∑lφ(xil)ψ(xlj), the identity is In, and i induces matrix inversion, so GL⁡n(R) is the group of invertible matrices over R.

6.1F5step 5.1algebra

If V is a k-vector space with basis e1,…,en, then [F5] identifies Aut⁡R(V⊗kR) with the invertible n×n matrices over R naturally in R, and step 5.1 identifies the latter with GL⁡n(R); hence the functor R↦Aut⁡R(V⊗kR) is naturally identified with GL⁡n.

7.1F3F4step 1.1step 5.1given∎

For n=1 the constructions specialize: d=x11, adj⁡(X)=1, so with t=x11 one has A=k[t,t−1], Δ(t)=t⊗t, ε(t)=1 and S(t)=t−1, and step 5.1 identifies the points with R×; this is Gm. For V=0, the singleton functor R↦Aut⁡R(0) is represented by Spec⁡k, whose identity, multiplication and inverse are the unique possible maps; it is of finite type since its one-point space is quasi-compact. This supplies GL⁡0 without a determinant formula. The coordinate and point constructions are choice-free; [F4] uses AC for the finite-type assertion when n≥1.

Depends on

Used by

Dependency tree · two levels

85 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