<p>This note extends the recent work of S. Azizi, A. S. Janfada (2024) on the symmetric treatment of “up” and “down” Steenrod powers for an odd prime <i>p</i>. We give a rigorous proof that their recursively defined Triangular algorithm agrees with the algebraic action of the up Steenrod powers <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\cal{P}^k\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msup> <mrow> <mi mathvariant="script">P</mi> </mrow> <mi>k</mi> </msup> </math></EquationSource> </InlineEquation> on polynomial algebras, thereby formalizing the harmonic patterns they observed. Building on this, we establish a multivariable extension of their one-variable formula: for a monomial <i>x</i><sup><i>α</i></sup> and any <i>k</i> ⩾ 0, the Cartan-Lucas factorization yields an explicit expansion of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\cal{P}^k(x^\alpha)\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msup> <mrow> <mi mathvariant="script">P</mi> </mrow> <mi>k</mi> </msup> <mo stretchy="false">(</mo> <msup> <mi>x</mi> <mi>α</mi> </msup> <mo stretchy="false">)</mo> </math></EquationSource> </InlineEquation> whose nonvanishing is governed coordinatewise by the digitwise partial order <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\preceq_p\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msub> <mo>⪯</mo> <mi>p</mi> </msub> </math></EquationSource> </InlineEquation>. For a general polynomial <i>f</i>, we obtain a support-level description <Equation ID="Equ1"> <EquationSource Format="TEX">\({\text{supp}}(\cal{P}^k(f))\subseteq\cal{S}_k(f) =\{\beta=\alpha+(p-1)\kappa\colon\alpha\in{\text{supp}}(f),\, |\kappa|=k,\, \kappa_i\preceq_p\alpha_i \},\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtext>supp</mtext> </mrow> <mo stretchy="false">(</mo> <msup> <mrow> <mi mathvariant="script">P</mi> </mrow> <mi>k</mi> </msup> <mo stretchy="false">(</mo> <mi>f</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> <mo>⊆</mo> <msub> <mrow> <mi mathvariant="script">S</mi> </mrow> <mi>k</mi> </msub> <mo stretchy="false">(</mo> <mi>f</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mo fence="false" stretchy="false">{</mo> <mi>β</mi> <mo>=</mo> <mi>α</mi> <mo>+</mo> <mo stretchy="false">(</mo> <mi>p</mi> <mo>−</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mi>κ</mi> <mo>:</mo> <mi>α</mi> <mo>∈</mo> <mrow> <mtext>supp</mtext> </mrow> <mo stretchy="false">(</mo> <mi>f</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mspace width="thinmathspace" /> <mrow> <mo stretchy="false">|</mo> </mrow> <mi>κ</mi> <mrow> <mo stretchy="false">|</mo> </mrow> <mo>=</mo> <mi>k</mi> <mo>,</mo> <mspace width="thinmathspace" /> <msub> <mi>κ</mi> <mi>i</mi> </msub> <msub> <mo>⪯</mo> <mi>p</mi> </msub> <msub> <mi>α</mi> <mi>i</mi> </msub> <mo fence="false" stretchy="false">}</mo> <mo>,</mo> </math></EquationSource> </Equation> together with an explicit coefficient formula. On the combinatorial side, we identify the 0/1 triangular matrices [<i>U</i><sub><i>p</i></sub>](<i>t</i>) with the Kronecker powers <i>T</i><Stack> <sub><i>p</i></sub> <sup>⊗<i>t</i></sup> </Stack> of the <i>p</i> × <i>p</i> upper-triangular all-ones matrix <i>T</i><sub><i>p</i></sub>, proving the digitwise characterization <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\([U_p](t)_{k,d}=1\iff k\preceq_p d\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mo stretchy="false">[</mo> <msub> <mi>U</mi> <mi>p</mi> </msub> <mo stretchy="false">]</mo> <mo stretchy="false">(</mo> <mi>t</mi> <msub> <mo stretchy="false">)</mo> <mrow> <mi>k</mi> <mo>,</mo> <mi>d</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <mspace width="thickmathspace" /> <mo stretchy="false">⟺</mo> <mspace width="thickmathspace" /> <mi>k</mi> <msub> <mo>⪯</mo> <mi>p</mi> </msub> <mi>d</mi> </math></EquationSource> </InlineEquation>. Via graded duality, the same digitwise criterion yields an analogous support-level description for the down Steenrod powers <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\cal{P}_k\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msub> <mrow> <mi mathvariant="script">P</mi> </mrow> <mi>k</mi> </msub> </math></EquationSource> </InlineEquation> on the divided power algebra <i>DP</i>(<i>n</i>), and we illustrate the resulting row-shift dictionary between up and down patterns by explicit 0/1 heatmaps for <i>p</i> = 3.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A note on harmonic patterns and multi-variable formulae for the action of Steenrod powers

  • Phúc Võ Đặng

摘要

This note extends the recent work of S. Azizi, A. S. Janfada (2024) on the symmetric treatment of “up” and “down” Steenrod powers for an odd prime p. We give a rigorous proof that their recursively defined Triangular algorithm agrees with the algebraic action of the up Steenrod powers \(\cal{P}^k\) P k on polynomial algebras, thereby formalizing the harmonic patterns they observed. Building on this, we establish a multivariable extension of their one-variable formula: for a monomial xα and any k ⩾ 0, the Cartan-Lucas factorization yields an explicit expansion of \(\cal{P}^k(x^\alpha)\) P k ( x α ) whose nonvanishing is governed coordinatewise by the digitwise partial order \(\preceq_p\) p . For a general polynomial f, we obtain a support-level description \({\text{supp}}(\cal{P}^k(f))\subseteq\cal{S}_k(f) =\{\beta=\alpha+(p-1)\kappa\colon\alpha\in{\text{supp}}(f),\, |\kappa|=k,\, \kappa_i\preceq_p\alpha_i \},\) supp ( P k ( f ) ) S k ( f ) = { β = α + ( p 1 ) κ : α supp ( f ) , | κ | = k , κ i p α i } , together with an explicit coefficient formula. On the combinatorial side, we identify the 0/1 triangular matrices [Up](t) with the Kronecker powers T p t of the p × p upper-triangular all-ones matrix Tp, proving the digitwise characterization \([U_p](t)_{k,d}=1\iff k\preceq_p d\) [ U p ] ( t ) k , d = 1 k p d . Via graded duality, the same digitwise criterion yields an analogous support-level description for the down Steenrod powers \(\cal{P}_k\) P k on the divided power algebra DP(n), and we illustrate the resulting row-shift dictionary between up and down patterns by explicit 0/1 heatmaps for p = 3.