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.
Power sums are orthogonal for the Hall form
Statement
Extend the Hall form on -bilinearly to . For partitions and , let Then In particular, power sums of unequal degrees are orthogonal.
Facts & Assumptions
Given: The graded Hall form, its dual complete and monomial bases, the power-sum and complete–monomial Cauchy expansions, and the rational power-sum basis.
The Hall form is graded and satisfies for partitions ; its degreewise restriction extends to a -bilinear form on each (The Hall inner product on symmetric functions).
For the Cauchy kernel, each diagonal bidegree component has both expansions and in the rational tensor product (Power-sum, complete, and Schur expansions of the Cauchy kernel).
For each , is a -basis of (Power sums form a rational but not integral stable basis).
Proof
Fix , whose partition set is finite, and let ; the Hall form extends to by scalar extension. Let and be any two bases and write and using the dual bases from [F1]. With and , [F1] gives , while the coefficient of in is . If this tensor equals the complete–monomial kernel from [F2], then ; invertibility yields and , hence . This finite dual-kernel criterion makes no symmetry assumption on the Hall form.
By [F3], is a basis of . A partition has finitely many parts, so only finitely many are nonzero; thus is a positive integer and is also a basis. The power-sum expansion in [F2] is , so step 1.1 gives . Bilinearity yields , which equals on the diagonal and zero off it. For , , , and ; for the one-part partition , and .
If , the graded definition in [F1] gives , and bilinearity makes a zero input pair to zero. Each fixed degree has finitely many partitions, and the proof uses finite basis changes and sums; no arbitrary choices are made and the axiom of choice is not used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I §4, equations (4.5)–(4.7), printed pp. 63–64 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.9, printed pp. 191–195 (standard reference, not scraped)