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

Tits deformation for the type-A Hecke algebra

Statement

Assume the Axiom of Choice. Let X=D(f)⊆AC1 be a nonempty principal open, let A be a unital associative C[z,1/f]-algebra free of finite rank, and let x,y∈X have semisimple fibers. Then Ax≅Ay as C-algebras. In particular, for every prime power q, Hq(Sn)≅eBC[GL⁡n(Fq)]eB≅C[Sn], preserving the number and dimensions of simple modules. AC is used through the published Chevalley constructibility and strong Nullstellensatz suppliers, not in the formal lifting or determinant argument.

Facts & Assumptions

Given: A nonempty principal open X=D(f)⊆AC1 (A principal open subset of a classical affine variety), a unital associative C[z,1/f]-algebra A free of finite rank N with basis e1,…,eN and structure constants cijk∈C[z,1/f] defined by eiej=∑kcijkek, points x,y∈X with semisimple fibers Ax=A⊗C[z,1/f]Cx and Ay=A⊗C[z,1/f]Cy, where Cx is evaluation at x, and the Axiom of Choice AC (The Axiom of Choice).

[F1]

For a finite-dimensional associative unital C-algebra B the trace form (a,b)=tr⁡(Lab) is symmetric and associative, it is nondegenerate precisely when B is semisimple, and a nonzero semisimple B is a product of matrix algebras over C (The trace form detects semisimplicity over the complex numbers).

[F2]

For R=C[ ⁣[t] ⁣], a unital associative R-algebra free of finite rank with A/tA≅∏iM⁡di(C) is isomorphic to ∏iM⁡di(R); and an R-linear endomorphism of a finite free R-module whose reduction modulo t is an isomorphism is an isomorphism (Triviality of finite free deformations of semisimple algebras over the power series ring).

[F3]

Every morphism of classical varieties over an algebraically closed field sends constructible subsets to constructible subsets; this statement assumes AC (Chevalley: images of constructible sets are constructible).

[F4]

Assume AC. For every ideal J⊆C[x1,…,xm], I(V(J))=J. Indeed V(J)=V(J), and the radical-ideal correspondence gives I(V(J))=J. Thus a polynomial vanishing on V(J) has a positive power in the original equation ideal J (Affine algebraic sets correspond to radical ideals, and irreducible ones to prime ideals).

[F5]

Hv(n) is free over Z[v±1] with basis the standard elements Tw, w∈Sn, so its rank is n!; extension of scalars sends free modules to free modules with the images of a basis as a basis (The standard basis of the generic type-A Hecke algebra, The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M, Tensor products commute with arbitrary direct sums).

[F6]

The specializations v↦1 and v↦q of Hv(n) are C[Sn] and eBC[GL⁡n(Fq)]eB respectively, and both are semisimple over C (Group algebra and finite-field specializations of the generic Hecke algebra, The finite spherical Hecke algebra is semisimple with nondegenerate trace form).

[F7]

The only place AC is invoked is [F3] and [F4]; the trace-form characterization and the formal triviality statement are choice-free (The trace form detects semisimplicity over the complex numbers, Triviality of finite free deformations of semisimple algebras over the power series ring).

Proof

technique · direct
1.1F1givenalgebra

If N=0 then A=0 and all fibers are the zero algebra, whose trace form is nondegenerate on the zero space, so Ax≅Ay trivially by [F1]. Assume N≥1. The structure constants cijk are regular on D(f); clearing denominators in the identity expressing the associativity of A is unnecessary, but for any z∈D(f) the fiber Az is the C-algebra with basis ei(z) and structure constants cijk(z).

1.2F1givenalgebra

Let G(z) be the N×N matrix with entries tr⁡(Leiej), computed over the ring C[z,1/f]; its determinant Δ∈C[z,1/f] is a rational function regular on D(f), so Δ=d/fm for some d∈C[z] and m≥0. For z∈D(f) the fiber of G at z is the trace-form matrix of Az in the basis ei(z), because base change preserves the structure constants and hence the matrices of the operators Leiej. By [F1], Az is semisimple exactly when det⁡G(z)≠0, that is exactly when d(z)≠0; thus the semisimple locus is Y=D(fd). Since x,y have semisimple fibers, x,y∈Y and Y≠∅; also d≠0 in this case, and Y=A1∖V(fd) is infinite because a nonzero polynomial has finitely many roots.

