How the following multiplication table is solved ( related to $F_2[X]/f(x)$ )
$begingroup$
$F_2$ is polynomial field of group of integer modulo $2.f(x)$ is $x^2 + x + 1$.
I didn't got how the multiplication is happening in the table.I referred to many sources related to this topic but still i am facing difficulty in understanding it.I will be very thankful if someone explains the concept behind it.
abstract-algebra ring-theory field-theory polynomial-rings
$endgroup$
add a comment |
$begingroup$
$F_2$ is polynomial field of group of integer modulo $2.f(x)$ is $x^2 + x + 1$.
I didn't got how the multiplication is happening in the table.I referred to many sources related to this topic but still i am facing difficulty in understanding it.I will be very thankful if someone explains the concept behind it.
abstract-algebra ring-theory field-theory polynomial-rings
$endgroup$
1
$begingroup$
Are you familiar with quotient rings? If so, where are you stuck?
$endgroup$
– Bill Dubuque
Dec 8 '18 at 17:46
add a comment |
$begingroup$
$F_2$ is polynomial field of group of integer modulo $2.f(x)$ is $x^2 + x + 1$.
I didn't got how the multiplication is happening in the table.I referred to many sources related to this topic but still i am facing difficulty in understanding it.I will be very thankful if someone explains the concept behind it.
abstract-algebra ring-theory field-theory polynomial-rings
$endgroup$
$F_2$ is polynomial field of group of integer modulo $2.f(x)$ is $x^2 + x + 1$.
I didn't got how the multiplication is happening in the table.I referred to many sources related to this topic but still i am facing difficulty in understanding it.I will be very thankful if someone explains the concept behind it.
abstract-algebra ring-theory field-theory polynomial-rings
abstract-algebra ring-theory field-theory polynomial-rings
edited Dec 8 '18 at 16:21
Bhowmick
asked Dec 8 '18 at 16:14
BhowmickBhowmick
1438
1438
1
$begingroup$
Are you familiar with quotient rings? If so, where are you stuck?
$endgroup$
– Bill Dubuque
Dec 8 '18 at 17:46
add a comment |
1
$begingroup$
Are you familiar with quotient rings? If so, where are you stuck?
$endgroup$
– Bill Dubuque
Dec 8 '18 at 17:46
1
1
$begingroup$
Are you familiar with quotient rings? If so, where are you stuck?
$endgroup$
– Bill Dubuque
Dec 8 '18 at 17:46
$begingroup$
Are you familiar with quotient rings? If so, where are you stuck?
$endgroup$
– Bill Dubuque
Dec 8 '18 at 17:46
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is the multiplication table for the field ${Bbb F}_4 = {Bbb F}_2[x]/langle x^2+x+1rangle$ consisting of the residue classes of the elements $0,1,x,x+1$ which are the remainders of ${Bbb F}_2[x]$ modulo $x^2+x+1$.
For instance, $[x] cdot [x+1] = [xcdot(x+1)] = [x^2+x]$ and the residue class of $x^2+x$ modulo $x^2+x+1$ is $[1]$, i.e., $x^2+x = 1cdot (x^2+x+1) + 1$ with quotient $q(x)=1$ and remainder $r(x)=1$. This is an elementary way to view this field extension.
$endgroup$
add a comment |
$begingroup$
Here are all 4x4 operations done to fill in the multiplication table.
I will write $X$ for the transcendent variable of the polynomial ring $Bbb F_2[X]$ over the field $Bbb F_2$ with two elements, and $x$ for the class $[X]$ which is $X$ modulo $X^2+X+1$ (irreducible=prime in the polynomial ring).
( 0 )*( 0 ) = [ 0 ] * [ 0 ] = [ 0 ] = 0
( 0 )*( 1 ) = [ 0 ] * [ 1 ] = [ 0 ] = 0
( 0 )*( x ) = [ 0 ] * [ X ] = [ 0 ] = 0
( 0 )*(x + 1) = [ 0 ] * [X + 1] = [ 0 ] = 0
( 1 )*( 0 ) = [ 1 ] * [ 0 ] = [ 0 ] = 0
( 1 )*( 1 ) = [ 1 ] * [ 1 ] = [ 1 ] = 1
( 1 )*( x ) = [ 1 ] * [ X ] = [ X ] = x
( 1 )*(x + 1) = [ 1 ] * [X + 1] = [ X + 1 ] = x + 1
( x )*( 0 ) = [ X ] * [ 0 ] = [ 0 ] = 0
( x )*( 1 ) = [ X ] * [ 1 ] = [ X ] = x
( x )*( x ) = [ X ] * [ X ] = [ X^2 ] = x + 1
( x )*(x + 1) = [ X ] * [X + 1] = [X^2 + X] = 1
(x + 1)*( 0 ) = [X + 1] * [ 0 ] = [ 0 ] = 0
(x + 1)*( 1 ) = [X + 1] * [ 1 ] = [ X + 1 ] = x + 1
(x + 1)*( x ) = [X + 1] * [ X ] = [X^2 + X] = 1
(x + 1)*(x + 1) = [X + 1] * [X + 1] = [X^2 + 1] = x
In the few ($2times 2=4$) cases where $[X^2+dots]$ appears as a result of computing the product of two polynomials of degree one (representing thus $x,x+1$ in $Bbb F_2[X]$) we replace above $X^2$ by $X^2-(X^2+X+1)=-X-1=X+1$ (working modulo $X^2+X+1$.)
P.S. The above was produced by computer, it is good to know that such computation can be done, assisted and learned in this way.
Used sage code:
sage: F = GF(2)
sage: R.<X> = PolynomialRing(F)
sage: K.<x> = R.quotient( X^2 + X + 1 )
sage: elements = [ K(0), K(1), x, x+1 ]
sage: for a in elements:
....: for b in elements:
....: A, B = a.lift(), b.lift()
....: print( "({:^5})*({:^5}) = [{:^5}] * [{:^5}] = [{:^7}] = {}"
....: .format(a, b, A, B, A*B, a*b) )
....: print
....:
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031296%2fhow-the-following-multiplication-table-is-solved-related-to-f-2x-fx%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is the multiplication table for the field ${Bbb F}_4 = {Bbb F}_2[x]/langle x^2+x+1rangle$ consisting of the residue classes of the elements $0,1,x,x+1$ which are the remainders of ${Bbb F}_2[x]$ modulo $x^2+x+1$.
For instance, $[x] cdot [x+1] = [xcdot(x+1)] = [x^2+x]$ and the residue class of $x^2+x$ modulo $x^2+x+1$ is $[1]$, i.e., $x^2+x = 1cdot (x^2+x+1) + 1$ with quotient $q(x)=1$ and remainder $r(x)=1$. This is an elementary way to view this field extension.
$endgroup$
add a comment |
$begingroup$
This is the multiplication table for the field ${Bbb F}_4 = {Bbb F}_2[x]/langle x^2+x+1rangle$ consisting of the residue classes of the elements $0,1,x,x+1$ which are the remainders of ${Bbb F}_2[x]$ modulo $x^2+x+1$.
For instance, $[x] cdot [x+1] = [xcdot(x+1)] = [x^2+x]$ and the residue class of $x^2+x$ modulo $x^2+x+1$ is $[1]$, i.e., $x^2+x = 1cdot (x^2+x+1) + 1$ with quotient $q(x)=1$ and remainder $r(x)=1$. This is an elementary way to view this field extension.
$endgroup$
add a comment |
$begingroup$
This is the multiplication table for the field ${Bbb F}_4 = {Bbb F}_2[x]/langle x^2+x+1rangle$ consisting of the residue classes of the elements $0,1,x,x+1$ which are the remainders of ${Bbb F}_2[x]$ modulo $x^2+x+1$.
For instance, $[x] cdot [x+1] = [xcdot(x+1)] = [x^2+x]$ and the residue class of $x^2+x$ modulo $x^2+x+1$ is $[1]$, i.e., $x^2+x = 1cdot (x^2+x+1) + 1$ with quotient $q(x)=1$ and remainder $r(x)=1$. This is an elementary way to view this field extension.
$endgroup$
This is the multiplication table for the field ${Bbb F}_4 = {Bbb F}_2[x]/langle x^2+x+1rangle$ consisting of the residue classes of the elements $0,1,x,x+1$ which are the remainders of ${Bbb F}_2[x]$ modulo $x^2+x+1$.
For instance, $[x] cdot [x+1] = [xcdot(x+1)] = [x^2+x]$ and the residue class of $x^2+x$ modulo $x^2+x+1$ is $[1]$, i.e., $x^2+x = 1cdot (x^2+x+1) + 1$ with quotient $q(x)=1$ and remainder $r(x)=1$. This is an elementary way to view this field extension.
answered Dec 8 '18 at 16:21
WuestenfuxWuestenfux
4,4981413
4,4981413
add a comment |
add a comment |
$begingroup$
Here are all 4x4 operations done to fill in the multiplication table.
I will write $X$ for the transcendent variable of the polynomial ring $Bbb F_2[X]$ over the field $Bbb F_2$ with two elements, and $x$ for the class $[X]$ which is $X$ modulo $X^2+X+1$ (irreducible=prime in the polynomial ring).
( 0 )*( 0 ) = [ 0 ] * [ 0 ] = [ 0 ] = 0
( 0 )*( 1 ) = [ 0 ] * [ 1 ] = [ 0 ] = 0
( 0 )*( x ) = [ 0 ] * [ X ] = [ 0 ] = 0
( 0 )*(x + 1) = [ 0 ] * [X + 1] = [ 0 ] = 0
( 1 )*( 0 ) = [ 1 ] * [ 0 ] = [ 0 ] = 0
( 1 )*( 1 ) = [ 1 ] * [ 1 ] = [ 1 ] = 1
( 1 )*( x ) = [ 1 ] * [ X ] = [ X ] = x
( 1 )*(x + 1) = [ 1 ] * [X + 1] = [ X + 1 ] = x + 1
( x )*( 0 ) = [ X ] * [ 0 ] = [ 0 ] = 0
( x )*( 1 ) = [ X ] * [ 1 ] = [ X ] = x
( x )*( x ) = [ X ] * [ X ] = [ X^2 ] = x + 1
( x )*(x + 1) = [ X ] * [X + 1] = [X^2 + X] = 1
(x + 1)*( 0 ) = [X + 1] * [ 0 ] = [ 0 ] = 0
(x + 1)*( 1 ) = [X + 1] * [ 1 ] = [ X + 1 ] = x + 1
(x + 1)*( x ) = [X + 1] * [ X ] = [X^2 + X] = 1
(x + 1)*(x + 1) = [X + 1] * [X + 1] = [X^2 + 1] = x
In the few ($2times 2=4$) cases where $[X^2+dots]$ appears as a result of computing the product of two polynomials of degree one (representing thus $x,x+1$ in $Bbb F_2[X]$) we replace above $X^2$ by $X^2-(X^2+X+1)=-X-1=X+1$ (working modulo $X^2+X+1$.)
P.S. The above was produced by computer, it is good to know that such computation can be done, assisted and learned in this way.
Used sage code:
sage: F = GF(2)
sage: R.<X> = PolynomialRing(F)
sage: K.<x> = R.quotient( X^2 + X + 1 )
sage: elements = [ K(0), K(1), x, x+1 ]
sage: for a in elements:
....: for b in elements:
....: A, B = a.lift(), b.lift()
....: print( "({:^5})*({:^5}) = [{:^5}] * [{:^5}] = [{:^7}] = {}"
....: .format(a, b, A, B, A*B, a*b) )
....: print
....:
$endgroup$
add a comment |
$begingroup$
Here are all 4x4 operations done to fill in the multiplication table.
I will write $X$ for the transcendent variable of the polynomial ring $Bbb F_2[X]$ over the field $Bbb F_2$ with two elements, and $x$ for the class $[X]$ which is $X$ modulo $X^2+X+1$ (irreducible=prime in the polynomial ring).
( 0 )*( 0 ) = [ 0 ] * [ 0 ] = [ 0 ] = 0
( 0 )*( 1 ) = [ 0 ] * [ 1 ] = [ 0 ] = 0
( 0 )*( x ) = [ 0 ] * [ X ] = [ 0 ] = 0
( 0 )*(x + 1) = [ 0 ] * [X + 1] = [ 0 ] = 0
( 1 )*( 0 ) = [ 1 ] * [ 0 ] = [ 0 ] = 0
( 1 )*( 1 ) = [ 1 ] * [ 1 ] = [ 1 ] = 1
( 1 )*( x ) = [ 1 ] * [ X ] = [ X ] = x
( 1 )*(x + 1) = [ 1 ] * [X + 1] = [ X + 1 ] = x + 1
( x )*( 0 ) = [ X ] * [ 0 ] = [ 0 ] = 0
( x )*( 1 ) = [ X ] * [ 1 ] = [ X ] = x
( x )*( x ) = [ X ] * [ X ] = [ X^2 ] = x + 1
( x )*(x + 1) = [ X ] * [X + 1] = [X^2 + X] = 1
(x + 1)*( 0 ) = [X + 1] * [ 0 ] = [ 0 ] = 0
(x + 1)*( 1 ) = [X + 1] * [ 1 ] = [ X + 1 ] = x + 1
(x + 1)*( x ) = [X + 1] * [ X ] = [X^2 + X] = 1
(x + 1)*(x + 1) = [X + 1] * [X + 1] = [X^2 + 1] = x
In the few ($2times 2=4$) cases where $[X^2+dots]$ appears as a result of computing the product of two polynomials of degree one (representing thus $x,x+1$ in $Bbb F_2[X]$) we replace above $X^2$ by $X^2-(X^2+X+1)=-X-1=X+1$ (working modulo $X^2+X+1$.)
P.S. The above was produced by computer, it is good to know that such computation can be done, assisted and learned in this way.
Used sage code:
sage: F = GF(2)
sage: R.<X> = PolynomialRing(F)
sage: K.<x> = R.quotient( X^2 + X + 1 )
sage: elements = [ K(0), K(1), x, x+1 ]
sage: for a in elements:
....: for b in elements:
....: A, B = a.lift(), b.lift()
....: print( "({:^5})*({:^5}) = [{:^5}] * [{:^5}] = [{:^7}] = {}"
....: .format(a, b, A, B, A*B, a*b) )
....: print
....:
$endgroup$
add a comment |
$begingroup$
Here are all 4x4 operations done to fill in the multiplication table.
I will write $X$ for the transcendent variable of the polynomial ring $Bbb F_2[X]$ over the field $Bbb F_2$ with two elements, and $x$ for the class $[X]$ which is $X$ modulo $X^2+X+1$ (irreducible=prime in the polynomial ring).
( 0 )*( 0 ) = [ 0 ] * [ 0 ] = [ 0 ] = 0
( 0 )*( 1 ) = [ 0 ] * [ 1 ] = [ 0 ] = 0
( 0 )*( x ) = [ 0 ] * [ X ] = [ 0 ] = 0
( 0 )*(x + 1) = [ 0 ] * [X + 1] = [ 0 ] = 0
( 1 )*( 0 ) = [ 1 ] * [ 0 ] = [ 0 ] = 0
( 1 )*( 1 ) = [ 1 ] * [ 1 ] = [ 1 ] = 1
( 1 )*( x ) = [ 1 ] * [ X ] = [ X ] = x
( 1 )*(x + 1) = [ 1 ] * [X + 1] = [ X + 1 ] = x + 1
( x )*( 0 ) = [ X ] * [ 0 ] = [ 0 ] = 0
( x )*( 1 ) = [ X ] * [ 1 ] = [ X ] = x
( x )*( x ) = [ X ] * [ X ] = [ X^2 ] = x + 1
( x )*(x + 1) = [ X ] * [X + 1] = [X^2 + X] = 1
(x + 1)*( 0 ) = [X + 1] * [ 0 ] = [ 0 ] = 0
(x + 1)*( 1 ) = [X + 1] * [ 1 ] = [ X + 1 ] = x + 1
(x + 1)*( x ) = [X + 1] * [ X ] = [X^2 + X] = 1
(x + 1)*(x + 1) = [X + 1] * [X + 1] = [X^2 + 1] = x
In the few ($2times 2=4$) cases where $[X^2+dots]$ appears as a result of computing the product of two polynomials of degree one (representing thus $x,x+1$ in $Bbb F_2[X]$) we replace above $X^2$ by $X^2-(X^2+X+1)=-X-1=X+1$ (working modulo $X^2+X+1$.)
P.S. The above was produced by computer, it is good to know that such computation can be done, assisted and learned in this way.
Used sage code:
sage: F = GF(2)
sage: R.<X> = PolynomialRing(F)
sage: K.<x> = R.quotient( X^2 + X + 1 )
sage: elements = [ K(0), K(1), x, x+1 ]
sage: for a in elements:
....: for b in elements:
....: A, B = a.lift(), b.lift()
....: print( "({:^5})*({:^5}) = [{:^5}] * [{:^5}] = [{:^7}] = {}"
....: .format(a, b, A, B, A*B, a*b) )
....: print
....:
$endgroup$
Here are all 4x4 operations done to fill in the multiplication table.
I will write $X$ for the transcendent variable of the polynomial ring $Bbb F_2[X]$ over the field $Bbb F_2$ with two elements, and $x$ for the class $[X]$ which is $X$ modulo $X^2+X+1$ (irreducible=prime in the polynomial ring).
( 0 )*( 0 ) = [ 0 ] * [ 0 ] = [ 0 ] = 0
( 0 )*( 1 ) = [ 0 ] * [ 1 ] = [ 0 ] = 0
( 0 )*( x ) = [ 0 ] * [ X ] = [ 0 ] = 0
( 0 )*(x + 1) = [ 0 ] * [X + 1] = [ 0 ] = 0
( 1 )*( 0 ) = [ 1 ] * [ 0 ] = [ 0 ] = 0
( 1 )*( 1 ) = [ 1 ] * [ 1 ] = [ 1 ] = 1
( 1 )*( x ) = [ 1 ] * [ X ] = [ X ] = x
( 1 )*(x + 1) = [ 1 ] * [X + 1] = [ X + 1 ] = x + 1
( x )*( 0 ) = [ X ] * [ 0 ] = [ 0 ] = 0
( x )*( 1 ) = [ X ] * [ 1 ] = [ X ] = x
( x )*( x ) = [ X ] * [ X ] = [ X^2 ] = x + 1
( x )*(x + 1) = [ X ] * [X + 1] = [X^2 + X] = 1
(x + 1)*( 0 ) = [X + 1] * [ 0 ] = [ 0 ] = 0
(x + 1)*( 1 ) = [X + 1] * [ 1 ] = [ X + 1 ] = x + 1
(x + 1)*( x ) = [X + 1] * [ X ] = [X^2 + X] = 1
(x + 1)*(x + 1) = [X + 1] * [X + 1] = [X^2 + 1] = x
In the few ($2times 2=4$) cases where $[X^2+dots]$ appears as a result of computing the product of two polynomials of degree one (representing thus $x,x+1$ in $Bbb F_2[X]$) we replace above $X^2$ by $X^2-(X^2+X+1)=-X-1=X+1$ (working modulo $X^2+X+1$.)
P.S. The above was produced by computer, it is good to know that such computation can be done, assisted and learned in this way.
Used sage code:
sage: F = GF(2)
sage: R.<X> = PolynomialRing(F)
sage: K.<x> = R.quotient( X^2 + X + 1 )
sage: elements = [ K(0), K(1), x, x+1 ]
sage: for a in elements:
....: for b in elements:
....: A, B = a.lift(), b.lift()
....: print( "({:^5})*({:^5}) = [{:^5}] * [{:^5}] = [{:^7}] = {}"
....: .format(a, b, A, B, A*B, a*b) )
....: print
....:
answered Dec 8 '18 at 16:43
dan_fuleadan_fulea
6,5681312
6,5681312
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031296%2fhow-the-following-multiplication-table-is-solved-related-to-f-2x-fx%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
Are you familiar with quotient rings? If so, where are you stuck?
$endgroup$
– Bill Dubuque
Dec 8 '18 at 17:46