Exercise1
Suppose that
Describe each of the following sets.
(a) (b)
Important: to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the "Run" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard.
ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand
Suppose that
Describe each of the following sets.
(a) (b)
If and list all of the elements in each of the following sets.
(a) (d)
Prove
If then either or Thus, and Hence, Therefore, Conversely, if then and Thus, or is in both and So and therefore Hence,
Prove
Prove
Which of the following relations define a mapping? In each case, supply a reason why is or is not a mapping.
(a) Not a map since is undefined; (b) this is a map; (c) not a map, since but (d) this is a map.
Determine which of the following functions are one-to-one and which are onto. If the function is not onto, determine its range.
defined by
defined by
defined by
defined by
(a) is one-to-one but not onto. (c) is neither one-to-one nor onto.
Define a function that is one-to-one but not onto.
Define a function that is onto but not one-to-one.
(a)
Let and be maps.
If and are both one-to-one functions, show that is one-to-one.
If is onto, show that is onto.
If is one-to-one, show that is one-to-one.
If is one-to-one and is onto, show that is one-to-one.
If is onto and is one-to-one, show that is onto.
(a) Let Then Thus, and so is one-to-one. (b) Let then for some Since is onto.
Define a function on the real numbers by
What are the domain and range of What is the inverse of Compute and
Let be a map with and
Prove
Prove Give an example in which equality fails.
Prove where
Prove
Prove
(a) Let Then there exists an such that Hence, or Therefore, Consequently, Conversely, if then or Hence, there exists an in or such that Thus, there exists an such that Therefore, and
Determine whether or not the following relations are equivalence relations on the given set. If the relation is an equivalence relation, describe the partition given by it. If the relation is not an equivalence relation, state why it fails to be one.
in if
in if
in if
in if
(a) The relation fails to be symmetric. (b) The relation is not reflexive, since 0 is not equivalent to itself. (c) The relation is not transitive.
Find the error in the following argument by providing a counterexample. “The reflexive property is redundant in the axioms for an equivalence relation. If then by the symmetric property. Using the transitive property, we can deduce that ”
Let and define if
Prove that
for
The base case, is true. Assume that is true. Then
and so is true. Thus, is true for all positive integers
Prove that for
The base case, is true. Assume is true. Then so is true. Thus, is true for all positive integers
Prove the Leibniz rule for where is the th derivative of that is, show that
If is a nonnegative real number, then show that for
The base case, is true. Assume is true. Then
so is true. Therefore, is true for all positive integers
The Fibonacci numbers are
We can define them inductively by and for
Prove that
Prove that
Prove that
Show that
Prove that and are relatively prime.
Let be relatively prime. If is a perfect square, prove that and must both be perfect squares.
Use the Fundamental Theorem of Arithmetic.
Define the of two nonzero integers and denoted by to be the nonnegative integer such that both and divide and if and divide any other integer then also divides Prove there exists a unique least common multiple for any two integers and
Use the Principle of Well-Ordering and the division algorithm.
Let Prove that if and then
Since there exist integers and such that Thus,
Prove that there are an infinite number of primes of the form
Every prime must be of the form 2, 3, or Suppose there are only finitely many primes of the form
Find all satisfying each of the following equations.
(a) (c) (e)
Which of the following multiplication tables defined on the set form a group? Support your answer in each case.
(a) Not a group; (c) a group.
Give a multiplication table for the group
Give an example of two elements and in with
Pick two matrices. Almost any pair will work.
Prove or disprove that every group containing six elements is abelian.
There is a nonabelian group containing six elements.
Give a specific example of some group and elements where
Look at the symmetry group of an equilateral triangle or a square.
Give an example of three different groups with eight elements. Why are the groups different?
The are five different groups of order 8.
Show that there are permutations of a set containing items.
Let
be in All of the s must be distinct. There are ways to choose ways to choose 2 ways to choose and only one way to choose Therefore, we can form in ways.
Let and be elements in a group Prove that for
Show that if for all elements in a group then must be abelian.
Since we know that
Find all the subgroups of the symmetry group of an equilateral triangle.
Prove that
is a subgroup of under the group operation of multiplication.
The identity of is Since is closed under multiplication. Finally,
Prove or disprove: If and are subgroups of a group then is a subgroup of
Look at
Let and be elements of a group If and prove that
Prove or disprove each of the following statements.
All of the generators of are prime.
is cyclic.
is cyclic.
If every proper subgroup of a group is cyclic, then is a cyclic group.
A group with a finite number of subgroups is finite.
(a) False; (c) false; (e) true.
Find the order of each of the following elements.
72 in
312 in
(a) 12; (c) infinite; (e) 10.
List all of the elements in each of the following subgroups.
The subgroup of generated by 7
The subgroup of generated by 15
All subgroups of
All subgroups of
All subgroups of
All subgroups of
The subgroup generated by 3 in
The subgroup generated by 5 in
The subgroup of generated by 7
The subgroup of generated by where
The subgroup of generated by
The subgroup of generated by
The subgroup of generated by
(a) (b) (c) (g) (j)
Find the subgroups of generated by each of the following matrices.
(a)
(c)
Find all elements of finite order in each of the following groups. Here the “” indicates the set with zero removed.
(a) (b)
If in a group what are the possible orders of
1, 2, 3, 4, 6, 8, 12, 24.
Evaluate each of the following.
(a) (c) (e)
Convert the following complex numbers to the form
(a) (c)
Change the following complex numbers to polar representation.
(a) (c) (e)
Calculate each of the following expressions.
(a) (c) (e)
Calculate each of the following.
(a) 292; (c) 1523.
If and have orders 15 and 16 respectively in a group what is the order of
Let be an abelian group. Show that the elements of finite order in form a subgroup. This subgroup is called the of
The identity element in any group has finite order. Let have orders and respectively. Since and the elements of finite order in form a subgroup of
Prove that if has no proper nontrivial subgroups, then is a cyclic group.
If is an element distinct from the identity in must generate otherwise, is a nontrivial proper subgroup of
Write the following permutations in cycle notation.
(a) (c)
Compute each of the following.
(a) (c) (e) (g) (n)
Express the following permutations as products of transpositions and identify them as even or odd.
(a) (c)
Find
List all of the subgroups of Find each of the following sets.
and
Are any of these sets subgroups of
(a) is not a subgroup.
Show that contains an element of order 15.
What are the possible cycle structures of elements of What about
Permutations of the form
are possible for
Prove that is nonabelian for
Calculate and
Prove that in with any permutation is a product of cycles of length 3.
Consider the cases and
Let be a cycle of length
Prove that if is any permutation, then
is a cycle of length
Let be a cycle of length Prove that there is a permutation such that
For (a), show that
Suppose that is a finite group with an element of order 5 and an element of order 7. Why must
The order of and the order must both divide the order of
Suppose that is a finite group with 60 elements. What are the orders of possible subgroups of
The possible orders must divide 60.
Prove or disprove: Every subgroup of the integers has finite index.
This is true for every proper nontrivial subgroup.
Prove or disprove: Every subgroup of the integers has finite order.
False.
List the left and right cosets of the subgroups in each of the following.
in
in
in
in
in
in
in
in
(a) and (c) and
Verify Euler's Theorem for and
If for all and show that right cosets are identical to left cosets. That is, show that for all
Let Show that and thus
Let and be subgroups of a group Prove that is a coset of in
Show that
Let where are distinct primes. Prove that
Encode IXLOVEXMATH
using the cryptosystem in Example 1.
LAORYHAPDWK
Assuming that monoalphabetic code was used to encode the following secret message, what was the original message?
APHUO EGEHP PEXOV FKEUH CKVUE CHKVE APHUO EGEHU EXOVL EXDKT VGEFT EHFKE UHCKF TZEXO VEZDT TVKUE XOVKV ENOHK ZFTEH TEHKQ LEROF PVEHP PEXOV ERYKP GERYT GVKEG XDRTE RGAGA
What is the significance of this message in the history of cryptography?
Hint: V = E
, E = X
(also used for spaces and punctuation), K = R
.
What is the total number of possible monoalphabetic cryptosystems? How secure are such cryptosystems?
Encrypt each of the following RSA messages so that is divided into blocks of integers of length 2; that is, if encode 14, 25, and 28 separately.
(a) 2791; (c) 112135 25032 442.
Decrypt each of the following RSA messages
(a) 31; (c) 14.
For each of the following encryption keys in the RSA cryptosystem, compute
(a) (c)
Without doing any addition, explain why the following set of 4-tuples in cannot be a group code.
This cannot be a group code since
Compute the Hamming distances between the following pairs of -tuples.
(a) 2; (c) 2.
Compute the weights of the following -tuples.
(a) 3; (c) 4.
In each of the following codes, what is the minimum distance for the code? What is the best situation we might hope for in connection with error detection and error correction?
\;
\;
(a) (c)
Compute the null space of each of the following matrices. What type of -block codes are the null spaces? Can you find a matrix (not necessarily a standard generator matrix) that generates each code? Are your generator matrices unique?
Let be the code obtained from the null space of the matrix
Decode the message
if possible.
Multiple errors occur in one of the received words.
Which matrices are canonical parity-check matrices? For those matrices that are canonical parity-check matrices, what are the corresponding standard generator matrices? What are the error-detection and error-correction capabilities of the code generated by each of these matrices?
(a) A canonical parity-check matrix with standard generator matrix
(c) A canonical parity-check matrix with standard generator matrix
List all possible syndromes for the codes generated by each of the matrices in Exercise 8.5.11.
(a) All possible syndromes occur.
For each of the following matrices, find the cosets of the corresponding code Give a decoding table for each code if possible.
(a) A decoding table does not exist for since this is only a single error-detecting code.
Let be a linear code. Show that either every codeword has even weight or exactly half of the codewords have even weight.
Let have odd weight and define a map from the set of odd codewords to the set of even codewords by Show that this map is a bijection.
How many check positions are needed for a single error-correcting code with 20 information positions? With 32 information positions?
For 20 information positions, at least 6 check bits are needed to ensure an error-correcting code.
Prove that for
Prove that is isomorphic to the subgroup of consisting of matrices of the form
Define by
Prove or disprove:
False.
Show that the th roots of unity are isomorphic to
Define a map from into the th roots of unity by
Prove that is not isomorphic to
Assume that is cyclic and try to find a generator.
Find five non-isomorphic groups of order 8.
There are two nonabelian and three abelian groups that are not isomorphic.
Find the order of each of the following elements.
in
in
in
in
(a) 12; (c) 5.
Prove that is isomorphic to Can you make a conjecture about Prove your conjecture.
Draw the picture.
Prove or disprove: Every abelian group of order divisible by 3 contains a subgroup of order 3.
True.
Prove or disprove: There is a noncyclic abelian group of order 52.
True.
Let Show that if is cyclic, then so is
Let be a generator for If is an isomorphism, show that is a generator for
Find
Any automorphism of must send 1 to another generator of
Let be the internal direct product of subgroups and Show that the map defined by for where and is one-to-one and onto.
To show that is one-to-one, let and and consider
For each of the following groups determine whether is a normal subgroup of If is a normal subgroup, write out a Cayley table for the factor group
and
and
and
and
and
(a)
(c) is not normal in
If is cyclic, prove that must also be cyclic.
If is a generator for then is a generator for
If a group has exactly one subgroup of order prove that is normal in
For any show that the map defined by is an isomorphism of with itself. Then consider
Define the of an element in a group to be the set
Show that is a subgroup of If generates a normal subgroup of prove that is normal in
Suppose that is normal in and let be an arbitrary element of If we must show that is also in Show that
Let be a group and let that is, is the subgroup of all finite products of elements in of the form The subgroup is called the of
Show that is a normal subgroup of
Let be a normal subgroup of Prove that is abelian if and only if contains the commutator subgroup of
(a) Let and If then
We also need to show that if with then is a product of elements of the same type. However,
Which of the following maps are homomorphisms? If the map is a homomorphism, what is the kernel?
defined by
defined by
defined by
defined by
defined by
where is the additive group of matrices with entries in
(a) is a homomorphism with kernel (c) is not a homomorphism.
Let be given by Prove that is a group homomorphism. Find the kernel and the image of
Since is a homomorphism.
Describe all of the homomorphisms from to
For any homomorphism the kernel of must be a subgroup of and the image of must be a subgroup of Now use the fact that a generator must map to a generator.
If is a group homomorphism and is abelian, prove that is also abelian.
Let Then
Let be a surjective group homomorphism. Let be a normal subgroup of and suppose that Prove or disprove that
Find a counterexample.
Prove the identity
Prove that the following matrices are orthogonal. Are any of these matrices in
(a) is in (c) is not in
Let and be vectors in and Prove each of the following properties of inner products.
with equality exactly when
If for all in then
(a)
Prove that and are bases for the same lattice.
Use the unimodular matrix
Prove that is a normal subgroup of
Show that the kernel of the map is
Prove or disprove: There exists an infinite abelian subgroup of
True.
Determine which of the 17 wallpaper groups preserves the symmetry of the pattern in Figure 12.26.
Find all of the abelian groups of order less than or equal to 40 up to isomorphism.
There are three possible groups.
Find all of the composition series for each of the following groups.
The quaternions,
(a) (e)
A group is a if every element of has finite order. Prove that a finitely generated abelian torsion group must be finite.
Use the Fundamental Theorem of Finitely Generated Abelian Groups.
Let be a normal subgroup of If and are solvable groups, show that is also a solvable group.
If and are solvable, then they have solvable series
Prove that is solvable for all integers
Use the fact that has a cyclic subgroup of index 2.
Suppose that is a solvable group with order Show that contains a normal nontrivial abelian factor group.
is abelian.
Examples 14.1–14.5 in the first section each describe an action of a group on a set which will give rise to the equivalence relation defined by -equivalence. For each example, compute the equivalence classes of the equivalence relation, the -.
Compute all and all for each of the following permutation groups.
(a)
Compute the -equivalence classes of for each of the -sets in Exercise 14.4.2. For each verify that
(a)
Find the conjugacy classes and the class equation for each of the following groups.
The conjugacy classes for are
The class equation is
If a square remains fixed in the plane, how many different ways can the corners of the square be colored if three colors are used?
Up to a rotation, how many ways can the faces of a cube be colored with three different colors?
The group of rigid motions of the cube can be described by the allowable permutations of the six faces and is isomorphic to There are the identity cycle, 6 permutations with the structure that correspond to the quarter turns, 3 permutations with the structure that correspond to the half turns, 6 permutations with the structure that correspond to rotating the cube about the centers of opposite edges, and 8 permutations with the structure that correspond to rotating the cube about opposite vertices.
Suppose that the vertices of a regular hexagon are to be colored either red or white. How many ways can this be done up to a symmetry of the hexagon?
How many equivalence classes of switching functions are there if the input variables and can be permuted by any permutation in What if the input variables and can be permuted by any permutation in
Let Show that for any
Use the fact that if and only if
What are the orders of all Sylow -subgroups where has order 18, 24, 54, 72, and 80?
If then the order of a Sylow 2-subgroup is 2, and the order of a Sylow 3-subgroup is 9.
Find all the Sylow 3-subgroups of and show that they are all conjugate.
The four Sylow 3-subgroups of are
Prove that no group of order 96 is simple.
Since has either one or three Sylow 2-subgroups by the Third Sylow Theorem. If there is only one subgroup, we are done. If there are three Sylow 2-subgroups, let and be two of them. Therefore, otherwise, would have elements, which is impossible. Thus, is normal in both and since it has index 2 in both groups.
Let be a group of order where and are distinct primes such that and Prove that must be abelian. Find a pair of primes for which this is true.
Show that has a normal Sylow -subgroup of order and a normal Sylow -subgroup of order
Let be a subgroup of a group Prove or disprove that the normalizer of is normal in
False.
Show that every group of order is cyclic.
Prove that the number of distinct conjugates of a subgroup of a finite group is
Define a mapping between the right cosets of in and the conjugates of in by Prove that this map is a bijection.
Let be a group. Prove that is a normal subgroup of and is abelian. Find an example to show that is not necessarily a group.
Let Then
Which of the following sets are rings with respect to the usual operations of addition and multiplication? If the set is a ring, is it also a field?
(a) is a ring but not a field; (c) is a field; (f) is not a ring.
List or characterize all of the units in each of the following rings.
the matrices with entries in
the matrices with entries in
(a) (c) (e)
Find all of the ideals in each of the following rings. Which of these ideals are maximal and which are prime?
the matrices with entries in
the matrices with entries in
(a) (c) there are no nontrivial ideals.
Prove that is not isomorphic to
Assume there is an isomorphism with
Prove or disprove: The ring is isomorphic to the ring
False. Assume there is an isomorphism such that
Solve each of the following systems of congruences.
(a) (c)
If is a field, show that the only two ideals of are and itself.
If show that
Let be a ring homomorphism. Prove each of the following statements.
If is a commutative ring, then is a commutative ring.
Let and be the identities for and respectively. If is onto, then
If is a field and then is a field.
(a)
Let be an integral domain. Show that if the only ideals in are and itself, must be a field.
Let with Then the principal ideal generated by is Thus, there exists a such that
A ring is a if for every Show that every Boolean ring is a commutative ring.
Compute and
Let be prime. Prove that
is a ring. The ring is called the
Let Then and are both in since
An element in a ring is called an if Prove that the only idempotents in an integral domain are and Find a ring with a idempotent not equal to 0 or 1.
Suppose that and Since is an integral domain, To find a nontrivial idempotent, look in
Compute each of the following.
in
in
in
in
in
in
(a) (b)
Use the division algorithm to find and such that with for each of the following pairs of polynomials.
and in
and in
and in
and in
(a) (c)
Find all of the zeros for each of the following polynomials.
in
in
in
in
(a) No zeros in (c) 3, 4.
Find a unit in such that
Look at
Which of the following polynomials are irreducible over
(a) Reducible; (c) irreducible.
Give two different factorizations of in
One factorization is
Show that the division algorithm does not hold for Why does it fail?
The integers do not form a field.
Prove or disprove: is irreducible for any where is prime.
False.
Suppose that and are isomorphic rings. Prove that
Let be an isomorphism. Define by
The polynomial
is called the Show that is irreducible over for any prime
The polynomial
is called the Show that is irreducible over for any prime
Let be a field. Show that is never a field.
Find a nontrivial proper ideal in
Let be in If show that must be a unit. Show that the only units of are 1 and
Note that is in if and only if The only integer solutions to the equation are
The Gaussian integers, are a UFD. Factor each of the following elements in into a product of irreducibles.
5
2
(a) (c)
Prove or disprove: Any subring of a field containing 1 is an integral domain.
True.
Prove that the field of fractions of the Gaussian integers, is
Let and be in Prove that
Let be a Euclidean domain with Euclidean valuation If and are associates in prove that
Let with a unit. Then Similarly,
Show that is not a unique factorization domain.
Show that 21 can be factored in two different ways.
Draw the diagram for the set of positive integers that are divisors of 30. Is this poset a Boolean algebra?
Prove or disprove: is a poset under the relation if
False.
Draw the switching circuit for each of the following Boolean expressions.
(a)
(c)
Prove or disprove that the two circuits shown are equivalent.
Not equivalent.
For each of the following circuits, write a Boolean expression. If the circuit can be replaced by one with fewer switches, give the Boolean expression and draw a diagram for the new circuit.
(a)
Let be a ring and suppose that is the set of ideals of Show that is a poset ordered by set-theoretic inclusion, Define the meet of two ideals and in by and the join of and by Prove that the set of ideals of is a lattice under these operations.
Let be ideals in We need to show that is the smallest ideal in containing both and If and then is in For hence, is an ideal in
Let be a poset such that for every and in either or Then is said to be a .
Is a total order on
Prove that and are totally ordered sets under the usual ordering
(a) No.
Let be a Boolean algebra. Prove that if and only if for
A symmetric argument shows that
Let be the field generated by elements of the form where are in Prove that is a vector space of dimension 4 over Find a basis for
has basis over
Prove that the set of all polynomials of degree less than form a subspace of the vector space Find a basis for and compute the dimension of
The set is a basis for
Which of the following sets are subspaces of If the set is indeed a subspace, find a basis for the subspace and compute its dimension.
(a) Subspace of dimension 2 with basis (d) not a subspace
Let be a vector space over Prove that for all and all
Since it follows that
Prove that any set of vectors containing is linearly dependent.
Let and Then
Let and be vector spaces over a field of dimensions and respectively. If is a map satisfying
for all and all then is called a from into
Prove that the of is a subspace of The kernel of is sometimes called the of
Prove that the or of is a subspace of
Show that is injective if and only if
Let be a basis for the null space of We can extend this basis to be a basis of Why? Prove that is a basis for the range of Conclude that the range of has dimension
Let Show that a linear transformation is injective if and only if it is surjective.
(a) Let and Then
Hence, and is a subspace of
(c) The statement that is equivalent to which is true if and only if or
Let and be subspaces of a vector space The sum of and denoted is defined to be the set of all vectors of the form where and
Prove that and are subspaces of
If and then is said to be the In this case, we write Show that every element can be written uniquely as where and
Let be a subspace of dimension of a vector space of dimension Prove that there exists a subspace of dimension such that Is the subspace unique?
If and are arbitrary subspaces of a vector space show that
(a) Let and Then
Show that each of the following numbers is algebraic over by finding the minimal polynomial of the number over
for with
(a) (c)
Find a basis for each of the following field extensions. What is the degree of each extension?
over
over
over
over
ParseError: KaTeX parse error: Undefined control sequence: \root at position 24: … Q}( \sqrt{2}, \̲r̲o̲o̲t̲ ̲3 \of{2}\, ) over
over
over
over
over
(a) (c) (e)
Find the splitting field for each of the following polynomials.
over
over
over
over
(a)
Show that is a field with eight elements. Construct a multiplication table for the multiplicative group of the field.
Use the fact that the elements of are 0, 1, and the fact that
Can a cube be constructed with three times the volume of a given cube?
False.
Let be an algebraic extension of and an algebraic extension of Prove that is algebraic over [Caution: Do not assume that the extensions are finite.]
Suppose that is algebraic over and is algebraic over Let It suffices to show that is algebraic over some finite extension of Since is algebraic over it must be the zero of some polynomial in Hence is algebraic over
Show that Extend your proof to show that where
Since is a basis for over Since or 4. Since the degree of the minimal polynomial of is 4,
Let be an extension field of and be transcendental over Prove that every element in that is not in is also transcendental over
Let not in Then where and are polynomials in with and coefficients in If is algebraic over then there exists a polynomial such that Let Then
Now multiply both sides by to show that there is a polynomial in that has as a zero.
Let be a root of an irreducible monic polynomial with Prove that
Calculate each of the following.
Make sure that you have a field extension.
Let be a zero of over Construct a finite field of order 8. Show that splits in
There are eight elements in Exhibit two more zeros of other than in these eight elements.
Construct a finite field of order 27.
Find an irreducible polynomial in of degree 3 and show that has 27 elements.
Factor each of the following polynomials in
(a) (c)
Prove or disprove:
True.
Construct all BCH codes of
length 7.
length 15.
(a) Use the fact that
Prove or disprove: There exists a finite field that is algebraically closed.
False.
Let be fields. If is a separable extension of show that is also separable extension of
If then
Let be an extension of a finite field where has elements. Let be algebraic over of degree Prove that has elements.
Since is algebraic over of degree we can write any element uniquely as with There are possible -tuples
Let be prime. Prove that
Factor over
Compute each of the following Galois groups. Which of these field extensions are normal field extensions? If the extension is not normal, find a normal extension of in which the extension field is contained.
(a) (c)
Determine the separability of each of the following polynomials.
over
over
over
over
(a) Separable over since (c) not separable over since
Give the order and describe a generator of the Galois group of over
If
then A generator for is where for
Determine the Galois groups of each of the following polynomials in hence, determine the solvability by radicals of each of the polynomials.
Find a primitive element in the splitting field of each of the following polynomials in
(a)
Prove that the Galois group of an irreducible cubic polynomial is isomorphic to or
Let be the splitting field of a cubic polynomial in Show that is less than or equal to 6 and is divisible by 3. Since is a subgroup of whose order is divisible by 3, conclude that this group must be isomorphic to or
Let be the Galois group of a polynomial of degree Prove that divides
is a subgroup of
Let be the splitting field of Prove or disprove that is an extension by radicals.
True.
We know that the cyclotomic polynomial
is irreducible over for every prime Let be a zero of and consider the field
Show that are distinct zeros of and conclude that they are all the zeros of
Show that is abelian of order
Show that the fixed field of is
Clearly are distinct since or 0. To show that is a zero of calculate
The conjugates of are Define a map by
where Prove that is an isomorphism of fields. Show that generates
Show that is a basis for over and consider which linear combinations of are left fixed by all elements of