Alphabeta Math
Pipeline-generated
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.

✓ 8 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Finitary Ringel–Hall Algebras

1 · Prerequisites

2 · Summary

Objective

This page constructs the untwisted Hall algebra of a small finitary abelian category over an arbitrary commutative coefficient ring. With the fixed convention that [M]∗[N] counts subobjects isomorphic to N with quotient isomorphic to M, its local proofs establish finite coefficients, finite support, the zero-object unit, and associativity by counting two-step flags. They use finite Hom sets and finite Yoneda Ext⁡1 sets; they do not assume finite-field linearity, enough projectives or injectives, or a finite-subobject condition for every object.

A separate finite-field specialization develops the Jordan-quiver Hall algebra. It proves the partition classification, Hall-polynomial structure constants, and the generator-normalized isomorphism from its generic algebra to the stable symmetric-function ring. The normalized partition basis is identified with the monic Hall–Littlewood functions, and the inverse- automorphism Green pairing is computed in power-sum coordinates by an independent pair-of-flags count. The companion examples page records worked examples and the degree-two normalization checks.

Reading route and logical suppliers

The canonical plan declares three page-level reading prerequisites: algebraic-representation-and-tensor-symmetry-map, cyclotomic-klr-algebras-and-highest-weight-categorification, and symmetric-functions-hall-inner-product-and-schur-bases. The first two give broader algebra and categorification context and are not item-level premises. Results from the symmetric-functions page enter through their individually cited item dependencies. In particular, the published quiver-flag/KLR convolution theorem is a distinct construction and does not establish Hall product associativity.

Normalization and scope

The coefficient gM,NL is an integer count of subobject classes. Its image in the coefficient ring is formed by repeated addition; no automorphism cardinality is divided out. The square-root Euler twist, Green coproduct and quantum-group comparison have additional hypotheses and belong to later pages.

The Hall product ∗ is a multiplication on the Hall module. The Hall inner product on symmetric functions is a separate bilinear form, defined by The Hall inner product on symmetric functions. The generic ring isomorphism uses Φq(u(1r))=q−r(r−1)/2er. The local Jordan Hall classes are Hall–Littlewood functions with the transported Green pairing proves Φq(uλ)=q−n(λ)Pλ(x;q−1). The transported Green form on degree d is q−d times the standard Hall–Littlewood form at parameter q−1; its power-sum norms are zλ∏i(qλi−1)−1. These are distinct from the ordinary Hall inner product. This Jordan pairing computation requires no general Green coproduct theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Small finitary abelian categories for Hall multiplication

Definition

A small finitary abelian category for Hall multiplication is a small abelian category A (its object and morphism collections are sets, by Small, locally small, and large categories), with abelian structure as in Abelian category, in which the following sets are finite for every pair of objects M,N:

  1. Hom⁡A(M,N);
  2. YExt⁡A1(M,N), the set of Yoneda classes of short exact sequences 0→N→E→M→0. Equivalence is the one-fold instance of the generated endpoint-fixed chain-map relation in Equivalence of n-fold extensions: chain maps are the identity on N and M, and the relation is closed under reflexivity, symmetry and transitivity. A short exact sequence and its endpoint order use Exact sequence and short exact sequence in an abelian category, An extension of an object by an object in an abelian category and An n-fold Yoneda extension.

One may instead supply a small skeleton A0 of an essentially small abelian category and perform the construction on A0. Here “essentially small” means that such a small equivalent category is part of the given data; the construction does not select representatives by an unstated choice principle. The isomorphism classes Iso⁡(A0) then form a set.

No Fq-linear structure, enough projectives or injectives, finite number of subobjects of every object, or identification with derived Ext⁡1 is included in this definition. Subobjects are the monomorphism classes of Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, and quotients are the cokernels specified in The quotient of an object by a subobject.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Flags lift uniquely through a quotient in an abelian category

Statement

Let W≤L be a subobject in an abelian category, and let q:L→L/W be the quotient map. Inverse image along q is an order isomorphism from the subobjects of L/W to the interval of subobjects U≤L with W≤U. Its inverse sends U to the image q∗U, canonically isomorphic to U/W. Under this correspondence, (L/W)/(U/W)≅L/U.

Facts & Assumptions

Given: An abelian category, subobjects W≤L, and the quotient map q:L→L/W.

[F1]

A subobject is a mutual-factorisation class of monomorphisms; its quotient is the cokernel of a representing monomorphism (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, The quotient of an object by a subobject).

[F2]

Direct image is the image of the composite with the given map, and inverse image is its pullback (Direct and inverse image of a subobject).

[F3]

Direct and inverse image form the Galois connection f∗B≤C  ⟺  B≤f∗C (Direct and inverse image of subobjects form a Galois connection).

[F4]

Pulling back an epimorphism in an abelian category gives an epimorphism (The pullback of an epimorphism is an epimorphism).

[F5]

For every morphism f, coker⁡(ker⁡f) is canonically isomorphic to im⁡(f) (First isomorphism theorem in an abelian category).

[F6]

For nested subobjects W≤U≤L, (L/W)/(U/W)≅L/U (Third isomorphism theorem in an abelian category).

Proof

technique · direct
1.1F1F2F3F4F5F7

Given a subobject B≤L/W, let U=q∗B be its inverse image. Since q∗W=0≤B, [F3] gives W≤U. The pullback square defining U has a projection p:U→B that is epic by [F4]; its kernel is the kernel W of q. By [F5], its image is canonically U/W. Since p is epic, any cokernel c satisfies cp=0=0p, so c=0 by cancellation. Its universal property makes its codomain initial, because the only morphism out of B annihilating p is zero; hence the cokernel object is zero. By the image definition, im⁡(p)=ker⁡(coker⁡p)=B. Thus U/W≅B and q∗U=B.

1.2F1F2F5F6F7

Conversely let W≤U≤L. The restriction q∣U:U→L/W has kernel W, so [F5] identifies its image q∗U with U/W. By [F6], the quotient map L/W→(L/W)/(U/W), composed with q, is the quotient map L→L/U. Its kernel is U by [F1] and [F7], hence the inverse image of U/W along q is exactly U.

2.1F3F6step 1.1step 1.2∎

Steps 1.1 and 1.2 show that the two assignments are inverse on subobject classes. Both assignments preserve inclusion by the Galois connection [F3], and [F6] gives the stated quotient identification. Thus inverse image along q is the claimed order isomorphism.

