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 , and use that theorem's exact map . Let and have the conventions of Hall–Littlewood scalar product and monic functions, and put Define the Jordan Green pairing to be the bilinear form It is nondegenerate and equals inverse automorphism counting at every finite-field specialization . Then the Hall–Littlewood functions exist uniquely in the monic orthogonal convention specified there, and More precisely, if , then Different degrees are orthogonal. In particular the transported pairing on power sums is The empty partition gives , with norm . All the displayed basis and pairing identities specialize at and at . 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 , a finite field of size for counting steps, and partitions. All generating series below are formal: every coefficient used involves only finite-dimensional homogeneous spaces.
The generic map is an algebra isomorphism with ; its proof establishes the Hall flag formula and the unitriangular expansion of the monomials in Jordan classes, ordered by kernel dimensions (The generic Jordan-quiver Hall algebra is the symmetric-function ring).
The automorphism count is as displayed above (Automorphism counts for nilpotent Jordan representations).
Power sums are a basis over 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).
Dominance compares row prefix sums, and conjugation reverses dominance (Dominance order on partitions, Conjugation reverses dominance).
The Hall–Littlewood form has power-sum diagonal , and its desired monic basis is specified by orthogonality and dominance triangularity (Hall–Littlewood scalar product and monic functions).
Infinitely many prime cardinalities give finite fields, and a nonzero polynomial has only finitely many real roots (Euclid's theorem: for every and every list of primes there is a prime not among ; consequently the set of primes is not finite, For every prime , the two operations on make it a field, For , every class in has one representative with , so ; while is in bijection with , A nonzero real polynomial of degree has no more than distinct real roots).
In any commutative -algebra , the series and for are defined by their coefficientwise finite power expansions and are inverse group homomorphisms; in particular for units with constant term (Formal exponential, logarithm, and binomial powers over a commutative -algebra, Formal and are inverse homomorphisms and formal binomial powers obey the expected addition laws).
Proof
For a composition of , allowing zero parts, let and . By the Hall flag formula [F1], the coefficient of in at counts flags with and , when 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.
Put . The identity follows by counting pairs of boxes in each column. The unitriangular Hall relation in [F1], using , and dominance reversal [F4], gives Here , and strict kernel inequalities are exactly strict dominance in the opposite row direction.
Consequently at equals , where counts all actual flags of type lowered by a fixed operator , and is one operator of each Jordan type. To rewrite this as a count of all such triples on , fix and let act on its conjugates. The stabilizer of is , of order by [F2]. The map , , is surjective, and two elements have the same image exactly when . Thus each fiber is a coset of , so this conjugacy class has elements. Conjugation transports the lowered flags bijectively, so is constant on the class. Therefore the weighted sum over Jordan types is exactly times the number of all such triples. Lowering either finite flag makes nilpotent.
Two flags have a common splitting with . Construct this by choosing a complement of inside successively in increasing ; the intersection of those two summands is , so induction verifies the direct-sum description. Put . These nonnegative integers have row sums and column sums . Conversely every such matrix is realized by standard coordinate blocks. Sending adapted bases to one another shows that is transitive on pairs of flags with the same matrix. This is finite-dimensional basis selection only.
Expanding in monomials gives with coefficient and only terms for besides it. Indeed each factor selects distinct variables. For a resulting exponent vector arranged decreasingly, the sum of its first exponents is at most , giving the dominance bound. For the specific monomial , equality holds in this bound for every , so the variables selected in column must be exactly ; this is the unique selection. Inverting the finite unitriangular system in step 1.2 now proves .
Fix that splitting. The algebra of endomorphisms preserving both flags consists of blocks from to with and . Its off-diagonal blocks form a nilpotent ideal: each nonzero off-diagonal multiplication strictly decreases . 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 , the stabilizer of the flags has order . A map lowering both flags has blocks with , so the space of such maps has dimension .
The contribution of this matrix to the mass in step 2.1 is therefore . Subtracting the block sums gives . Since , multiplication by turns that contribution into . Using , already proved in [F2], it follows that the transported form satisfies This includes , whose only matrix has zero entries and mass .
Let , where . The recurrence is equivalent to . For in , [F7] and substitution give . Substitution commutes with these power-series definitions because every coefficient is a finite sum. Comparing coefficients, using , gives For , apply [F7] in the commutative -algebra : the logarithm of the finite product is . Applying the inverse exponential and passing coefficientwise through the stable rank projections yields in . Step 4.1 therefore says Only finitely many are used. To apply the univariate identities [F7] to this last multivariable expression, replace each by for an auxiliary variable and work in , with equal to or as appropriate. These are commutative -algebras; all exponential arguments have positive -order and all logarithm arguments have constant term . Each coefficient of 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 .
Define a form on the power-sum basis by . Expanding the two exponentials for in step 5.1 and using this diagonal rule yields the same final exponential: for each , the equal multiplicities contribute , since the two signs cancel. Thus and agree on every product of elementary functions in both arguments, which spans by [F1]. They are equal. On degree , the displayed power-sum diagonal of is times that of .
For each fixed degree the entries of the generic transported form are rational functions of : [F1] gives Laurent-polynomial images and inverse generator formulas, and [F2] gives the rational diagonal denominators , none vanishing at . 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 on degree , and the asserted generic power-sum formula holds.
The are pairwise orthogonal for , since the are so by its definition; step 7.1 makes them orthogonal for the Hall–Littlewood form as well. Their norms are which are nonzero. Replace the indeterminate by 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 .
The triangular system in step 1.2 has Laurent-polynomial entries and diagonal , so its finite-degree inverse has Laurent-polynomial entries. Hence the constructed and thus have no poles for , in particular at . The pairing denominators also remain nonzero there. All identities therefore specialize as stated. The zero partition is the empty flag, , , and , so its image and norm are . This proves every asserted normalization and boundary case without assuming a Green coproduct theorem or a physical interpretation.
Depends on
- The generic Jordan-quiver Hall algebra is the symmetric-function ring
- Automorphism counts for nilpotent Jordan representations
- Hall–Littlewood scalar product and monic functions
- Formal exponential, logarithm, and binomial powers over a commutative $\mathbb Q$-algebra
- Formal $\exp$ and $\log$ are inverse homomorphisms and formal binomial powers obey the expected addition laws
- Dominance order on partitions
- Conjugation reverses dominance
- The monomial symmetric functions form the integral stable basis
- Power sums form a rational but not integral stable basis
- Euclid's theorem: for every $n \in \mathbb{N}$ and every list $p : n \to \mathbb{Z}$ of primes there is a prime not among $p_0, \dots, p_{n-1}$; consequently the set of primes is not finite
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- A nonzero real polynomial of degree $n$ has no more than $n$ distinct real roots
Used by
- Degree-one normalization for the Jordan Hall Green pairing and Fock action Example
- Jordan Hall–Littlewood basis and pairing in degrees zero, one and two Example
- The generic Jordan Hall regular module carries the normalized Heisenberg Fock action Theorem
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
- Olivier Schiffmann, Lectures on Hall Algebras, §§2.3–2.4, Lemma 2.8 and (2.9) (standard reference, not scraped)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, III §§2–4 and VI §1 (standard reference, not scraped)