ΘρϵηΠατπ

Ideal
An ideal in a crone (R,⊕︎,) is a subset I containing 0R such that
  • a,bI implies that abI
  • aI and rR implies that raI

Note that sometimes we say it is a left ideal withen raI and a right ideal when arI

Trivial Ideal
Suppose R is a crone, then {0R} is an ideal in R
Every Crone is an Ideal
For any crone R it is an ideal in R
The Kernel of a Crone Homomorphism is a Proper Ideal
If ϕ:RS is a crone homomorphism then, then ker(ϕ) is a proper ideal in R
A Crone Homomorphism is an Injection iff ker(ϕ)={0R}
If ϕ:RS is a crone homomorphism then, ϕ is injective iff ker={0R}
Proper Ideal
We say that an ideal I in a crone R is proper when IR
An Ideal is a Normal Subgroup
The Intersection of Ideals is an Ideal
Suppose that is a family of ideals in a crone then is an ideal in R

Let a,b, then by definition a,bI for every ideal I, therefore abI for every I (because I is an ideal itself), in otherwords ab.

Now suppose that a and that rR, then we see that aI for every I so that also raI since that's for every I we can conclude that ra as needed.

Ideal Generated By a Set
Suppose that R is a crone and that XR then we define the ideal generated by X as the intersection of all ideals in R that contain X, symbolically let X be the family of all ideals that contain X, then (X):=X
Ideal Lightened Notation
We define the notation (a1,a2,,an):=({a1,a2,,an}) to lighten the notation.
Ideal Generated by a Set is an Ideal
(X) is an ideal in R
As the intersection of ideals, it is an ideal.
Ideal Generated by a Set is the Smallest Ideal Containing the Set
Suppose R is a crone and XR , then X(X) and for any other ideal J such that XJ we have (X)J

First we show that X(X), we know that if X is the family of all ideals containing X then by definition for each IX we have XI therefore XX=(X) as needed.

Now we show it's the smallest, if J is a ideal containing X then by definition JX, but then (X)=X{J}=J as needed.

Left Multiplication Yields an Ideal
Suppose that aR then R{a} is an ideal
Let ra,saR{a}, then note the following: rasaamp;=(ra)⊕︎(sa)amp;=(ra)⊕︎((1)(sa))amp;=(ra)⊕︎(sa)amp;=(rs)a Since R is a ring, then rsR which shows that rasaR{a}

Now we show the second property so let sR we must prove s(ra)R{a}, this follows quickly because of associativity of , therefore the original expression equals (sr)r and since R is closed under

Finally 0RR so that 0RaR{a} but we know that 0Ra=0R as needed.

Principal Ideal Generated by An Element
Suppose that R is a crone and that aR, then Ra is the principal ideal generated by a
Principal Ideal Equals Generated Ideal
R{a}=(a)

Firstly we know that (a):=R{a} and that R{a} is an ideal, clearly it contains a because a0R must be in it since it's an ideal.

({a}) is defined as \bigcap \mathcal{ I } _ \left\{ a \right\} ParseError: Got function '\left' with no arguments as subscript at position 25: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\} where \mathcal{ I } _ \left\{ a \right\} ParseError: Got function '\left' with no arguments as subscript at position 17: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\} is the family of all ideals in R that contain {a}. From this we can straight away see that \bigcap \mathcal{ I } _ \left\{ a \right\} \subseteq R \otimes \left\{ a \right\} ParseError: Got function '\left' with no arguments as subscript at position 25: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\} \… since R \otimes \left\{ a \right\} \in \mathcal{ I } _ \left\{ a \right\} ParseError: Got function '\left' with no arguments as subscript at position 50: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\} and the intersection can only get smaller. Thus we've just shown that ({a})(a)

We'll now prove that (a)({a}), let x(a):=R{a} thus x=ra for some rR, our goal is to show that r \otimes a \in \bigcap \mathcal{ I } _ \left\{ a \right\} ParseError: Got function '\left' with no arguments as subscript at position 41: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\} , that is we must show that raI for any I \in \bigcap \mathcal{ I } _ \left\{ a \right\} ParseError: Got function '\left' with no arguments as subscript at position 31: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\}.

Well if the above is true then I is an ideal that contains a, therefore by the second property of an ideal we can see that raI, which is what we needed to show, so we can see that x \in \bigcap \mathcal{ I } _ \left\{ a \right\} := \left( \left\{ a \right\} \right) ParseError: Got function '\left' with no arguments as subscript at position 31: …mathcal{ I } _ \̲l̲e̲f̲t̲\{ a \right\} :…. Thus we conclude that (a)=({a}) as needed.

Ideal Generated by a Finite Set is their Linear Combinations
Let A={a1,a2,an} For any n1 we have (A)={i=1nriai:riR,i[1...n]}

Note I is an ideal that contains A, this is because we can systematically set a specific ri=1 and for each ij have rj=0 which turns the sum into ai , then we know that (A)I, this is because (A) is the smallest ideal containing A

Now we'll prove that I(A) let s=i=1nriaiI, to do so we recognize that (A):=A so that we must show that sI for every IA.