Diagram

The quotient correspondence is represented by the following exact rows and the induced inclusion:

0WUU=W00WLL=W0

The vertical middle map is the subobject inclusion, and the right-hand map is the map induced by U↪L. The diagram explains the correspondence; the proof above uses the categorical universal properties and the third isomorphism theorem, not the picture.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Nilpotent representations of the Jordan quiver

Definition

The Jordan quiver has one vertex and one loop, labelled t:

²t

A finite-dimensional representation over a field k is a pair (V,x), where V is a finite-dimensional k-vector space and x:V→V is nilpotent (Nilpotent endomorphisms and their nilpotency index). A morphism (V,x)→(V′,x′) is a linear map f:V→V′ satisfying fx=x′f, encoded by the commutative square

VVV0V0xffx0

For this page, Jk denotes the small model whose objects are (kn,X), for n≥0, with X a nilpotent matrix, and whose morphisms are all matrices intertwining the endomorphisms. Every finite- dimensional vector space is isomorphic to a standard kn, so the model represents all finite-dimensional nilpotent representations. For any field k, write S=(k,0) for the one-dimensional object and Im=(km,Jm(0)) for the length-m Jordan block, using Jordan blocks, Jordan strings, and their endpoints. For a partition λ=(λ1,…,λs) (Partitions, English diagrams, and conjugation), write Iλ for the block-diagonal representation with blocks Jλ1(0),…,Jλs(0). Use S⊕0=I∅=0 for the zero object.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

The untwisted Hall algebra of a finitary abelian category

Definition

Let A be a small finitary abelian category in the sense of Small finitary abelian categories for Hall multiplication, and let R be a commutative ring with unit. Define the free R-module HA,R:=⨁[M]∈Iso⁡(A)R[M], where [M] is a basis symbol for the isomorphism class of M. For objects N,L, let Mon⁡A(N,L):={f∈Hom⁡A(N,L):f is monic}. This is a finite set by the Hom condition in Small finitary abelian categories for Hall multiplication. For f,g in this set, write f∼Ng when g=f∘u for an isomorphism u:N→N; this is an equivalence relation by Isomorphism, groupoid, and connected category. The quotient set Mon⁡A(N,L)/∼N represents exactly the subobjects of L isomorphic to N: each class gives the usual subobject class from Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, and the mutual- factorisation theorem says two such monomorphisms give the same subobject exactly when they differ by such an isomorphism (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it). Every subobject class with domain isomorphic to N is represented by composing its monomorphism with an isomorphism from N, one class at a time. The cokernel quotient is independent of that representative by The quotient by a subobject is independent of the chosen representing monomorphism and The quotient of an object by a subobject. Define gM,NL to be the number of classes [f]∼N for which coker⁡(f)≅M. The finiteness lemma below also proves that the resulting product has finite support. Extend the operation [M]∗[N]:=∑[L]∈Iso⁡(A)gM,NL[L] R-bilinearly, mapping each natural number coefficient to its multiple of 1R. The order is fixed: the counted short exact sequence is 0⟶N⟶L⟶M⟶0.

This is the untwisted Hall product. It does not use an Euler form, a square root of a field size, or division by automorphism cardinalities. The finite coefficient and finite-support claims needed for the operation to define a bilinear product are established in Untwisted Hall structure constants and products are finite ↗.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Jordan-quiver categories are abelian; finite-field models are finitary

Statement

For every field k, the category Jk of Nilpotent representations of the Jordan quiver is abelian, and its subobjects are exactly the x-invariant subspaces of each object (V,x). When k is finite, Jk is small and its Hom sets and Yoneda Ext⁡1 sets are finite. Thus it satisfies the finitary hypotheses of Small finitary abelian categories for Hall multiplication.

Facts & Assumptions

Given: A field k and the category Jk; when k is finite, two fixed objects M,N for the extension-count argument.

[F1]

Objects are finite-dimensional vector spaces with nilpotent endomorphisms; morphisms are the intertwining linear maps f satisfying fx=x′f (Nilpotent representations of the Jordan quiver).

[F2]

Finitary means that the category is small or is supplied with a small skeleton and that Hom and Yoneda Ext⁡1 sets are finite (Small finitary abelian categories for Hall multiplication).

[F3]

An abelian category is additive, has kernels and cokernels, and its canonical coimage-to-image maps are isomorphisms (Abelian category).

[F4]

Here a monomorphism is a morphism cancellable on the left.

[F5]

A subobject is a mutual-factorisation class of monomorphisms into its target (Small finitary abelian categories for Hall multiplication).

Proof

technique · direct
1.1F1F3algebrachoose

Fix a morphism f intertwining two nilpotent endomorphisms. Its kernel and image are invariant, and the induced endomorphism on its cokernel is nilpotent. Intertwining maps are closed under addition, composition is bilinear, and the ordinary finite direct sums with diagonal endomorphisms and the zero object have their vector-space biproduct universal properties. Choose bases for the kernel, image, and cokernel of this one map and transport them to standard kd objects; their universal properties are preserved. The coimage-to-image isomorphism is an intertwiner because f commutes with the endomorphisms. This verifies the abelian-category clauses in [F3].

1.2F1F2algebra

For any field k, the standard-coordinate objects and matrices between them form sets, since they are a union indexed by pairs of natural numbers of sets of matrices over k; hence Jk is small. If k is finite, there are finitely many matrices of each size, and each Hom set is a subset of a finite set of matrices, so Hom sets are finite.

1.3F1F2algebra

Now suppose k is finite and fix objects M=(km,xM) and N=(kn,xN). In a short exact sequence 0→N→E→M→0, the middle space has dimension m+n. After identifying it with km+n, only finitely many nilpotent matrices and endpoint maps are possible. Thus the set of such sequences, and its quotient by Yoneda equivalence, are finite.

1.4F1F4algebra

A monic intertwiner is injective: if f has a nonzero kernel vector w, the source nilpotent operator x preserves ker⁡f. Choose the least j≥1 with xjw=0; then v=xj−1w is nonzero, lies in the kernel, and satisfies xv=0. The map S→dom⁡(f) sending 1 to v is nonzero and intertwines, but its composite with f is zero, contradicting left cancellation [F4]. Conversely, every injective intertwiner is monic by linear injectivity.

