Polynomial u-ring
From Maths
Revision as of 00:23, 20 November 2016 by Alec (Talk | contribs) (Created page with "{{Stub page|grade=A|msg=Not my strong suit but I've done the proofs for this}} __TOC__ ==Definition== Let {{M|R}} be a u-ring with the standard operations of {{M|+}} and {...")
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Not my strong suit but I've done the proofs for this
Contents
Definition
Let [ilmath]R[/ilmath] be a u-ring with the standard operations of [ilmath]+[/ilmath] and [ilmath]*[/ilmath]. The set (or further-more: u-ring) of polynomials over [ilmath]R[/ilmath] (in the indeterminate [ilmath]X[/ilmath]), denoted universally as [ilmath]R[X][/ilmath], is defined as follows[1]:
- Let [ilmath]M:\eq\{e,X,X^2,X^3,\ldots,X^n,\ldots\} [/ilmath] be the free monoid generated by [ilmath]\{X\} [/ilmath].
- A polynomial, [ilmath]P\in R[X][/ilmath], over [ilmath]R[/ilmath] is a mapping: [ilmath]P:M\rightarrow R[/ilmath] by [ilmath]P:X^n\rightarrow a_n[/ilmath] such that [ilmath]\vert\{a_n\in P(M)\ \vert\ a_n\neq 0\}\vert\in\mathbb{N} [/ilmath][Note 1]
- The set of such polynomials is [ilmath]R[X][/ilmath] - the set of all polynomials over [ilmath]R[/ilmath]
Conventions
- It is normal to identify [ilmath]r\in R[/ilmath] with the constant polynomial[1]: [ilmath]a_n:\eq\left\{\begin{array}{lr}0 & \text{if }n>0\\r&\text{otherwise}\end{array}\right.[/ilmath], which we can write more simply as [ilmath]r[/ilmath]
- Later we shall write this as [ilmath]r+0X+0X^2+\cdots 0X^n+\cdots[/ilmath] or more simply: [ilmath]r[/ilmath] (hence the "naturalness" of the identification)
- It is also normal to identify [ilmath]X[/ilmath] with the polynomial [ilmath]a_n:\eq\left\{\begin{array}{lr}0 & \text{if }n\neq 1\\1&\text{otherwise}\end{array}\right.[/ilmath]
- Later we shall write this as [ilmath]0+1X+0X^2+\cdots+0X^n+\cdots[/ilmath] or simply [ilmath]X[/ilmath] (hence the "naturalness" of the identification)
Notations
Claim 1: we may write [ilmath]P\in R[X][/ilmath] as:
- A summation: [ilmath]\sum_{n\in\mathbb{N} }a_nX^n[/ilmath] or more commonly: [ilmath]\sum^\infty_{n\eq 0}a_nX^n[/ilmath]; or
- [ilmath]P:\eq a_0+a_1X+a_2X^2+\cdots+a_nX^n[/ilmath] for some [ilmath]n\in\mathbb{N} [/ilmath].
- Such an [ilmath]n[/ilmath] is actually called the degree of the polynomial Caveat:and can be defined only by convention if [ilmath]P[/ilmath] is the zero polynomial
U-ring operations
Claim 2: [ilmath]R[X][/ilmath] is a u-ring itself. The operations are:
- [ilmath]P+Q[/ilmath]
- [ilmath]PQ[/ilmath]
Grade: B
This page requires some work to be carried out
Some aspect of this page is incomplete and work is required to finish it
The message provided is:
Warning:That grade doesn't exist!
The message provided is:
The terms are:
- [ilmath](P+Q)_n\eq (P)_n+(Q)_n[/ilmath] and
- [ilmath](PQ)_n\eq \sum_{i+j\eq n}(P)_i(Q)_j[/ilmath] - meaning the sum over terms whose indices add to [ilmath]n[/ilmath]
Warning:That grade doesn't exist!
Identity (of the abelian additive group) and unity of the ring:
- The zero polynomial: [ilmath]0+0X+0X^2+\cdots+0X^n+\cdots[/ilmath] which by the notation section we can simply write as: [ilmath]0[/ilmath]
- The unity of the ring is the polynomial [ilmath]1[/ilmath], (the thing we identify the unity of [ilmath]R[/ilmath] to).
- More explicitly, the polynomial: [ilmath]1+0X+0X^2+\cdots+0X^n+\cdots[/ilmath]
Proof of claims
Grade: D
This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:
The message provided is:
Done on paper
See also
Notes
- ↑ This may be said as:
- [ilmath]a_n\eq 0[/ilmath] for almost all [ilmath]n\in\mathbb{N}_0[/ilmath] (as per one of the references - Abstract Algebra: Grillet),
- [ilmath]a_n\eq 0[/ilmath] almost always, or
- [ilmath]\vert\{a_n\in P(M)\ \vert\ a_n\eq 0\}\vert\eq\aleph_0[/ilmath]
- But this requires a few things: the cardinality of the free monoid generated by a single object is countable and finitely many elements removed from a countable set remains countable