Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Cited to discharge well-definedness by Hall–Littlewood scalar product and monic functions.

Dependency tree · two levels

67 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