2.1F1F5step 1.4constructalgebra

By step 1.4, every monomorphism identifies its domain with an invariant subspace of its target. Conversely, every invariant subspace carries the restricted nilpotent endomorphism; choosing a basis for this single finite-dimensional subspace and transporting the endomorphism to kd represents its inclusion by a monic map in the standard-coordinate model. Two such monic maps have the same image exactly when they mutually factor: maps with the same image are related by the induced intertwining isomorphism of their domains, and mutual factorisation forces both image inclusions. By [F5], this is precisely equality of subobject classes.

3.1F2step 1.1step 1.2step 1.3step 2.1∎

The category is abelian by step 1.1 and small by step 1.2. For finite k, its Hom and Yoneda extension sets are finite by steps 1.2 and 1.3, exactly the finitary conditions in [F2]; step 2.1 proves the stated subobject description for every field.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Jordan-quiver isomorphism classes are indexed by partitions

Statement

Every object of Jk is isomorphic to a unique direct sum Iλ=Iλ1⊕⋯⊕Iλs, where λ is a partition. The unique simple object is S=I1.

Facts & Assumptions

Given: A field k and a finite-dimensional vector space V with a nilpotent endomorphism x, defining an object of Jk.

[F1]

Every finite-dimensional nilpotent endomorphism has a basis that is a concatenation of Jordan strings, including the empty basis on the zero space (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).

[F2]

For a nilpotent endomorphism, the numbers of Jordan blocks of each size are determined by the ranks of its powers (Ranks of shifted powers determine Jordan form up to block order).

[F3]

In a Jordan string of length m, xv1=0 and xvj=vj−1 for j>1; its matrix is Jm(0) (Jordan blocks, Jordan strings, and their endpoints).

[F4]

A partition is a finite weakly decreasing sequence of positive integers; its parts record a multiset uniquely (Partitions, English diagrams, and conjugation).

[F5]

Jk is a category whose objects and morphisms are finite-dimensional nilpotent representations and their intertwiners (Nilpotent representations of the Jordan quiver).

[F6]

Here a simple object means a nonzero object whose only subobjects are the zero subobject and the identity subobject.

[F7]

Subobjects in Jk correspond to invariant subspaces, via their images (Jordan-quiver categories are abelian; finite-field models are finitary).

Proof

technique · direct
1.1F1F3F4F5

Apply [F1] to x. The spans of its Jordan strings are invariant, their concatenation is a basis of V, and by [F3] each span is isomorphic as a representation to the block Im whose length is that string's length. Sorting these finitely many positive lengths weakly decreasing gives a partition λ by [F4] and an isomorphism (V,x)≅Iλ. The zero space gives the empty partition.

2.1F2step 1.1

If Iλ≅Iμ, the intertwining isomorphism conjugates their nilpotent matrices, so the ranks of every power agree. By [F2], the multiplicities of blocks of each length agree; hence the multisets of parts and the partitions are equal.

3.1F3F4F5F6F7step 1.1∎

If a string has length m>1, the span of its initial vector is a nonzero proper invariant subspace, hence a proper nonzero subobject by [F7]; therefore Im is not simple by [F6]. The object I1=S is nonzero and has only the zero and whole subspaces, so it is simple by [F6] and [F7]. Any decomposition in step 1.1 with at least two summands has a proper nonzero invariant summand and hence is not simple. A single summand is simple only when it has length one. Thus S is the unique simple object.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Untwisted Hall structure constants and products are finite

Statement

For a finitary abelian category, each untwisted Hall coefficient gM,NL is finite and depends only on the isomorphism classes of M,N,L. For fixed M,N, only finitely many isomorphism classes [L] have gM,NL≠0. Hence the basis formula in The untwisted Hall algebra of a finitary abelian category is a finite sum in its direct-sum module.

Facts & Assumptions

Given: A finitary abelian category A, objects M,N,L, and the coefficient gM,NL from the untwisted Hall product.

[F1]

For every pair X,Y, the sets Hom⁡(X,Y) and YExt⁡1(X,Y) are finite; the latter consists of Yoneda classes of short exact sequences with the displayed endpoints (Small finitary abelian categories for Hall multiplication).

[F2]

gM,NL counts equivalence classes of monomorphisms N→L under precomposition by isomorphisms of N, retaining those whose cokernel is isomorphic to M (The untwisted Hall algebra of a finitary abelian category).

[F3]

A morphism between short exact sequences that is the identity on both endpoints is an isomorphism on the middle object, by the short five lemma (Short five lemma in an abelian category).

Proof

technique · direct
1.1F2algebra

An isomorphism of middle objects transports subobjects and induces an isomorphism of their cokernel quotients; replacing either endpoint by an isomorphic object preserves the two type conditions. Thus the count in [F2] depends only on [M],[N],[L].

1.2F1F2

For fixed L, the equivalence classes counted by [F2] are a quotient of the finite set Hom⁡(N,L) from [F1]. The subset whose cokernel is isomorphic to M is therefore finite.

1.3F1F2F3choose

Every elementary map in the generating relation for [F1] preserves the middle-object isomorphism class by [F3], and so does its reflexive, symmetric and transitive closure. Thus taking the middle-object class defines a map from the finite set YExt⁡1(M,N). If gM,NL≠0, a counted subobject and quotient give a short exact sequence 0→N→L→M→0 after transporting its endpoints by isomorphisms, so [L] lies in the image. That image is finite, proving finite support without simultaneous choices of extension representatives.

2.1F2step 1.2step 1.3algebra∎

Each coefficient is a natural number and the support is finite by steps 1.2–1.3. Mapping an integer n to n1R therefore gives a well-defined element of the direct sum in [F2], with no automorphism denominator or additional finiteness condition.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The untwisted Hall product is associative and unital

Statement

For every small finitary abelian category A and commutative coefficient ring R, the operation of The untwisted Hall algebra of a finitary abelian category is a well-defined associative R-bilinear multiplication on HA,R, with unit [0], the basis symbol of the zero object.

Facts & Assumptions

Given: A small finitary abelian category A, a commutative ring R with unit, and the product convention [M]∗[N]=∑[L]gM,NL[L].

[F1]

The product coefficient counts subobjects N with quotient M, and the natural-number counts are mapped to R (The untwisted Hall algebra of a finitary abelian category).