This (A) is an ideal that contains A therefore note that riai is part of (A), therefore we can see that each airi(A),

Since (A) is an ideal then we know it's closed under finite addition meaning that i=1nxi(A) for any xi(A), since we know each airi(A) then by setting xi=airi we have shown that i=1nairi(A) as needed and thus I=(A)

Product of Ideals is Contained in their Intersection
Let I,J be two ideals and define their product IJ:={i=1nriaibi:aiI,biJ,riR,n1} Prove that IJIJ
Let i=1nriaibiIJ, we'll first show that this is an element of I, we first recall that both I,JR, therefore since biJ then (biR) , since we are working with a crone, then we know that riaibi=ribiai since we have commutativity, by associativity and closure of multiplication in R then ribiR therefore ribiaiI by the second property of an ideal. We can also see by the first property that each since each of the summands are elements of I so will be their finite summation. Thus i=1nriaibiI. By symmetry we can do the same thing to show that the sum is also in J, this shows that IJIJ
Can't get to All Polynomials From a Generated Ideal
Let I be the ideal in [x] generated by {2,x}, prove that I2:=II contains elements not of the form ab for a,bI
An Ideal of Continuous Functions
Let R:=C([0,1]) be the set of continuous functions f:[0,1]. For any c we define Ic:={fR:f(c)=0}
  • Show that the set R is a crone, and the set Ic is an ideal of R
  • Is Ic1Ic2 an ideal? What about Ic1Ic2?
  • Show that R/Ic Hint: consider the map ϕ(f+Ic)=f(c)

We start by showing that R is a crone, first recall that by first year calculus we know that the product and sum of two continous functions on a certain domain is still continuous on that domain, additionally we have defined (f+g)(x)=f(x)+g(x) but addition and multiplication commute in so it's easy to prove that f+g=g+f and fg=gf moreover we can also get associativity this way, all these facts together show that R is closed with respect to +, and ,+ are both associative and commutative, we also have inverses with respect to + this is because for any function f, the function, f which is defined as f(x)=(1)f(x) has the property that f+(f)=0 where on the right we have the constant function that maps everything to zero (which is the additive inverse). So it is a crone.

We need to prove that Ic is an ideal, therefore suppose that f,gIc, we want to show that fgIc, but we can see that (fg)(c):=f(c)g(c)=0, so we know that fgIc. Now let h:[0,1] be any continuous function, and suppose that kIc then (hk)(c):=h(c)k(c)=h(c)0=0, therefore hcIc as needed, so that Ic is an ideal.

We see that Ic1Ic2 is not an ideal, this is because they may vanish at different places, consider the following counter example: f,gIc1Ic2 then perhaps f(c1)=0 but f(c2)=1 and g(c1)=1 and g(c2)=0, then if we consider (fg)(c1):=f(c1)g(c1)=0+10 and then also (gf)(c1):=g(c1)f(c1)=1+00 so therefore fgIc1Ic2 so it cannot be an ideal.

We should have that Ic1Ic2 is an ideal, this is because now an element would have two vanishing points and things would fallout like in our original verification that Ic was an ideal, well anyway suppose that f,gIc1Ic2 now note that fg(c1)=0=fg(c2) because they both vanish at these points so fgIc1Ic2. Now suppose that hR and kIc1Ic2 then hk(c1)=0=hk(c2) as needed, so we've shown this is an ideal.

We need to show that R/Ic is ismorphic to , we take the hint and will do it through the function ϕ(f+Ic)=f(c). Recall that R/Ic={f+Ic:fR}={{f+g:gIc}:fR}. For two crones to be ismorophic it means that they form a crone homomorphism which is a bijection, so we have to verify a few things ϕ((f+Ic)+(g+Ic))=ϕ((f+g)+Ic)=(f+g)(c)=f(c)+g(c)=ϕ(f+Ic)+ϕ(g+Ic) and also ϕ((f+Ic)(g+Ic))=ϕ((fg)+Ic)=f(c)g(c)=ϕ(f+Ic)ϕ(g+Ic) and suppose that 1 is the constant function that sends every value to one, then ϕ(1+Ic)=1(c)=1 therefore ϕ is a crone homomorphism, now we want to prove that it is bijective, let r, then there is a constant function 𝐫, so that ϕ(𝐫+Ic)= 𝐫 (c)=r, so we've shown that ϕ is surjective, now suppose that ab, then if we have ϕ(j+Ic)=a and ϕ(i+Ic)=b, we'd like to prove that j+Ici+Ic, we can easily show that j+Ici+In=, for this suppose that mj+Ic so that m=j+p where pIc, then note that m(c)=j(c)=a, if m were to also be in i+Ic that would mean that m=i+q for some qIc therefore m(c)=i(c)=b which is a contradiction because ab, so we've just shown that i+Icj+Ic so that ϕ is a bijection, therefore it is an isomorphism.

Quotient Remainder For Polynomials
Suppose that R is a domain, and that f(x),g(x)R[x], then there exists unique polynomials q(x),r(x)R[x] such that f(x)=q(x)g(x)+r(x) where either r(x)=0R or deg(r)deg(g)