Jump to content

User:Zelmerszoetrop/Test1: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Line 115: Line 115:


Since <math>ax,bx\not\in\text{ker}(\phi) \ </math>, we must have <math>y,z \ </math> as zero divisors in <math>\mathbb{C} \ </math>. But <math>\mathbb{C} \ </math> has no zero divisors, and so no such homomorphism <math>\phi \ </math> exists. Hence, <math>A \not \cong E \ </math>.
Since <math>ax,bx\not\in\text{ker}(\phi) \ </math>, we must have <math>y,z \ </math> as zero divisors in <math>\mathbb{C} \ </math>. But <math>\mathbb{C} \ </math> has no zero divisors, and so no such homomorphism <math>\phi \ </math> exists. Hence, <math>A \not \cong E \ </math>.






Line 121: Line 123:





For <math>A \ </math> and <math>B \ </math>, consider the map <math>\phi:\mathbb{C}[x]\to \mathbb{C}[x] \ </math> defined <math>\phi\left({\Sigma_{k=1}^n a_kx^k }\right) \mapsto \Sigma_{k=1}^n a_k(x-1)^k \ </math>. This map is clearly an automorphism of <math>\mathbb{C}[x] \ </math> sending <math>(x^2)\mapsto ((x-1)^2). Let <math>\pi \ </math> be the canonical homomorphism <math>\pi:\mathbb{C}[x]\to\mathbb{C}[x]/((x-1)^2) \ </math>.


For <math>A \ </math> and <math>B \ </math>, consider the map <math>\phi:\mathbb{C}[x]\to \mathbb{C}[x] \ </math> defined <math>\phi\left({\Sigma_{k=1}^n a_kx^k }\right) \mapsto \Sigma_{k=1}^n a_k(x-1)^k \ </math>.

This map is clearly an automorphism of <math>\mathbb{C}[x] \ </math> sending <math>(x^2)\mapsto ((x-1)^2)</math>. Let <math>\pi \ </math> be the canonical homomorphism <math>\pi:\mathbb{C}[x]\to\mathbb{C}[x]/((x-1)^2) \ </math>.


Observe that <math>\text{ker}(\pi) = ((x-1)^2) \implies \text{ker}(\pi\circ f) = (x^2) \ </math>. Since <math>\pi \circ f:\mathbb{C}[x] \to \mathbb{C}[x]/((x-1)^2) \ </math> is a homomorphism with kernel <math>(x^2) \ </math>, we must have
Observe that <math>\text{ker}(\pi) = ((x-1)^2) \implies \text{ker}(\pi\circ f) = (x^2) \ </math>. Since <math>\pi \circ f:\mathbb{C}[x] \to \mathbb{C}[x]/((x-1)^2) \ </math> is a homomorphism with kernel <math>(x^2) \ </math>, we must have

Revision as of 21:24, 7 November 2010

1.1) Define . We are asked whether . Observe that since is not a subset of it cannot possibly be a subgroup of . However, if what is meant is "Is a subgroup of ," then the answer is yes, because it

a) contains the identity ,
b) is closed under multiplication: , and
C) contains inverses: .

1.2) We are asked if is cyclic. Again, since is not a subset of , it cannot possibly be a cyclic subgroup of . If what is meant is "Is a cyclic subgroup of ," the answer is still no. Suppose is not cyclic. Observe that the map defined is an isomorphism, since it is necessarily bijective, and satisfies . Then is not cyclic.


1.3, 1.4, 1.5) Observe that for all , we have . If is commutative, then this is just . So, commutative .

Now suppose . Then . In particular, and for all . But this is just

and .

or

.

Hence G is commutative, so is commutative.

Therefore, is commutative.



2.1) We are asked if every nontrivial group contains a non-trivial proper subgroup . This is false. Consider the group . By Lagrange's theorem, a subgroup of this must have order either 1 or 3. But this means a subgroup must be either trivial, or the group itself, ie, not proper.


2.2) We are asked if every nontrivial group contains a normal nontrivial proper subgroup . This is false. See problem 1.


2.3) We are asked if every group can be embedded in a larger group such that is normal in . This is true. Let be any group with operation and identity , and define the set and the operation as

Observe that is necessarily closed under , since is closed under and is closed under .

Furthermore, since both these operations are associative, is as well.

We certainly have an identity, namely : observe , and inverses defined :

.

Hence, is a group.

Define the map as . Observe that

,

and so is a homomorphism. Now suppose . Then , and so is an injective homomorphism, with and .

Let be any element. Observe that for any element , we have

.

Hence, .



3) Let be commutative rings with identity, a ring homomorphism, and an ideal in . We aim to show there is a unique ring homomorphism such that , where is the canonical homomorphism defined .

We construct the commutative diagram

400x160

This suggests the definition . Note that if this is a well-defined homomorphism, then we automatically have .

Let be any element. We can write this as . Then , and so this is a well-defined function. Furthermore, we have

,

since is a homomorphism, and

,

again, since is a homomorphism. Therefore, is a well-defined ring homomorphism.

Now suppose is any ring homomorphism and that satisfies .

Then . So such is unique.

workspace

4) We are asked to determine which rings are isomorphic:

,

,

,

,

.


We show that is not ring isomorphic to using a proof by contradiction. Suppose these two rings are isomorphic. Then there is a ring homomorphism such that .

Observe that since is a homomorphism, we must also have

.

Therefore, either or is a zero divisor. Since , the first possibility contradicts our requirement that .

The only zero divisors in are of the forms , so we must have for some .

But we may also observe that which must also be a zero divisor. Since zero divisors in can satisfy , which is not a zero divisor, we can say that either or . Without loss of generality, we can assume the first case is true.

Since , and since is a homomorphism, observe that

.

Since , we must have as zero divisors in . But has no zero divisors, and so no such homomorphism exists. Hence, .



Observe that the ring has dimension 3 as a vector space. Since has dimension 2 as a vector space, they cannot be isomorphic as vector spaces, and so they cannot be isomorphic as rings.



For and , consider the map defined .

This map is clearly an automorphism of sending . Let be the canonical homomorphism .

Observe that . Since is a homomorphism with kernel , we must have

.

So .

end workspace

6.1) Let be a finite field of characteristic and define the map as . We are given that this is a homomorphism; we aim to show that this is an automorphism.

To show that is an automorphism, it suffices to show that it is a bijection from .

Injection:

Suppose and . We aim to show that , meaning is an injection. Our assumption means . By multiplying both sides by , we have , which we can rewrite as . Raising both sides to the power, we have , but since , this is just . Since is a multiplicative inverse of both , and since multiplicative inverses are unique, we must have . Hence is an injection.

Surjection:

Let be any element. We aim to show . This would demonstrate is a surjection.

Since is an injection, we can be sure that .

This means that , because , which we know to be false. But then since is finite, . Hence is a surjection.


6.2) Note that the surjective proof in 6.1 fails if , because then . We can find a specific counterexample in , the field of fractions of , where is a finite field of characteristic .

Observe that since is a field, is an integral domain, and so by Theorem 15, pg 261 of Dummit and Foote, is a field.

Further observe that , so .

Observe that if is an irreducible polynomial in , then the statement "" is equivalent to saying ," since in lowest terms implies is in lowest terms. Since we have assumed is irreducible, this is a contradiction, and hence cannot have a pre-image in .