[F2]

Each coefficient is finite and, for fixed M,N, only finitely many middle-object classes occur (Untwisted Hall structure constants and products are finite).

[F3]

For a fixed quotient L/W, subobjects of it correspond bijectively to flags W≤U≤L, with (L/W)/(U/W)≅L/U (Flags lift uniquely through a quotient in an abelian category).

[F4]

Every monomorphism in an abelian category is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).

Proof

technique · direct
1.1F1F2

Fix basis objects M,N,P,L. The coefficient of [L] in ([M]∗[N])∗[P] is the sum over isomorphism classes [X] of gM,NXgX,PL. By [F1], this counts a subobject W≤L with W≅P and L/W≅X, together with a subobject U‾≤L/W with U‾≅N and (L/W)/U‾≅M. The quotient class [X]=[L/W] is uniquely determined by W, so this sum counts exactly these pairs.

1.2F1F2F3

By [F3], each such pair (W,U‾) corresponds to exactly one flag W≤U≤L with W≅P, U/W≅N, and L/U≅M. The coefficient of [L] in [M]∗([N]∗[P]) counts the same flags: first choose U≤L with U≅Y, L/U≅M, then choose W≤U with W≅P, U/W≅N, summing over the uniquely determined class [Y]=[U].

1.3F1F4

The only subobject isomorphic to zero is the zero subobject, and the only subobject with zero quotient is the whole object: in the latter case the inclusion has zero cokernel and hence is an isomorphism by [F4]. Thus gM,0L=1 exactly when L≅M, while g0,ML=1 exactly when L≅M. The zero-object symbol is a two-sided unit.

2.1F2step 1.1step 1.2

The two parenthesizations therefore have the same coefficient at every basis vector [L], so ([M]∗[N])∗[P]=[M]∗([N]∗[P]) for basis elements.

3.1F2step 2.1step 1.3∎

Basis products have finite support by [F2]. Every element of HA,R is a finite linear combination of basis vectors, so bilinearity extends the basis calculation in step 2.1 to all triples and preserves finite support. Step 1.3 supplies the unit, proving the statement.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The generic Jordan-quiver Hall algebra is the symmetric-function ring

Statement

Let k=Fq, and let Iλ denote the nilpotent Jordan-quiver representation indexed by a partition λ, as in Jordan-quiver isomorphism classes are indexed by partitions. For partitions μ,ν,λ, let gμ,νλ(q) be the coefficient of [Iλ] in the untwisted product [Iμ]∗[Iν]. There are polynomials Gμ,νλ(t)∈Z[t], independent of the finite field, with gμ,νλ(q)=Gμ,νλ(q). A coefficient is zero unless ∣λ∣=∣μ∣+∣ν∣.

Define the generic Jordan-quiver Hall algebra by Hgen:=⨁λZ[t]uλ,uμ∗uν:=∑λGμ,νλ(t)uλ, giving uλ degree ∣λ∣ and t degree 0. The size condition above makes this a graded algebra. Then Hgen is a commutative associative unital algebra and a free polynomial algebra over Z[t] on the classes u(1r), r≥1. After extending scalars to Z[t,t−1], the assignment Φt(u(1r))=t−r(r−1)/2er for every r≥1, and Φt(u∅)=1, extends uniquely to a graded algebra isomorphism Hgen⊗Z[t]Z[t,t−1]  ≅  Λ⊗ZZ[t,t−1], where Λ is the stable graded ring of symmetric functions.

Facts & Assumptions

Given: A finite field k=Fq, its cardinality q, the Jordan-quiver category Jk, and an integer r≥0 when a simple direct-sum multiplicity is used.

[F1]

The untwisted product coefficient counts subobjects N with quotient M, and its structure constants lie in the natural numbers before their image in a coefficient ring (The untwisted Hall algebra of a finitary abelian category).

[F2]

The product is finite-support and associative, with zero-object unit (Untwisted Hall structure constants and products are finite, The untwisted Hall product is associative and unital).

[F3]

The category is finitary over every finite field, and its subobjects are the invariant subspaces (Jordan-quiver categories are abelian; finite-field models are finitary).

[F4]

Isomorphism classes are the partition-indexed objects Iλ, and each is a direct sum of Jordan blocks (Jordan-quiver isomorphism classes are indexed by partitions).

[F5]

Flags in a quotient lift to flags between the kernel subobject and the whole object (Flags lift uniquely through a quotient in an abelian category).

[F6]

A nonzero real polynomial of degree n has at most n distinct real roots (A nonzero real polynomial of degree n has no more than n distinct real roots).

[F7]

Partition conjugation is a bijection on partitions (Partitions, English diagrams, and conjugation).

[F8]

The stable symmetric-function ring is Z[e1,e2,…], freely generated by its elementary symmetric functions (The stable graded ring of symmetric functions, Elementary and complete families freely generate the stable ring).

Proof

technique · direct
1.1F1F3F4

If λ=∅, then Iλ=0: the coefficient of [I∅] in [Iμ]∗[S⊕r] is 1 when r=0 and μ=∅, and is 0 otherwise, so it is a constant polynomial. Now suppose λ=(1l12l2⋯nln) is nonempty, with n its largest part, and let x act on Iλ, with S=I1. By [F1], the coefficient of [Iλ] in [Iμ]∗[S⊕r] counts subobjects isomorphic to S⊕r with quotient type μ. By [F3], these are exactly the r-dimensional subspaces R⊆ker⁡x, since x acts as zero on S⊕r.

1.2givenalgebra

The Gaussian counts [ab]q are polynomial in q: for 0<b<a, fixing a hyperplane gives [ab]q=[a−1b]q+qa−b[a−1b−1]q, with boundary values [a0]q=[aa]q=1. In the second term, after choosing the (b−1)-dimensional intersection with the hyperplane, the remaining one-dimensional subspace in the quotient has qa−b choices outside the quotient hyperplane. Induction on a gives polynomials in Z[q].

1.3F1F4algebra

Finite-dimensional duality sends (V,x) to (V∗,x∗). If U⊆V is x-invariant, its annihilator U⊥⊆V∗ is x∗-invariant, and dualizing 0→U→V→V/U→0 exchanges the subobject and quotient. A Jordan block is isomorphic to its transpose by reversing its Jordan-string basis, so [F4] gives Iλ∗≅Iλ. This bijection proves gμ,νλ(q)=gν,μλ(q); each finite-field Hall algebra is commutative.

