Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Standard intertwining operators for the finite principal series

Definition

Let n≥1, let q be a prime power, put G=GL⁡n(Fq) with upper triangular Borel B, diagonal torus T and unipotent radical U, let W=Sn be the Weyl group with inversion length ℓ and canonical permutation matrix w˙ for w∈W (Permutation Weyl group and inversion length), let χ∈T^ be a character with Weyl stabiliser Wχ={w∈W:w⋅χ=χ} (Diagonal torus characters and the Weyl action), and let eχ=1∣B∣∑b∈Bχ~(b)−1b be the idempotent of χ~ in the corner eχC[G]eχ, whose elements eχw˙eχ, w∈Wχ, form a C-basis, with C[G]eχ≅I(χ) as left C[G]-modules (Principal series endomorphisms as the chi-idempotent corner, The principal series module for finite GL_n).

For w∈Wχ put Θw  :=  qℓ(w) eχw˙ eχ  ∈  eχC[G]eχ, the normalization by qℓ(w) being the one of the Bruhat double-coset basis of the finite Hecke algebra (The Bruhat double-coset basis of the finite Hecke algebra), where ∣Bw˙B∣/∣B∣=qℓ(w) (Cardinality of a finite Bruhat cell). The standard intertwining operator attached to w∈Wχ is the endomorphism Bw  :=  RΘw−1  ∈  End⁡C[G](C[G]eχ)  ≅  End⁡G(I(χ)), where Ra(xeχ):=xeχa is right multiplication by a, the operators being transported to End⁡G(I(χ)) along the isomorphism of Principal series endomorphisms as the chi-idempotent corner. The index w−1 is forced by the reversal of composition in the identification of the endomorphism algebra with the opposite of the corner: RaRb=Rba. In particular Θ1=q0eχ=eχ and B1=id, and since Θw, w∈Wχ, is a C-basis of the corner, the operators Bw, w∈Wχ, form a C-basis of End⁡G(I(χ)).

Representative independence. Let w∈Wχ and g=b1w˙b2 with b1,b2∈B. Because eχb=χ~(b)eχ for b∈B one has eχgeχ=χ~(b1)χ~(b2) eχw˙eχ, so the compensated element χ~(b1)−1χ~(b2)−1eχgeχ equals eχw˙eχ. If g=b1′w˙b2′ is a second decomposition, the two compensated elements agree: comparing the decompositions gives b1−1b1′=w˙ b2b2′−1w˙−1∈B, and χ~(b1−1b1′)=χ~(b2b2′−1), so χ~(b1)χ~(b2)=χ~(b1′)χ~(b2′). For a monomial representative nw=tw˙ with t∈T, the torus factor is χ~(t)=χ(t), and χ(t)−1eχnweχ=eχw˙eχ, the special case b1=t, b2=1 displayed in the normalization. Thus the compensated corner element, and hence Bw, is independent of the choice of double-coset representatives; the uncompensated element eχgeχ generally is not. This is the one-dimensional case of the simultaneous representative and γn convention of Dudas-Michel, Section 11.3.

Remarks on indexing. For χ=1 this is the usual spherical basis with inverse index in the endomorphism model. Raw basis elements for characters that have not been sorted out by the Weyl stabiliser use the ambient length ℓ(w) of the permutation matrix; the Hecke-algebra basis after Weyl sorting is specified later in this page. All constructions use finite sums, the explicit permutation matrices w˙ and the fixed idempotent eχ, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

34 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