1.3F1F2givenalgebra

Put B=C[z,1/(fd)] and AY=B⊗C[z,1/f]A, free of rank N over B. For x∈Y, evaluation z↦x+t defines φx:B→R=C[ ⁣[t] ⁣], because (fd)(x+t) has nonzero constant term and is a unit. The algebra Axform=R⊗B,φxAY is finite free with reduction Ax modulo t. By [F1] and [F2], it is isomorphic to R⊗CAx. Write this isomorphism in the chosen bases as P∈GL⁡N(R) and put h=(det⁡P)−1, u=(fd)(x+t)−1.

2.1F3step 1.3givenalgebra

Let Jx be the ideal in C[z,(pai),h,u] generated by hdet⁡P−1, u(fd)(z)−1, and the cleared multiplication equations (fd)(z)M(∑kcijk(z)pak−∑b,cpbipcjcbca(x))=0 for all a,i,j, with M large enough to clear denominators. Let Zx=V(Jx). Its projection to the z coordinate has image Ex={z∈Y:Az≅Ax}: the equations force P invertible and multiplicative, hence unital because a surjective multiplicative map sends the identity to the identity; conversely each algebra isomorphism satisfies them with the indicated h,u. Chevalley [F3] makes Ex constructible. The formal matrix of step 1.3 satisfies these same polynomial equations at z=x+t.

2.2F2F4step 1.3algebra

We show that Ex is infinite. It contains x, through P=1, h=1, u=(fd)(x)−1. Suppose Ex were finite and put g(z):=∏a∈Ex(z−a), a nonzero polynomial with the simple root x; then g vanishes on π(Zx). By the strong Nullstellensatz [F4], vanishing on Zx=V(Jx) gives g∈Jx, so some power gN lies in the defining equation ideal Jx. On the other hand step 1.3 supplies the point (z=x+t, P(t), h(t), u(t)) of Zx with coordinates in the C-algebra R=C[ ⁣[t] ⁣]: the intertwining equations hold because P is an isomorphism, and the two normalizing equations hold by construction. Evaluating the identity gN=∑Ai generatori at this point gives g(x+t)N=0 in the power-series ring. But g(z)=(z−x)q(z) with q(x)≠0, so g(x+t)=t q(x+t) with q(x+t) a unit of R, and tNq(x+t)N≠0: a contradiction. Hence Ex is infinite.

3.1step 2.2algebra

A constructible subset of the line is a finite union of locally closed subsets; a locally closed subset is U∩V(J) with U open and V(J) closed in A1, and an infinite one among them has V(J) infinite, hence V(J)=A1 and the piece contains the nonempty open U. Therefore an infinite constructible subset of Y is cofinite in Y: its complement lies in the complement of a nonempty open subset of A1, a finite set. By steps 2.2 and this observation Ex is cofinite in Y, and applying the same argument with y in place of x makes Ey cofinite in Y as well. Since Y is infinite, Ex∩Ey≠∅; for z∈Ex∩Ey one has Ax≅Az≅Ay, proving the general assertion.

4.1F5F6step 3.1algebra

Apply the general assertion to A=C[z,1/z]⊗Z[v±1]Hv(n) with f=z, x=1 and y=q: by [F5] this is free of finite rank n! over C[z,1/z], and its fibers at 1 and q are H1(Sn)≅C[Sn] and Hq(Sn)≅eBC[GL⁡n(Fq)]eB, both semisimple by [F6]. Hence Hq(Sn)≅C[Sn] as C-algebras. An algebra isomorphism carries the set of simple modules to the set of simple modules and preserves dimensions, so the number and dimensions of the simple modules agree; in particular, by Specht modules classify the complex irreducibles of Sn, the simple modules of the finite Hecke algebra are parametrized by partitions of n, after choosing an isomorphism.

5.1F7step 1.1step 1.2step 1.3step 2.1step 2.2step 3.1step 4.1∎

Steps 1.1 and 1.2 reduce to the semisimple locus and identify it as a principal open, steps 1.3 and 2.1 set up the formal solution and the constructible incidence image, steps 2.2 and 3.1 prove the image cofinite and obtain Ax≅Ay, and step 4.1 applies this to the Hecke family. AC enters only through [F3] and [F4], as recorded in [F7]; the formal-lifting and trace-form arguments are choice-free.

Depends on

Used by

Dependency tree · two levels

83 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