2.1F4step 1.1algebra

For the nonempty partition in step 1.1, put Ki=ker⁡x∩im⁡xi for i≥0, with K0=ker⁡x and Kn=0. Each Jordan block of size j contributes one dimension to Ki exactly when j>i, so dim⁡(Ki−1/Ki)=li. For a counted subspace set r0=r=dim⁡R, ri=dim⁡(R∩Ki), and rn=0. Let y be the operator induced by x on Iλ/R. Write x−i(R):={v:xi(v)∈R}. The map xi:x−i(R)→R∩im⁡xi is onto with kernel ker⁡xi; also R⊆x−i(R). Since R∩im⁡xi=R∩Ki, quotienting by R gives dim⁡ker⁡yi=dim⁡ker⁡xi−r+ri. For a nilpotent Jordan type with block multiplicities (li), the number of blocks of size i is the second difference 2dim⁡ker⁡xi−dim⁡ker⁡xi−1−dim⁡ker⁡xi+1. Applying this formula to y shows that its multiplicity of blocks of size i is mi=li+2ri−ri−1−ri+1, with all ri=0 beyond n.

3.1F4step 2.1constructalgebra

Let ai=ri−1−ri. For a valid profile, 0≤ai≤li. Choosing the graded subspaces (R∩Ki−1)/(R∩Ki)⊆Ki−1/Ki contributes ∏i=1n[liai]q possibilities. For fixed graded subspaces, build their lifts from the top of the flag down: at level i<n, each lift is the graph of a linear map from an ai-dimensional space to Ki/(R∩Ki), giving qai(dim⁡Ki−ri) choices. Multiplying these independent choices gives q∑i=1n−1ai(dim⁡Ki−ri)=q∑i=1n−1(ri−1−ri)(∑j>ilj−ri). Thus this power of q times the displayed product counts all subspaces with the chosen intersection dimensions.

4.1F3F4step 2.1step 3.1step 1.2

For fixed λ,μ,r, each profile has integers r=r0≥r1≥⋯≥rn=0 with 0≤ri≤dim⁡Ki, so there are finitely many profiles. Keep exactly those whose block multiplicities mi from step 2.1 equal #{j:μj=i} for every i. These constraints are independent of the field by [F3]–[F4]. Summing the polynomial counts from steps 3.1 and 1.2 over the retained profiles proves that every coefficient in [Iμ]∗[S⊕r] is a universal polynomial in q.

5.1F1F2F5step 4.1construct

For the empty partition define X∅=[0], the empty product; its only nonzero coefficient is the unit coefficient at [I∅]. For a nonempty partition λ=(1l12l2⋯nln), put ai=li+li+1+⋯+ln and form Xλ(q)=[S⊕an]∗[S⊕an−1]∗⋯∗[S⊕a1]. By step 4.1 and associativity [F2], every coefficient is a polynomial in q. Parenthesize the product as ([S⊕an]∗⋯∗[S⊕a2])∗[S⊕a1]. For n=1 the coefficient is the single one-step flag counted by the basis coefficient. For n>1, the induction hypothesis says the inner coefficient counts flags of length n−1 in an intermediate object Y. The outer product [F1] chooses V1≅S⊕a1 with Iη/V1≅Y; an isomorphism identifies the inner flags with flags in this quotient, and any such isomorphism induces a bijection, so the count is independent of the isomorphism chosen. By [F5] each quotient flag lifts uniquely to a flag containing V1, and its quotient clause identifies each lifted successive quotient with the corresponding quotient in the quotient flag. Thus the coefficient of [Iη] counts exactly flags 0=V0⊂V1⊂⋯⊂Vn=Iη with Vi/Vi−1≅S⊕ai.

6.1F4step 2.1step 5.1algebra

For every such flag, x(Vi)⊆Vi−1, hence Vi⊆ker⁡xi. Each Jordan block of length j contributes min⁡(i,j) to dim⁡ker⁡xi, so dim⁡Vi=∑h=1iah=∑j=1nmin⁡(i,j)lj=dim⁡ker⁡xIλi. For the type λ itself, the kernels Vi=ker⁡xi form a valid flag: each induced endomorphism on Vi/Vi−1 is zero and the quotient has dimension ai, so it is isomorphic to S⊕ai. If all these kernel dimensions agree for another type η, their block multiplicities agree by second differences, so η=λ; the flag is then forced to be the kernel flag just constructed and is unique. On partitions of a fixed total size, order types by componentwise comparison of these kernel dimensions; antisymmetry follows from the second-difference formula. Therefore Xλ(q)=[Iλ]+∑η≺λcλ,η(q)[Iη], where η≺λ means all kernel dimensions are at least those of λ, with at least one strict inequality.

7.1F2step 1.3step 4.1step 5.1step 6.1algebra

In each fixed total dimension there are finitely many partitions. The transition matrix in step 6.1 is triangular with diagonal entries one and polynomial entries from steps 4.1 and 5.1, so it is invertible over Z[t] by recursive substitution. Thus every [Iλ] is a polynomial combination of monomials in the semisimple classes. For each finite field, use associativity [F2] and commutativity from step 1.3 to parenthesize and reorder a product of two such monomials so that one basis term is successively multiplied by simple-sum factors on the right. Induction on the number of factors and step 4.1 then show that every structure constant gμ,νλ(q) is the value at q of a polynomial Gμ,νλ(t)∈Z[t].

8.1F2F6F9F10step 1.3step 7.1algebra

Each coefficient polynomial is unique: the difference of two candidates vanishes at every field cardinality, and by [F9]–[F10] this includes infinitely many distinct prime cardinalities. A nonzero polynomial in Z[t] remains nonzero in R[t] because Z→R is injective; by [F6], it cannot have infinitely many distinct real roots. Thus Hgen is well-defined. Each product is finite because a short exact sequence adds vector-space dimensions, and only finitely many partitions have a fixed size. For a fixed triple of basis classes, the associativity defect is therefore a polynomial in t; it vanishes at every field-cardinality specialization by [F2], hence at infinitely many distinct prime cardinalities by [F9]–[F10]. Its coefficients embed injectively from Z into R, so [F6] implies that the defect is the zero polynomial. The same argument using step 1.3 proves commutativity. The unit equations likewise hold as polynomial identities because they hold at every field-cardinality specialization by [F2], so u∅ is the generic unit.

