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

Principal series endomorphisms as the chi-idempotent corner

Statement

Let n≥1, let q be a prime power, put G=GL⁡n(Fq) with Borel B=T⋉U, let χ∈T^ with inflation χ~ to B, and let eχ:=1∣B∣∑b∈Bχ~(b)−1b  ∈  C[B]⊆C[G], the idempotent of the one-dimensional representation χ~ of B, so that beχ=eχb=χ~(b)eχ for b∈B. Then:

  1. the map C[G]eχ→I(χ), geχ↦fg, where fg(gb)=χ~(b)−1 and fg=0 outside gB, is an isomorphism of left C[G]-modules;
  2. right multiplication defines an algebra isomorphism eχC[G]eχ  → ∼   End⁡C[G](C[G]eχ)op  ≅  End⁡G(I(χ))op;
  3. writing w˙ for the permutation matrix of w∈Sn, the elements eχw˙eχ, w∈Sn, span eχC[G]eχ; one has eχw˙eχ=0 whenever w∉Wχ, and the elements eχw˙eχ with w∈Wχ form a C-basis of eχC[G]eχ. Hence dim⁡CEnd⁡G(I(χ))=∣Wχ∣, with basis indexed by the Weyl stabiliser, in accordance with The Weyl stabiliser controls the principal series endomorphisms.

No choice principle is used beyond the finite selection of coset representatives used to exhibit a basis.

Facts & Assumptions

Given: G=GL⁡n(Fq) with Borel B=T⋉U, a character χ∈T^ with inflation χ~, the idempotent eχ, the corner eχC[G]eχ and the module I(χ).

[F1]

The group algebra C[G] has basis the group elements and unit 1; for b∈B one has beχ=eχb=χ~(b)eχ, and eχ2=eχ (The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G]).

[F2]

The induced module I(χ)=Ind⁡BG(χ~) is the C-vector space of covariant functions with the left action (h⋅f)(x)=f(h−1x) (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G, The principal series module for finite GL_n). If T={t1,…,tn} meets each left coset gB in exactly one point, then evaluation at T is an isomorphism Ind⁡BG(χ~)→⨁t∈TC, so the functions ft with ft(tb)=χ~(b)−1 and ft=0 outside tB form a C-basis of I(χ) (A left transversal identifies Ind⁡HGW with a direct sum of [G:H] copies of W).

[F3]

Endomorphisms of a module form a ring under pointwise addition and composition (Module endomorphisms form a ring under pointwise addition and composition).

[F4]

The double cosets Bw˙B, w∈Sn, partition G (Bruhat decomposition of GL_n over a finite field), and the Weyl stabiliser Wχ={w:w⋅χ=χ} satisfies dim⁡CEnd⁡G(I(χ))=∣Wχ∣ (Diagonal torus characters and the Weyl action, The Weyl stabiliser controls the principal series endomorphisms).

Proof

technique · direct
1.1F1algebra

For b∈B, reindexing c=bb′ in the sum defining beχ gives coefficient χ~(b−1c)−1=χ~(b)χ~(c)−1; reindexing c=b′b gives the same coefficient for eχb. Thus beχ=eχb=χ~(b)eχ, and eχ2=∣B∣−1∑bχ~(b)−1χ~(b)eχ=eχ.

2.1F2step 1.1construct

The assignment Φ(geχ):=fg with fg(gb)=χ~(b)−1 and fg=0 off gB is well defined on C[G]eχ: by step 1.1, gbeχ=χ~(b)geχ for b∈B, while fgb=χ~(b)fg: at gbb′ the left side equals χ~(b′)−1, and the right side equals χ~(b)χ~(bb′)−1, so both sides scale in the same way along right B-orbits. It is C[G]-linear because fhg=h⋅fg for g,h∈G by the left action formula of [F2], and it is bijective: for a finite set T of left coset representatives the elements teχ, t∈T, form a C-basis of C[G]eχ (every element is a combination of the geχ, and geχ is a nonzero scalar multiple of the chosen representative vector for gB by step 1.1, and the representative vectors have disjoint coset supports), while the ft, t∈T, form a C-basis of I(χ) by [F2]; as Φ(teχ)=ft, it maps one basis to the other. This proves (1).

2.2F4step 1.1algebra

The double cosets Bw˙B partition G by [F4], so eχC[G]eχ is spanned by the elements eχgeχ with g∈G; for b,b′∈B one has eχ(bxb′)eχ=χ~(b)χ~(b′)eχxeχ by step 1.1, so each cell contributes the single vector eχw˙eχ up to a nonzero scalar, and the eχw˙eχ, w∈Sn, span the corner. If w∉Wχ then there is t∈T with χ(t)≠χ(w˙−1tw˙); from w˙−1tw˙∈B and step 1.1 one has eχtw˙eχ=χ~(t)eχw˙eχ and also eχtw˙eχ=eχw˙(w˙−1tw˙)eχ=χ~(w˙−1tw˙)eχw˙eχ, so the differing scalars force eχw˙eχ=0.

3.1F3step 1.1step 2.1algebra

Let f:C[G]eχ→C[G]eχ be C[G]-linear and put a:=f(eχ). Then f(geχ)=ga, and eχa=a=f(eχ)=f(eχ2)=eχa, while a=f(eχ)∈C[G]eχ gives aeχ=a; hence a∈eχC[G]eχ. Conversely for a∈eχC[G]eχ the right multiplication ρa(yeχ):=yeχa maps C[G]eχ to itself and commutes with left multiplication by C[G], and ρaρb=ρba. So f↦f(eχ) is a C-linear bijection from End⁡C[G](C[G]eχ) onto eχC[G]eχ whose inverse reverses composition, i.e. an algebra isomorphism onto the opposite corner; transporting along the isomorphism of step 2.1 identifies End⁡C[G](C[G]eχ) with End⁡G(I(χ)). This proves (2) up to the transport.

4.1F4step 2.2step 3.1algebra

By step 3.1 the corner has dimension dim⁡End⁡GI(χ)=∣Wχ∣ from [F4]. Step 2.2 spans it by the ∣Wχ∣ vectors eχw˙eχ with w∈Wχ. A spanning family of exactly the dimension of a finite-dimensional space is a basis, so all these vectors are nonzero and linearly independent. This proves (3) without assuming that permutation matrices normalize the Borel subgroup.

5.1F4step 2.1step 3.1step 2.2step 4.1∎

Clause (1) is step 2.1, clause (2) is step 3.1, and clause (3) is steps 2.2 and 4.1; the identification of dimension with ∣Wχ∣ agrees with the independent computation of [F4]. The only selection made is a finite set of left coset representatives in step 2.1, which exists by finite choice for the finitely many cosets, and the double-coset representatives are the explicit permutation matrices; no infinite choice is used.

Depends on

Used by

Dependency tree · two levels

38 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