Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The two-dimensional Hecke algebra for GL_2(F_q)

Example

For n=2, G=GL⁡2(Fq), B the upper triangular Borel and eB=∣B∣−1∑b∈Bb, the finite Hecke algebra H=eBC[G]eB has C-basis {T1=eB,Ts}, where s is the nontrivial element of S2 and Ts=∣B∣−1∑x∈Bs˙Bx, and the multiplication is Ts2=(q−1)Ts+q T1. Hence H≅C⊕C (the two projections onto the simple H-modules), and the abstract presentation is H≅C[T]/(T2−(q−1)T−q); for q=2 this is C[T]/((T−2)(T+1))≅C⊕C. The normalization is the one fixed in The Bruhat double-coset basis of the finite Hecke algebra; in particular dim⁡CEnd⁡G(C[P1(Fq)])=2 and the opposite-algebra ambiguity is invisible because H≅Hop. No choice principle is used.

Facts & Assumptions

Given: A prime power q, the group G=GL⁡2(Fq) with upper triangular Borel B, the idempotent eB, the finite Hecke algebra H=eBC[G]eB, the nontrivial element s of S2 and its permutation matrix s˙.

[F1]

The standard basis elements Tw=qℓ(w)eBw˙eB=∣B∣−1∑x∈Bw˙Bx, w∈S2, form a C-basis of H, with T1=eB the unit and dim⁡CH=2! (The Bruhat double-coset basis of the finite Hecke algebra).

[F2]

The rank-one quadratic relation is Ts2=(q−1)Ts+q T1 (The rank-one quadratic relation in the finite Hecke algebra).

[F3]

The finite Hecke algebra is the specialization at v=q of the generic type-A Hecke algebra, presented by one generator τ with τ2=(q−1)τ+q⋅1 when n=2, the braid and commutation families being vacuous (The type-A Iwahori-Hecke presentation of the finite Hecke algebra).

[F4]

H is a finite-dimensional semisimple C-algebra and right multiplication identifies H with End⁡C[G](C[G]eB)op≅End⁡G(C[G/B])op, while C[G/B]≅C[P1(Fq)] as G-modules (The finite Hecke algebra as a convolution corner and its endomorphism interpretation, The spherical principal series is the flag permutation module).

[F5]

For comaximal ideals I,J of a commutative ring R one has R/(I∩J)≅R/I×R/J; in the polynomial ring C[T] the principal ideals (T−q) and (T+1) are comaximal when q≠−1, and C[T]/(T−λ)≅C (Chinese remainder theorem for pairwise comaximal ideals).

Proof

technique · direct
1.1F1

By [F1] applied to S2={1,s} the algebra H has the C-basis T1=eB and Ts=q eBs˙eB=∣B∣−1∑x∈Bs˙Bx, so dim⁡CH=2.

2.1F2F3step 1.1algebra

The algebra H is generated by Ts, because the unital algebra generated by Ts contains the unit T1 and every element is a combination of the two basis elements; it is commutative because Ts2=(q−1)Ts+q T1 lies in the span of 1 and Ts by [F2]. Hence evaluation C[T]→H, T↦Ts, is a surjective unital algebra homomorphism whose kernel contains T2−(q−1)T−q; the induced map C[T]/(T2−(q−1)T−q)→H is a surjection from a 2-dimensional algebra onto a 2-dimensional algebra, hence an isomorphism. In particular the displayed multiplication rule of [F2] is the complete multiplication table of H in this basis, matching the presentation of [F3].

3.1F5step 2.1algebra

Factoring T2−(q−1)T−q=(T−q)(T+1) and noting that q≠−1 because q≥2, the ideals (T−q) and (T+1) of C[T] are comaximal, so [F5] gives an isomorphism C[T]/((T−q)(T+1))≅C[T]/(T−q)×C[T]/(T+1)≅C⊕C, hence H≅C⊕C by step 2.1. Under this isomorphism the two factors are the two simple H-modules and the two orthogonal idempotents of H are the corresponding projections; for q=2 the factorization reads (T−2)(T+1).

3.2F4step 1.1step 2.1

By [F4] right multiplication identifies H with End⁡G(C[G/B])op and C[G/B]≅C[P1(Fq)], so dim⁡CEnd⁡G(C[P1(Fq)])=dim⁡CH=2 by step 1.1; since H is commutative by step 2.1, the opposite algebra is H itself and the opposite-algebra ambiguity is invisible.

4.1step 1.1step 2.1step 3.1step 3.2∎

Step 1.1 gives the basis T1=eB, Ts and the dimension, step 2.1 gives the quadratic multiplication and the presentation C[T]/(T2−(q−1)T−q), step 3.1 gives the splitting H≅C⊕C, and step 3.2 gives the endomorphism-algebra dimension and the opposite-algebra statement. All algebras are finite-dimensional over C, all sums are finite, and no choice principle is used.

Depends on

Used by

Dependency tree · two levels

31 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