9.1F7step 5.1step 6.1step 7.1step 8.1algebra

The monomial Xλ in step 5.1 uses the generators u(1ai) with exponents ai, which are exactly the parts of the conjugate partition λ′. Since partition conjugation is a bijection, these Xλ run through every polynomial monomial in the generators u(1r). Their unitriangular expansions in step 6.1 show that they are also a Z[t]-basis. Together with the coefficient polynomials from step 7.1, this proves the natural map from Z[t][u(1),u(12),…] to Hgen is an isomorphism.

10.1F8step 8.1step 9.1algebra∎

By [F8], the target symmetric-function ring is the polynomial ring Z[e1,e2,…]. After adjoining t−1, each scalar t−r(r−1)/2 is a unit. Define Φt(u∅)=1 and send each free generator u(1r) to t−r(r−1)/2er; this defines an isomorphism of polynomial algebras, with inverse sending er to tr(r−1)/2u(1r). Each generator and its image have degree r, and t has degree zero, so the isomorphism preserves the grading.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Hall–Littlewood scalar product and monic functions

Definition

Let s be an indeterminate and work in ΛQ(s), the scalar extension of The stable graded ring of symmetric functions. For a partition λ, let mr(λ) be the multiplicity of its part r, and put zλ=∏r≥1rmr(λ)mr(λ)!,bλ(s)=∏r≥1∏j=1mr(λ)(1−sj),n(λ)=∑i≥1(i−1)λi. The Hall–Littlewood scalar product is the symmetric bilinear form with ⟨pλ,pμ⟩s=δλμzλ∏i(1−sλi)−1. This defines a nondegenerate form, because the power sums are a rational basis (Power sums form a rational but not integral stable basis) and all displayed diagonal entries are nonzero. Different degrees are orthogonal; empty products are 1, so ⟨1,1⟩s=1.

The monic Hall–Littlewood functions Pλ(x;s) are characterized by Pλ=mλ+∑μ⊲λcλμ(s)mμ,⟨Pλ,Pμ⟩s=0(λ≠μ), where ⊲ is strict dominance (Dominance order on partitions) and the monomials use The monomial symmetric functions form the integral stable basis. Existence, uniqueness, and the norm formula ⟨Pλ,Pλ⟩s=bλ(s)−1 are proved in Jordan Hall classes are Hall–Littlewood functions with the transported Green pairing ↗, rather than assumed in this definition. Set Qλ=bλ(s)Pλ. For a real parameter 0<s<1 the same formulas specialize wherever used below; the theorem proves their regularity there. This form differs from the ordinary symmetric-function Hall inner product, whose power-sum norms are zλ.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Automorphism counts for nilpotent Jordan representations

Statement

For the nilpotent Jordan representation Iλ over Fq, write mr=#{i:λi=r} and n(λ)=∑i(i−1)λi. Then aλ(q):=∣Aut⁡(Iλ)∣=q∣λ∣+2n(λ)∏r≥1∏j=1mr(1−q−j). In particular a∅(q)=1.

Facts & Assumptions

Given: A finite field k of cardinality q, a partition λ, and Iλ with its nilpotent operator denoted T.

[F1]

The representation is the direct sum of blocks Ir with multiplicities mr (Jordan-quiver isomorphism classes are indexed by partitions).

[F2]

Conjugate partition columns have heights λj′=#{i:λi≥j} (Partitions, English diagrams, and conjugation).

[F3]

In a nilpotent Jordan-string basis v1,…,vr, the operator satisfies Tv1=0 and Tvj=vj−1 for j>1; its matrix is Jr(0) (Jordan blocks, Jordan strings, and their endpoints).

Proof

1.1F1F2F3algebra

For the Jordan-string basis v1,…,vr of Ir, we have Tv1=0 and Tvj=vj−1 for j>1. Give Ir the k[T]-module structure in which T acts by its nilpotent operator. The linear map k[T]/(Tr)→Ir sending Ti to vr−i for 0≤i<r is a bijection commuting with T, hence a module isomorphism. Intertwining linear maps are exactly module homomorphisms. A module homomorphism k[T]/Tr→k[T]/Th is determined by the image of 1, which may be any vector killed by Tr; that space has dimension min⁡(r,h). Thus the endomorphism algebra of Iλ has dimension D=∑r,hmrmhmin⁡(r,h)=∑j(λj′)2. Counting each column's ordered pairs of boxes gives ∑j(λj′)2=∣λ∣+2∑i(i−1)λi: in a column of height c, its square is c+2∑i=1c(i−1).

2.1F1step 1.1algebra

Consider the induced map of an endomorphism f on Iλ/TIλ. Ordered by block length, its matrix is block triangular: a homomorphism from length r to a larger length h has image of 1 divisible by Th−r and hence has zero reduction in the target head. Its diagonal blocks are arbitrary matrices Br∈Mat⁡mr(k); all choices occur independently by constant matrices between blocks of the same length. The linear map from the D-dimensional endomorphism space to these diagonal blocks is onto, with every fiber of size qD−∑rmr2.

3.1F1step 2.1algebra

The map f is invertible exactly when all Br are invertible. Necessity follows from invertibility on the quotient. Conversely those blocks make the triangular head map surjective, so Iλ=f(Iλ)+TIλ. Since f commutes with T, iteration gives Iλ=f(Iλ)+TNIλ for every N, and nilpotence makes the last summand zero for large N. Thus f is onto and, on a finite-dimensional vector space, bijective; its inverse commutes with T.

4.1step 1.1step 2.1step 3.1algebra∎

Successively choosing linearly independent columns gives ∣GL⁡m(k)∣=∏i=0m−1(qm−qi)=qm2∏j=1m(1−q−j), including m=0. Hence the two preceding steps count the automorphisms as qD−∑rmr2∏r∣GL⁡mr(k)∣=qD∏r∏j=1mr(1−q−j). Substitute D from step 1.1. For λ=∅ the space is zero and its sole automorphism is the identity.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Jordan Hall classes are Hall–Littlewood functions with the transported Green pairing

Statement

