TheoremBase

Proof

Throughout, SS is the successor map of Natural Numbers, ≤\le is the order on N\mathbb{N}, and [n][n] is the initial segment determined by nn. Sums are the finite sums of KK and powers are those of Natural Number Power of an Element of a Field; commutativity, associativity and distributivity are the axioms of Field.

By Polynomial Function on a Field we may fix natural numbers M,NM,N, elements a0,b0∈Ka_{0},b_{0}\in K and maps a:[M]→Ka:[M]\to K and b:[N]→Kb:[N]\to K such that

p(x)=a0+∑k=1Makxk,q(x)=b0+∑l=1Nblxlfor every x∈K.p(x)=a_{0}+\sum_{k=1}^{M}a_{k}x^{k},\qquad q(x)=b_{0}+\sum_{l=1}^{N}b_{l}x^{l}\qquad\text{for every }x\in K.

Step 1 (padding with zero coefficients). Let N′,L∈NN',L\in\mathbb{N} with N′≤LN'\le L, let c:[N′]→Kc:[N']\to K, and let c~:[L]→K\tilde{c}:[L]\to K be the map with c~k=ck\tilde{c}_{k}=c_{k} for k∈[N′]k\in[N'] and c~k=0\tilde{c}_{k}=0 for those k∈[L]k\in[L] with k∉[N′]k\notin[N']; this is well defined because [N′]⊆[L][N']\subseteq[L] by claim 4 of Basic Properties of Initial Segments of the Natural Numbers. Then

∑k=1Lc~kxk=∑k=1N′ckxkfor every x∈K.\sum_{k=1}^{L}\tilde{c}_{k}x^{k}=\sum_{k=1}^{N'}c_{k}x^{k}\qquad\text{for every }x\in K.

Fix x∈Kx\in K and let EE be the set of those L∈NL\in\mathbb{N} for which the displayed identity holds for every N′≤LN'\le L and every c:[N′]→Kc:[N']\to K.

If N′≤1N'\le 1 then 1≤N′1\le N' by claim 4 of Properties of the Order on the Natural Numbers, hence N′=1N'=1 by claim 2 of that lemma; then c~=c\tilde{c}=c and there is nothing to prove. Thus 1∈E1\in E.

Let L∈EL\in E and let N′≤S(L)N'\le S(L). If N′=S(L)N'=S(L) then c~=c\tilde{c}=c and the identity is trivial. Otherwise N′≤LN'\le L by claim 5 of Properties of the Order on the Natural Numbers. The restriction of c~\tilde{c} to [L][L] is exactly the extension of cc by zeros associated with the pair N′≤LN'\le L, so the restriction part of claim 1 of Properties of Finite Sums, applied to the family k↦c~kxkk\mapsto\tilde{c}_{k}x^{k}, together with L∈EL\in E gives

