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 , , the upper triangular Borel and , the finite Hecke algebra has -basis , where is the nontrivial element of and , and the multiplication is Hence (the two projections onto the simple -modules), and the abstract presentation is ; for this is . The normalization is the one fixed in The Bruhat double-coset basis of the finite Hecke algebra; in particular and the opposite-algebra ambiguity is invisible because . No choice principle is used.
Facts & Assumptions
Given: A prime power , the group with upper triangular Borel , the idempotent , the finite Hecke algebra , the nontrivial element of and its permutation matrix .
The standard basis elements , , form a -basis of , with the unit and (The Bruhat double-coset basis of the finite Hecke algebra).
The rank-one quadratic relation is (The rank-one quadratic relation in the finite Hecke algebra).
The finite Hecke algebra is the specialization at of the generic type-A Hecke algebra, presented by one generator with when , the braid and commutation families being vacuous (The type-A Iwahori-Hecke presentation of the finite Hecke algebra).
is a finite-dimensional semisimple -algebra and right multiplication identifies with , while as -modules (The finite Hecke algebra as a convolution corner and its endomorphism interpretation, The spherical principal series is the flag permutation module).
For comaximal ideals of a commutative ring one has ; in the polynomial ring the principal ideals and are comaximal when , and (Chinese remainder theorem for pairwise comaximal ideals).
Proof
By [F1] applied to the algebra has the -basis and , so .
The algebra is generated by , because the unital algebra generated by contains the unit and every element is a combination of the two basis elements; it is commutative because lies in the span of and by [F2]. Hence evaluation , , is a surjective unital algebra homomorphism whose kernel contains ; the induced map is a surjection from a -dimensional algebra onto a -dimensional algebra, hence an isomorphism. In particular the displayed multiplication rule of [F2] is the complete multiplication table of in this basis, matching the presentation of [F3].
Factoring and noting that because , the ideals and of are comaximal, so [F5] gives an isomorphism , hence by step 2.1. Under this isomorphism the two factors are the two simple -modules and the two orthogonal idempotents of are the corresponding projections; for the factorization reads .
By [F4] right multiplication identifies with and , so by step 1.1; since is commutative by step 2.1, the opposite algebra is itself and the opposite-algebra ambiguity is invisible.
Step 1.1 gives the basis , and the dimension, step 2.1 gives the quadratic multiplication and the presentation , step 3.1 gives the splitting , and step 3.2 gives the endomorphism-algebra dimension and the opposite-algebra statement. All algebras are finite-dimensional over , all sums are finite, and no choice principle is used.
Depends on
- The finite Hecke algebra as a convolution corner and its endomorphism interpretation
- The Bruhat double-coset basis of the finite Hecke algebra
- The rank-one quadratic relation in the finite Hecke algebra
- The type-A Iwahori-Hecke presentation of the finite Hecke algebra
- Chinese remainder theorem for pairwise comaximal ideals
- The spherical principal series is the flag permutation module
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
- Ivan Losev, Lecture 8: Representations of GL_n(F_q) - Corollary 2.4 and Theorem 2.5 in the case $n=2$, PDF pp. 4-5 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - The relations for $\bar T_s$ in the rank-one case, printed p. 44 (standard reference, not scraped)
- Olivier Dudas and Jean Michel, Lectures on Finite Reductive Groups and Their Representations - Equations (11.1)-(11.2) in the case $W=S_2$, printed p. 46 (standard reference, not scraped)