Extend the generic Jordan Hall algebra of The generic Jordan-quiver Hall algebra is the symmetric-function ring to Q(t), and use that theorem's exact map Φt(u(1r))=t−(r2)er. Let n(λ) and bλ(s) have the conventions of Hall–Littlewood scalar product and monic functions, and put aλ(t)=t∣λ∣+2n(λ)bλ(t−1). Define the Jordan Green pairing to be the bilinear form (uλ,uμ)G=δλμaλ(t)−1. It is nondegenerate and equals inverse automorphism counting at every finite-field specialization t=q. Then the Hall–Littlewood functions exist uniquely in the monic orthogonal convention specified there, and Φt(uλ)=t−n(λ)Pλ(x;t−1),⟨Pλ,Pμ⟩s=δλμbλ(s)−1. More precisely, if f,g∈ΛQ(t)d, then (Φt−1f,Φt−1g)G=t−d⟨f,g⟩t−1. Different degrees are orthogonal. In particular the transported pairing on power sums is (Φt−1pλ,Φt−1pμ)G=δλμzλ∏i(tλi−1)−1. The empty partition gives 1, with norm 1. All the displayed basis and pairing identities specialize at t=q>1 and at s=q−1. The pairing normalization is a degree scaling of the standard Hall–Littlewood form; it is not the ordinary symmetric-function Hall inner product.

Facts & Assumptions

Given: The generic Jordan Hall algebra, its exact generator-normalized map Φt, a finite field of size q for counting steps, and partitions. All generating series below are formal: every coefficient used involves only finite-dimensional homogeneous spaces.

[F1]

The generic map is an algebra isomorphism with Φt(u(1r))=t−(r2)er; its proof establishes the Hall flag formula and the unitriangular expansion of the monomials Xλ=∏ju(1λj′) in Jordan classes, ordered by kernel dimensions (The generic Jordan-quiver Hall algebra is the symmetric-function ring).

[F2]

The automorphism count is aλ(q) as displayed above (Automorphism counts for nilpotent Jordan representations).

[F3]

Power sums are a basis over Q and monomial symmetric functions are an integral stable basis (Power sums form a rational but not integral stable basis, The monomial symmetric functions form the integral stable basis).

[F4]

Dominance compares row prefix sums, and conjugation reverses dominance (Dominance order on partitions, Conjugation reverses dominance).

[F5]

The Hall–Littlewood form has power-sum diagonal zλ∏i(1−sλi)−1, and its desired monic basis is specified by orthogonality and dominance triangularity (Hall–Littlewood scalar product and monic functions).

[F7]

In any commutative Q-algebra R, the series exp⁡(u) and log⁡(1+u) for u∈zR⟦z⟧ are defined by their coefficientwise finite power expansions and are inverse group homomorphisms; in particular log⁡(AB)=log⁡A+log⁡B for units with constant term 1 (Formal exponential, logarithm, and binomial powers over a commutative Q-algebra, Formal exp⁡ and log⁡ are inverse homomorphisms and formal binomial powers obey the expected addition laws).

Proof

1.1F1

For a composition a=(a1,…,ar) of d, allowing zero parts, let Xa=∏iu(1ai) and A(a)=∑i(ai2). By the Hall flag formula [F1], the coefficient of uλ in Xa at t=q counts flags 0=F0⊆F1⊆⋯⊆Fr=kd with dim⁡(Fi/Fi−1)=ai and T(Fi)⊆Fi−1, when T has type λ. A repeated subspace is permitted exactly when the corresponding part is zero. Product order reverses the quotient order, but the Jordan Hall algebra is commutative by [F1], so these flags give the stated coefficient.

1.2F1F4algebra

Put Yλ=tn(λ)Φt(uλ). The identity n(λ)=∑j(λj′2) follows by counting pairs of boxes in each column. The unitriangular Hall relation in [F1], using dim⁡ker⁡Ti=∑j≤iλj′, and dominance reversal [F4], gives eλ′=Yλ+∑μ⊲λcλμ(t)tn(λ)−n(μ)Yμ. Here eλ′=∏jeλj′, and strict kernel inequalities are exactly strict dominance in the opposite row direction.

2.1F1F2step 1.1algebra

Consequently (Xa,Xb)G at t=q equals ∑λNa(Tλ)Nb(Tλ)/aλ(q), where Na(T) counts all actual flags of type a lowered by a fixed operator T, and Tλ is one operator of each Jordan type. To rewrite this as a count of all such triples (T,F,G) on kd, fix T=Tλ and let H=GL⁡d(k) act on its conjugates. The stabilizer of T is HT={h∈H:hT=Th}=Aut⁡(Iλ), of order aλ(q) by [F2]. The map H→H⋅T, h↦hTh−1, is surjective, and two elements h1,h2 have the same image exactly when h2−1h1∈HT. Thus each fiber is a coset of HT, so this conjugacy class has ∣H∣/aλ(q) elements. Conjugation transports the lowered flags bijectively, so Na(T)Nb(T) is constant on the class. Therefore the weighted sum over Jordan types is exactly 1/∣H∣ times the number of all such triples. Lowering either finite flag makes T nilpotent.

2.2step 1.1constructalgebra

Two flags have a common splitting kd=⨁i,jWij with Fi∩Gj=⨁h≤i,l≤jWhl. Construct this by choosing a complement of (Fi−1∩Gj)+(Fi∩Gj−1) inside Fi∩Gj successively in increasing i+j; the intersection of those two summands is Fi−1∩Gj−1, so induction verifies the direct-sum description. Put mij=dim⁡Wij. These nonnegative integers have row sums ai and column sums bj. Conversely every such matrix is realized by standard coordinate blocks. Sending adapted bases to one another shows that GL⁡d(k) is transitive on pairs of flags with the same matrix. This is finite-dimensional basis selection only.

2.3F3F4step 1.2algebra

Expanding eλ′ in monomials gives mλ with coefficient 1 and only terms mμ for μ⊲λ besides it. Indeed each factor eλj′ selects λj′ distinct variables. For a resulting exponent vector arranged decreasingly, the sum of its first r exponents is at most ∑jmin⁡(r,λj′)=∑i≤rλi, giving the dominance bound. For the specific monomial x1λ1x2λ2⋯, equality holds in this bound for every r, so the variables selected in column j must be exactly x1,…,xλj′; this is the unique selection. Inverting the finite unitriangular system in step 1.2 now proves Yλ=mλ+∑μ⊲λdλμ(t)mμ.

