How are multiplication tables for fields created?

phillyj
Messages
30
Reaction score
0
The class I'm in is not modern algebra nor have I take those courses. The professor of the class [Learning how to read/write in math] decided to try to teach some abstract algebra. I am trying to understand how multiplication is done in a field. I am using this site to help me as it was most relevant to making tables like the professor wanted:

http://math.arizona.edu/~ura-reports/041/Patterson.Genevieve/Final/FinalReport/node8.html

I am stuck on 9 element fields. This is the second to last example at the end of the page. I understand that we can extend the F[3] field to get the table.

The site says "As a vector space, F[9] = F[3^2] = {a+bx, (a,b)\in F[3]}. To find the multiplication table we need a monic-quadratic that has no zeros in F[3]
A monic-quadratic will have a coefficient of 1 on the highest degree term."

[1]Why do they use monic quadratic?

[2] When they try x^2+1, they get f(0)=1, f(1)=2 but why is f(2)=2? Are they not plugging into x?

I don't really have good study material as the professor wrote a short paper on this stuff but it is bare minimum.

Thanks for your help.
 
Physics news on Phys.org
F[3] is just the integers modulo 3. Given a number, its remainder when you divide by 3 is either 0, 1 or 2, and that's the corresponding number that you get in F[3]. So f(2)=5, but we have to take the remainder when you divide by 3, which gives f(2)=2.

The choice for a monic quadratic is just that it makes the calculations a little easier to look at (there are fewer coefficients flying around). x is going to be an element that satisfies f(x)=0. If we have ax^2+bx+c=0 the way we use this is by re-arranging:
x^2 = \frac{1}{a}(-bx-c)

So given any arbitrary polynomial in x, we can write it as something of the form cx+d by repeatedly replacing x2s with the other side of that equality. We could have chosen a monic f(x) by just dividing both sides of ax^2+bx+c=0 and we would have ended up with the same solution for x2 at the end anyway. So we can basically just ignore the a if we assume our polynomial is monic to begin with
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top