TheoremBase

Proof of Properties of Natural Number Powers in a Field

lemmalem:natural-power-properties-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Proof of the properties of natural number powers, by specialising the properties of finite products to constant families.

Proof

By Natural Number Power of an Element of a Field, cnc^{n} is the finite product ∏k=1nak\prod_{k=1}^{n}a_{k} of the map aa on the initial segment [n][n] whose value at every index is cc; write bb and ee for the corresponding constant maps with values dd and c dc\,d. All references to numbered claims below are to Properties of Finite Products.

Claim 1. Both identities are claim 1, since the constant map on [S(n)][S(n)] with value cc restricts to the constant map on [n][n] with value cc, so that ∏k=1n\prod_{k=1}^{n} may be read for either family.

Claim 2. We argue by induction on nn, using the induction principle for the natural numbers. By claim 1, 11=11^{1}=1. If 1n=11^{n}=1, then 1S(n)=1nβ‹…1=1β‹…1=11^{S(n)}=1^{n}\cdot1=1\cdot1=1 by claim 1 and the defining property of the multiplicative identity.

Claim 3. For every k∈[n]k\in[n] we have ek=c d=ak bke_{k}=c\,d=a_{k}\,b_{k}, so claim 2 gives

(c d)n=∏k=1n(akbk)=(∏k=1nak)(∏k=1nbk)=cn dn.(c\,d)^{n}=\prod_{k=1}^{n}\bigl(a_{k}b_{k}\bigr)=\Bigl(\prod_{k=1}^{n}a_{k}\Bigr)\Bigl(\prod_{k=1}^{n}b_{k}\Bigr)=c^{n}\,d^{n}.

Claim 4. By claim 4, ∏k=1nak=0\prod_{k=1}^{n}a_{k}=0 holds if and only if ai=0a_{i}=0 for some i∈[n]i\in[n]. Every value of aa is cc, and [n][n] is nonempty since 1∈[n]1\in[n], so this condition holds if and only if c=0c=0.

Claim 5. Since 0≀ak0\le a_{k} for every k∈[n]k\in[n], the first part of claim 5 gives 0β‰€βˆk=1nak=cn0\le\prod_{k=1}^{n}a_{k}=c^{n}. If in addition c≀dc\le d, then ak≀bka_{k}\le b_{k} for every k∈[n]k\in[n], so the second part of claim 5 gives cn=∏k=1nakβ‰€βˆk=1nbk=dnc^{n}=\prod_{k=1}^{n}a_{k}\le\prod_{k=1}^{n}b_{k}=d^{n}.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…