3.1step 2.2algebra

Fix that splitting. The algebra of endomorphisms preserving both flags consists of blocks from Wij to Whl with h≤i and l≤j. Its off-diagonal blocks form a nilpotent ideal: each nonzero off-diagonal multiplication strictly decreases i+j. Thus an element is invertible exactly when every diagonal block is invertible, either by a finite geometric-series inverse after removing its invertible diagonal or by triangularity. If v=∑i,j∑h≤i,l≤jmijmhl−∑i,jmij2, the stabilizer of the flags has order qv∏ij∣GL⁡mij(k)∣. A map lowering both flags has blocks with h<i,l<j, so the space of such maps has dimension w=∑i,j∑h<i,l<jmijmhl.

4.1F1F2step 2.1step 2.2step 3.1algebra

The contribution of this matrix to the mass in step 2.1 is therefore qw−v/∏ij∣GL⁡mij(k)∣. Subtracting the block sums gives v−w=∑i∑j>lmijmil+∑j∑i>hmijmhj=12(∑iai2+∑jbj2−2∑ijmij2). Since Φq(Xa)=q−A(a)ea1⋯ear, multiplication by qA(a)+A(b) turns that contribution into ∏ijqmij2−mij/∣GL⁡mij(k)∣. Using ∣GL⁡m(k)∣=qm2∏h=1m(1−q−h), already proved in [F2], it follows that the transported form Bq(f,g)=(Φq−1f,Φq−1g)G satisfies Bq(ea1⋯ear,eb1⋯ebl)=∑m : row(m)=a, col(m)=b ∏ijq−mij∏h=1mij(1−q−h). This includes d=0, whose only matrix has zero entries and mass 1.

5.1F3F7step 4.1algebra

Let Cq(z)=∑m≥0cmzm, where cm=q−m/∏h=1m(1−q−h). The recurrence cm(1−q−m)=q−1cm−1 is equivalent to Cq(q−1z)=(1−q−1z)Cq(z). For L(z)=log⁡Cq(z) in Q⟦z⟧, [F7] and substitution give L(q−1z)−L(z)=log⁡(1−q−1z)=−∑h≥1q−hzh/h. Substitution z↦q−1z commutes with these power-series definitions because every coefficient is a finite sum. Comparing coefficients, using q>1, gives log⁡Cq(z)=∑h≥1zhh(qh−1). For E(z)=∑n≥0enzn, apply [F7] in the commutative Q-algebra Q[x1,…,xN]: the logarithm of the finite product ∏i(1+xiz) is ∑h≥1(−1)h−1(∑ixih)zh/h. Applying the inverse exponential and passing coefficientwise through the stable rank projections yields E(z)=exp⁡(∑h≥1(−1)h−1phzh/h) in ΛQ⟦z⟧. Step 4.1 therefore says Bq(∏iE(zi),∏jE(wj))=∏ijCq(ziwj)=exp⁡(∑h≥1(∑izih)(∑jwjh)h(qh−1)). Only finitely many zi,wj are used. To apply the univariate identities [F7] to this last multivariable expression, replace each zi,wj by vzi,vwj for an auxiliary variable v and work in R⟦v⟧, with R equal to Q[zi,wj] or ΛQ[zi,wj] as appropriate. These are commutative Q-algebras; all exponential arguments have positive v-order and all logarithm arguments have constant term 1. Each coefficient of v is a finite homogeneous polynomial, so comparison recovers precisely the total-degree formal identities. The same observation applies to the following exponential comparison. All these coefficient-ring hypotheses also hold over Q(t).

6.1F1F3F5F7step 5.1algebra

Define a form Dq on the power-sum basis by Dq(pλ,pμ)=δλμzλ∏i(qλi−1)−1. Expanding the two exponentials for E in step 5.1 and using this diagonal rule yields the same final exponential: for each h, the equal multiplicities m contribute ((∑izih)(∑jwjh)/(h(qh−1)))m/m!, since the two signs cancel. Thus Bq and Dq agree on every product of elementary functions in both arguments, which spans by [F1]. They are equal. On degree d, the displayed power-sum diagonal of Dq is q−d times that of ⟨ , ⟩q−1.

7.1F1F2F6step 6.1algebra

For each fixed degree the entries of the generic transported form are rational functions of t: [F1] gives Laurent-polynomial images and inverse generator formulas, and [F2] gives the rational diagonal denominators aλ(t), none vanishing at t=q>1. Step 6.1 proves the desired pairing identity at every finite-field cardinality. Clearing denominators, its difference is a polynomial vanishing at infinitely many prime cardinalities, hence zero by [F6]. It follows that Bt=t−d⟨ , ⟩t−1 on degree d, and the asserted generic power-sum formula holds.

8.1F2F4F5step 7.1step 2.3algebra

The Yλ are pairwise orthogonal for Bt, since the uλ are so by its definition; step 7.1 makes them orthogonal for the Hall–Littlewood form as well. Their norms are ⟨Yλ,Yλ⟩t−1=t∣λ∣+2n(λ)aλ(t)−1=bλ(t−1)−1, which are nonzero. Replace the indeterminate t by s−1 to obtain existence of the basis required in [F5]. For uniqueness, choose a linear extension of dominance in each finite degree, placing dominated partitions first. Inductively two monic triangular orthogonal bases agree on earlier indices; their difference at the next index lies in the span of these earlier basis vectors and is orthogonal to each. Each earlier norm is nonzero, so every coefficient of the difference is zero. This proves uniqueness and identifies Yλ=Pλ(x;t−1).

9.1F1F2F5step 7.1step 8.1algebra∎

The triangular system in step 1.2 has Laurent-polynomial entries and diagonal 1, so its finite-degree inverse has Laurent-polynomial entries. Hence the constructed Yλ and thus Pλ(x;s) have no poles for s≠0, in particular at s=q−1. The pairing denominators also remain nonzero there. All identities therefore specialize as stated. The zero partition is the empty flag, u∅=1, n(∅)=0, and a∅=b∅=1, so its image and norm are 1. This proves every asserted normalization and boundary case without assuming a Green coproduct theorem or a physical interpretation.

5 · Examples, counterexamples and false statements

None yet.

Sources