Characteristic of a field is $0$ or prime
up vote
11
down vote
favorite
I'm trying to prove that the characteristic of any field $F$ is either $0$ or a prime number, but I have no idea what to do. Help?
abstract-algebra field-theory
add a comment |
up vote
11
down vote
favorite
I'm trying to prove that the characteristic of any field $F$ is either $0$ or a prime number, but I have no idea what to do. Help?
abstract-algebra field-theory
Hint: Example: Suppose char$(F)=12$. Let $0_F$ and $1_F$ be the additive and multiplicative identities of $F$. Let $a= 1_F+1_F+1_F$ and $b=1_F+1_F+1_F+1_F.$ Then $ane 0_Fne b$ but by the Distributive Law $ab=sum_{j=1}^{12}(1_Fcdot 1_F)=0_F$.
– DanielWainfleet
Nov 14 at 11:15
add a comment |
up vote
11
down vote
favorite
up vote
11
down vote
favorite
I'm trying to prove that the characteristic of any field $F$ is either $0$ or a prime number, but I have no idea what to do. Help?
abstract-algebra field-theory
I'm trying to prove that the characteristic of any field $F$ is either $0$ or a prime number, but I have no idea what to do. Help?
abstract-algebra field-theory
abstract-algebra field-theory
edited Nov 28 '11 at 5:16
user13838
asked Nov 28 '11 at 5:10
pigishpig
194312
194312
Hint: Example: Suppose char$(F)=12$. Let $0_F$ and $1_F$ be the additive and multiplicative identities of $F$. Let $a= 1_F+1_F+1_F$ and $b=1_F+1_F+1_F+1_F.$ Then $ane 0_Fne b$ but by the Distributive Law $ab=sum_{j=1}^{12}(1_Fcdot 1_F)=0_F$.
– DanielWainfleet
Nov 14 at 11:15
add a comment |
Hint: Example: Suppose char$(F)=12$. Let $0_F$ and $1_F$ be the additive and multiplicative identities of $F$. Let $a= 1_F+1_F+1_F$ and $b=1_F+1_F+1_F+1_F.$ Then $ane 0_Fne b$ but by the Distributive Law $ab=sum_{j=1}^{12}(1_Fcdot 1_F)=0_F$.
– DanielWainfleet
Nov 14 at 11:15
Hint: Example: Suppose char$(F)=12$. Let $0_F$ and $1_F$ be the additive and multiplicative identities of $F$. Let $a= 1_F+1_F+1_F$ and $b=1_F+1_F+1_F+1_F.$ Then $ane 0_Fne b$ but by the Distributive Law $ab=sum_{j=1}^{12}(1_Fcdot 1_F)=0_F$.
– DanielWainfleet
Nov 14 at 11:15
Hint: Example: Suppose char$(F)=12$. Let $0_F$ and $1_F$ be the additive and multiplicative identities of $F$. Let $a= 1_F+1_F+1_F$ and $b=1_F+1_F+1_F+1_F.$ Then $ane 0_Fne b$ but by the Distributive Law $ab=sum_{j=1}^{12}(1_Fcdot 1_F)=0_F$.
– DanielWainfleet
Nov 14 at 11:15
add a comment |
2 Answers
2
active
oldest
votes
up vote
12
down vote
Hint: Show that if the characteristic of $F$ were a composite number, say $n=ab$, then $F$ would have zero-divisors (since $n=0$...). Then show that a zero-divisor cannot be a unit unless $0=1$, which is not the case for fields.
Alternate Hint: Look at the unique homomorphism $phi:mathbb{Z}to F$, defined by $phi(0)=0_F$, $phi(1)=1_F$, $phi(2)=1_F+1_F$, etc. and note that its image, being a subring of a field, must be an integral domain.
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
add a comment |
up vote
2
down vote
Suppose $char(F) = m neq 0$.
By definition, $m$ is the smallest integer so that $underbrace{1 + ... + 1}_{m-times} = 0_F$
Suppose m is not prime and say $m = alpha.beta$, where $0 < alpha,beta < m$.
Therefore we can write:
$$
eqalign{
0_F &= underbrace{1 + ... + 1}_{m-times}\
&= (underbrace{underbrace{1 + ... + 1}_{alpha-times}) + ... + (underbrace{1 + ... + 1}_{alpha-times})}_{beta-times} tag{1}label{1}
}
$$
By closure property, $underbrace{1 + ... + 1}_{alpha-times} in F$. Let $underbrace{1 + ... + 1}_{alpha-times} = zeta tag{2}label{2}$ [It's important to not call it $alpha$. See Note]
There are 2 cases:
Case $zeta = 0_F$:
Since $alpha < m$ and $underbrace{1 + ... + 1}_{alpha-times} = 0_F, therefore char(F) = alpha$.
We arrive at a contradiction.
Case $zeta neq 0_F$:
$exists zeta^{-1} in F$
$$
eqalign{
therefore 0_F &= 0_F.zeta^{-1}\
&= (underbrace{zeta + ... + zeta}_{beta-times}).zeta^{-1} [by (ref{1}) and (ref{2})]\
&= underbrace{1 + ... + 1}_{beta-times}
}
$$
Since $beta < m, char(F) = beta$ and we again arrive at a contradiction.
Hence $m$ is a prime. QED
Note: We should not write $underbrace{1 + ... + 1}_{gamma-times} = gamma$, as $gamma$ is just an integer and not necessarily a member of the field $F$. Also this may lead to an erroneous conclusion, e.g. say since $char(F) = m$, if we write $underbrace{1 + ... + 1}_{m-times} = m = 0$, we can say $m = m.1 = 0$ and since $1 neq 0, therefore m = 0$.
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
12
down vote
Hint: Show that if the characteristic of $F$ were a composite number, say $n=ab$, then $F$ would have zero-divisors (since $n=0$...). Then show that a zero-divisor cannot be a unit unless $0=1$, which is not the case for fields.
Alternate Hint: Look at the unique homomorphism $phi:mathbb{Z}to F$, defined by $phi(0)=0_F$, $phi(1)=1_F$, $phi(2)=1_F+1_F$, etc. and note that its image, being a subring of a field, must be an integral domain.
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
add a comment |
up vote
12
down vote
Hint: Show that if the characteristic of $F$ were a composite number, say $n=ab$, then $F$ would have zero-divisors (since $n=0$...). Then show that a zero-divisor cannot be a unit unless $0=1$, which is not the case for fields.
Alternate Hint: Look at the unique homomorphism $phi:mathbb{Z}to F$, defined by $phi(0)=0_F$, $phi(1)=1_F$, $phi(2)=1_F+1_F$, etc. and note that its image, being a subring of a field, must be an integral domain.
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
add a comment |
up vote
12
down vote
up vote
12
down vote
Hint: Show that if the characteristic of $F$ were a composite number, say $n=ab$, then $F$ would have zero-divisors (since $n=0$...). Then show that a zero-divisor cannot be a unit unless $0=1$, which is not the case for fields.
Alternate Hint: Look at the unique homomorphism $phi:mathbb{Z}to F$, defined by $phi(0)=0_F$, $phi(1)=1_F$, $phi(2)=1_F+1_F$, etc. and note that its image, being a subring of a field, must be an integral domain.
Hint: Show that if the characteristic of $F$ were a composite number, say $n=ab$, then $F$ would have zero-divisors (since $n=0$...). Then show that a zero-divisor cannot be a unit unless $0=1$, which is not the case for fields.
Alternate Hint: Look at the unique homomorphism $phi:mathbb{Z}to F$, defined by $phi(0)=0_F$, $phi(1)=1_F$, $phi(2)=1_F+1_F$, etc. and note that its image, being a subring of a field, must be an integral domain.
answered Nov 28 '11 at 5:14
Zev Chonoles
109k16223420
109k16223420
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
add a comment |
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
OK...I'm not very skilled at proofs, so can you see if there are any holes with this? I'm using the 1st Hint... Proof: Consider, for contradiction, that the field is a composite number. (still working)
– pigishpig
Nov 28 '11 at 5:33
add a comment |
up vote
2
down vote
Suppose $char(F) = m neq 0$.
By definition, $m$ is the smallest integer so that $underbrace{1 + ... + 1}_{m-times} = 0_F$
Suppose m is not prime and say $m = alpha.beta$, where $0 < alpha,beta < m$.
Therefore we can write:
$$
eqalign{
0_F &= underbrace{1 + ... + 1}_{m-times}\
&= (underbrace{underbrace{1 + ... + 1}_{alpha-times}) + ... + (underbrace{1 + ... + 1}_{alpha-times})}_{beta-times} tag{1}label{1}
}
$$
By closure property, $underbrace{1 + ... + 1}_{alpha-times} in F$. Let $underbrace{1 + ... + 1}_{alpha-times} = zeta tag{2}label{2}$ [It's important to not call it $alpha$. See Note]
There are 2 cases:
Case $zeta = 0_F$:
Since $alpha < m$ and $underbrace{1 + ... + 1}_{alpha-times} = 0_F, therefore char(F) = alpha$.
We arrive at a contradiction.
Case $zeta neq 0_F$:
$exists zeta^{-1} in F$
$$
eqalign{
therefore 0_F &= 0_F.zeta^{-1}\
&= (underbrace{zeta + ... + zeta}_{beta-times}).zeta^{-1} [by (ref{1}) and (ref{2})]\
&= underbrace{1 + ... + 1}_{beta-times}
}
$$
Since $beta < m, char(F) = beta$ and we again arrive at a contradiction.
Hence $m$ is a prime. QED
Note: We should not write $underbrace{1 + ... + 1}_{gamma-times} = gamma$, as $gamma$ is just an integer and not necessarily a member of the field $F$. Also this may lead to an erroneous conclusion, e.g. say since $char(F) = m$, if we write $underbrace{1 + ... + 1}_{m-times} = m = 0$, we can say $m = m.1 = 0$ and since $1 neq 0, therefore m = 0$.
add a comment |
up vote
2
down vote
Suppose $char(F) = m neq 0$.
By definition, $m$ is the smallest integer so that $underbrace{1 + ... + 1}_{m-times} = 0_F$
Suppose m is not prime and say $m = alpha.beta$, where $0 < alpha,beta < m$.
Therefore we can write:
$$
eqalign{
0_F &= underbrace{1 + ... + 1}_{m-times}\
&= (underbrace{underbrace{1 + ... + 1}_{alpha-times}) + ... + (underbrace{1 + ... + 1}_{alpha-times})}_{beta-times} tag{1}label{1}
}
$$
By closure property, $underbrace{1 + ... + 1}_{alpha-times} in F$. Let $underbrace{1 + ... + 1}_{alpha-times} = zeta tag{2}label{2}$ [It's important to not call it $alpha$. See Note]
There are 2 cases:
Case $zeta = 0_F$:
Since $alpha < m$ and $underbrace{1 + ... + 1}_{alpha-times} = 0_F, therefore char(F) = alpha$.
We arrive at a contradiction.
Case $zeta neq 0_F$:
$exists zeta^{-1} in F$
$$
eqalign{
therefore 0_F &= 0_F.zeta^{-1}\
&= (underbrace{zeta + ... + zeta}_{beta-times}).zeta^{-1} [by (ref{1}) and (ref{2})]\
&= underbrace{1 + ... + 1}_{beta-times}
}
$$
Since $beta < m, char(F) = beta$ and we again arrive at a contradiction.
Hence $m$ is a prime. QED
Note: We should not write $underbrace{1 + ... + 1}_{gamma-times} = gamma$, as $gamma$ is just an integer and not necessarily a member of the field $F$. Also this may lead to an erroneous conclusion, e.g. say since $char(F) = m$, if we write $underbrace{1 + ... + 1}_{m-times} = m = 0$, we can say $m = m.1 = 0$ and since $1 neq 0, therefore m = 0$.
add a comment |
up vote
2
down vote
up vote
2
down vote
Suppose $char(F) = m neq 0$.
By definition, $m$ is the smallest integer so that $underbrace{1 + ... + 1}_{m-times} = 0_F$
Suppose m is not prime and say $m = alpha.beta$, where $0 < alpha,beta < m$.
Therefore we can write:
$$
eqalign{
0_F &= underbrace{1 + ... + 1}_{m-times}\
&= (underbrace{underbrace{1 + ... + 1}_{alpha-times}) + ... + (underbrace{1 + ... + 1}_{alpha-times})}_{beta-times} tag{1}label{1}
}
$$
By closure property, $underbrace{1 + ... + 1}_{alpha-times} in F$. Let $underbrace{1 + ... + 1}_{alpha-times} = zeta tag{2}label{2}$ [It's important to not call it $alpha$. See Note]
There are 2 cases:
Case $zeta = 0_F$:
Since $alpha < m$ and $underbrace{1 + ... + 1}_{alpha-times} = 0_F, therefore char(F) = alpha$.
We arrive at a contradiction.
Case $zeta neq 0_F$:
$exists zeta^{-1} in F$
$$
eqalign{
therefore 0_F &= 0_F.zeta^{-1}\
&= (underbrace{zeta + ... + zeta}_{beta-times}).zeta^{-1} [by (ref{1}) and (ref{2})]\
&= underbrace{1 + ... + 1}_{beta-times}
}
$$
Since $beta < m, char(F) = beta$ and we again arrive at a contradiction.
Hence $m$ is a prime. QED
Note: We should not write $underbrace{1 + ... + 1}_{gamma-times} = gamma$, as $gamma$ is just an integer and not necessarily a member of the field $F$. Also this may lead to an erroneous conclusion, e.g. say since $char(F) = m$, if we write $underbrace{1 + ... + 1}_{m-times} = m = 0$, we can say $m = m.1 = 0$ and since $1 neq 0, therefore m = 0$.
Suppose $char(F) = m neq 0$.
By definition, $m$ is the smallest integer so that $underbrace{1 + ... + 1}_{m-times} = 0_F$
Suppose m is not prime and say $m = alpha.beta$, where $0 < alpha,beta < m$.
Therefore we can write:
$$
eqalign{
0_F &= underbrace{1 + ... + 1}_{m-times}\
&= (underbrace{underbrace{1 + ... + 1}_{alpha-times}) + ... + (underbrace{1 + ... + 1}_{alpha-times})}_{beta-times} tag{1}label{1}
}
$$
By closure property, $underbrace{1 + ... + 1}_{alpha-times} in F$. Let $underbrace{1 + ... + 1}_{alpha-times} = zeta tag{2}label{2}$ [It's important to not call it $alpha$. See Note]
There are 2 cases:
Case $zeta = 0_F$:
Since $alpha < m$ and $underbrace{1 + ... + 1}_{alpha-times} = 0_F, therefore char(F) = alpha$.
We arrive at a contradiction.
Case $zeta neq 0_F$:
$exists zeta^{-1} in F$
$$
eqalign{
therefore 0_F &= 0_F.zeta^{-1}\
&= (underbrace{zeta + ... + zeta}_{beta-times}).zeta^{-1} [by (ref{1}) and (ref{2})]\
&= underbrace{1 + ... + 1}_{beta-times}
}
$$
Since $beta < m, char(F) = beta$ and we again arrive at a contradiction.
Hence $m$ is a prime. QED
Note: We should not write $underbrace{1 + ... + 1}_{gamma-times} = gamma$, as $gamma$ is just an integer and not necessarily a member of the field $F$. Also this may lead to an erroneous conclusion, e.g. say since $char(F) = m$, if we write $underbrace{1 + ... + 1}_{m-times} = m = 0$, we can say $m = m.1 = 0$ and since $1 neq 0, therefore m = 0$.
edited Nov 14 at 5:04
J. W. Tanner
31
31
answered Jun 4 at 19:07
Chayan Ghosh
416
416
add a comment |
add a comment |
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%2f86263%2fcharacteristic-of-a-field-is-0-or-prime%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
Hint: Example: Suppose char$(F)=12$. Let $0_F$ and $1_F$ be the additive and multiplicative identities of $F$. Let $a= 1_F+1_F+1_F$ and $b=1_F+1_F+1_F+1_F.$ Then $ane 0_Fne b$ but by the Distributive Law $ab=sum_{j=1}^{12}(1_Fcdot 1_F)=0_F$.
– DanielWainfleet
Nov 14 at 11:15