∑k=1Lc~kxk=∑k=1N′ckxk.\sum_{k=1}^{L}\tilde{c}_{k}x^{k}=\sum_{k=1}^{N'}c_{k}x^{k}.

By claim 3 of Basic Properties of Initial Segments of the Natural Numbers we have S(L)∉[L]S(L)\notin[L], hence S(L)∉[N′]S(L)\notin[N'], so c~S(L)=0\tilde{c}_{S(L)}=0 and therefore c~S(L)xS(L)=0\tilde{c}_{S(L)}x^{S(L)}=0 by claim 1 of Zero Products and Elementary Identities in a Field. The recursion part of claim 1 of Properties of Finite Sums now gives

∑k=1S(L)c~kxk=∑k=1Lc~kxk+c~S(L)xS(L)=∑k=1N′ckxk,\sum_{k=1}^{S(L)}\tilde{c}_{k}x^{k}=\sum_{k=1}^{L}\tilde{c}_{k}x^{k}+\tilde{c}_{S(L)}x^{S(L)}=\sum_{k=1}^{N'}c_{k}x^{k},

so S(L)∈ES(L)\in E. By Principle of Induction for the Natural Numbers, E=NE=\mathbb{N}, which proves Step 1.

Step 2 (claim 1). For the constant map with value λ\lambda, take N′=1N'=1, c0=λc_{0}=\lambda and c:[1]→Kc:[1]\to K with c1=0c_{1}=0. For every x∈Kx\in K, claim 1 of Properties of Finite Sums gives ∑k=11ckxk=c1x1\sum_{k=1}^{1}c_{k}x^{k}=c_{1}x^{1}, and x1=xx^{1}=x by claim 1 of Properties of Natural Number Powers in a Field, so c1x1=0x=0c_{1}x^{1}=0x=0 by claim 1 of Zero Products and Elementary Identities in a Field. Hence λ+∑k=11ckxk=λ+0=λ\lambda+\sum_{k=1}^{1}c_{k}x^{k}=\lambda+0=\lambda, and the constant map is a polynomial function.

Now fix n∈Nn\in\mathbb{N} and take N′=nN'=n, c0=0c_{0}=0 and c:[n]→Kc:[n]\to K with cn=1c_{n}=1 and ck=0c_{k}=0 for those k∈[n]k\in[n] with k≠nk\ne n; here n∈[n]n\in[n] by claim 1 of Basic Properties of Initial Segments of the Natural Numbers. Fix x∈Kx\in K. For k∈[n]k\in[n] with k≠nk\ne n we have ckxk=0xk=0c_{k}x^{k}=0x^{k}=0 by claim 1 of Zero Products and Elementary Identities in a Field, so claim 7 of Properties of Finite Sums, applied to the family k↦ckxkk\mapsto c_{k}x^{k}, gives ∑k=1nckxk=cnxn=1xn=xn\sum_{k=1}^{n}c_{k}x^{k}=c_{n}x^{n}=1x^{n}=x^{n}. Hence 0+∑k=1nckxk=xn0+\sum_{k=1}^{n}c_{k}x^{k}=x^{n}, and x↦xnx\mapsto x^{n} is a polynomial function.

Step 3 (claim 2). For the scalar multiple, distributivity and claim 3 of Properties of Finite Sums give, for every x∈Kx\in K,

λp(x)=λa0+λ∑k=1Makxk=λa0+∑k=1Mλ(akxk)=λa0+∑k=1M(λak)xk,\lambda p(x)=\lambda a_{0}+\lambda\sum_{k=1}^{M}a_{k}x^{k}=\lambda a_{0}+\sum_{k=1}^{M}\lambda\bigl(a_{k}x^{k}\bigr)=\lambda a_{0}+\sum_{k=1}^{M}(\lambda a_{k})x^{k},

the last equality by associativity of multiplication. Thus λp\lambda p is a polynomial function, with coefficients (M,λa0,k↦λak)\bigl(M,\lambda a_{0},k\mapsto\lambda a_{k}\bigr).

For the sum, by trichotomy (claim 3 of Properties of the Order on the Natural Numbers) and claim 1 of that lemma, at least one of M≤NM\le N and N≤MN\le M holds; let LL be NN in the first case and MM in the second, so that M≤LM\le L and N≤LN\le L. Let a~,b~:[L]→K\tilde{a},\tilde{b}:[L]\to K be the extensions of aa and bb by zeros as in Step 1. For every x∈Kx\in K, Step 1 gives

p(x)+q(x)=(a0+∑k=1La~kxk)+(b0+∑k=1Lb~kxk),p(x)+q(x)=\Bigl(a_{0}+\sum_{k=1}^{L}\tilde{a}_{k}x^{k}\Bigr)+\Bigl(b_{0}+\sum_{k=1}^{L}\tilde{b}_{k}x^{k}\Bigr),

which by commutativity and associativity of addition, claim 2 of Properties of Finite Sums and distributivity equals

(a0+b0)+∑k=1L(a~kxk+b~kxk)=(a0+b0)+∑k=1L(a~k+b~k)xk.(a_{0}+b_{0})+\sum_{k=1}^{L}\bigl(\tilde{a}_{k}x^{k}+\tilde{b}_{k}x^{k}\bigr)=(a_{0}+b_{0})+\sum_{k=1}^{L}\bigl(\tilde{a}_{k}+\tilde{b}_{k}\bigr)x^{k}.

Thus p+qp+q is a polynomial function.

Step 4 (finite sums of polynomial functions). Let n∈Nn\in\mathbb{N} and, for each k∈[n]k\in[n], let gk:K→Kg_{k}:K\to K be a polynomial function on KK. Then the map x↦∑k=1ngk(x)x\mapsto\sum_{k=1}^{n}g_{k}(x) is a polynomial function on KK.

Let EE be the set of those n∈Nn\in\mathbb{N} for which this holds for every such family. For n=1n=1, claim 1 of Properties of Finite Sums gives ∑k=11gk(x)=g1(x)\sum_{k=1}^{1}g_{k}(x)=g_{1}(x), so 1∈E1\in E. Let n∈En\in E and let gkg_{k}, k∈[S(n)]k\in[S(n)], be polynomial functions. By the restriction and recursion parts of claim 1 of Properties of Finite Sums,

∑k=1S(n)gk(x)=∑k=1ngk(x)+gS(n)(x)(x∈K),\sum_{k=1}^{S(n)}g_{k}(x)=\sum_{k=1}^{n}g_{k}(x)+g_{S(n)}(x)\qquad(x\in K),

where the first summand on the right is, as a function of xx, a polynomial function by n∈En\in E applied to the restricted family. By claim 2, already proved, the right-hand side is a polynomial function of xx, so S(n)∈ES(n)\in E. By Principle of Induction for the Natural Numbers, E=NE=\mathbb{N}.

Step 5 (claim 3). Define A,B:K→KA,B:K\to K by A(x)=∑k=1MakxkA(x)=\sum_{k=1}^{M}a_{k}x^{k} and B(x)=∑l=1NblxlB(x)=\sum_{l=1}^{N}b_{l}x^{l}. Taking c0=0c_{0}=0 in Polynomial Function on a Field shows that AA and BB are polynomial functions on KK. By distributivity,

p(x)q(x)=(a0+A(x))(b0+B(x))=a0b0+a0B(x)+b0A(x)+A(x)B(x)(x∈K).p(x)q(x)=\bigl(a_{0}+A(x)\bigr)\bigl(b_{0}+B(x)\bigr)=a_{0}b_{0}+a_{0}B(x)+b_{0}A(x)+A(x)B(x)\qquad(x\in K).

The constant map with value a0b0a_{0}b_{0} is a polynomial function by claim 1, and a0Ba_{0}B and b0Ab_{0}A are polynomial functions by claim 2; so by claim 2 again it suffices to show that x↦A(x)B(x)x\mapsto A(x)B(x) is a polynomial function.

Fix x∈Kx\in K. Applying claim 3 of Properties of Finite Sums with the factor B(x)B(x), and then again with the factor akxka_{k}x^{k} for each k∈[M]k\in[M],

A(x)B(x)=∑k=1MB(x)(akxk),B(x)(akxk)=∑l=1N(akxk)(blxl),A(x)B(x)=\sum_{k=1}^{M}B(x)\bigl(a_{k}x^{k}\bigr),\qquad B(x)\bigl(a_{k}x^{k}\bigr)=\sum_{l=1}^{N}\bigl(a_{k}x^{k}\bigr)\bigl(b_{l}x^{l}\bigr),

using commutativity of multiplication. By commutativity and associativity of multiplication and by Addition of Exponents for Natural Number Powers in a Field,

(akxk)(blxl)=(akbl) xkxl=(akbl) xk+l,\bigl(a_{k}x^{k}\bigr)\bigl(b_{l}x^{l}\bigr)=(a_{k}b_{l})\,x^{k}x^{l}=(a_{k}b_{l})\,x^{k+l},

so that

A(x)B(x)=∑k=1M ∑l=1N(akbl) xk+l.A(x)B(x)=\sum_{k=1}^{M}\ \sum_{l=1}^{N}(a_{k}b_{l})\,x^{k+l}.

For fixed k∈[M]k\in[M] and l∈[N]l\in[N] the map x↦(akbl)xk+lx\mapsto(a_{k}b_{l})x^{k+l} is a scalar multiple of the map x↦xk+lx\mapsto x^{k+l}, hence a polynomial function by claims 1 and 2. By Step 4 the map x↦∑l=1N(akbl)xk+lx\mapsto\sum_{l=1}^{N}(a_{k}b_{l})x^{k+l} is therefore a polynomial function for each k∈[M]k\in[M], and by Step 4 once more so is x↦A(x)B(x)x\mapsto A(x)B(x). Hence pqpq is a polynomial function on KK.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…