Elementary proof that all fields of four elements are isomorphic to each other

Elementary proof that all fields of four elements are isomorphic to each other



A question in Rotman's Advanded Modern Algebra asks to prove the question in the title. I'm convinced of my proof, but a subquestion asked to prove that $1+1$ is zero, and for this I proceeded on a case by case basis; that is, assuming for the sake of contradiction that $1+1 ne 0$, given that we now know that the field $F = 0,1,1+1,a$, I proved that this structure cannot be a field.



However, I think this solution is quite ugly and I was wondering if is a nicer but still elementary solution (avoiding the fact that char($F$) = $2$).



PS I'm not sure if this is a suitable question. If it's not, feel free to remove it.





Provided $1+1=0$, what are your arguments?
– Berci
Sep 3 at 17:40




4 Answers
4



Since there is an odd number of non-zero elements in the field, at least one of them must be its own additive inverse (because those who aren't come in pairs). So let's call that element $a$.



Since $ane 0$, it has a multiplicative inverse $a^-1$. But then we have
$$1 + 1 = a a^-1 + a a^-1 = (a+a) a^-1 = 0 a^-1 = 0$$



Note that this in turn implies that all elements of the field are their own additive inverse, since
$$x+x = 1x + 1x = (1+1)x = 0x = 0$$
Or in short, any finite field with an even number of elements must be of characteristic $2$.





Sorry to everyone who answered that I respond only now. All answers were wonderful but maybe this one captured the intent of my question the most.
– Jan De Meyer
Nov 29 at 13:48



The underlying Abelian group $(F, +)$ has 4 elements, so the additive order of $1$ divides 4. If it were 4, the element $1+1$ would not be invertible.





I thought $1+1=0$ is not invertible.
– Chris Custer
Sep 3 at 19:34





Yes of course. But besides $0$, in a field, there is no noninvertible element.
– Berci
Sep 3 at 19:42





Of course. You are arguing by contradiction. My mistake. An inverse for $1+1$ would require a new element...
– Chris Custer
Sep 3 at 20:01





We could adjust this argument like this: $(1+1)^2=(1+1)(1+1) = 1+1+1+1 = 0$ where the last equality must hold since order of the underlying additive group is $4$.
– Ennar
Sep 3 at 20:12



We need $0$ and $1$. Call the other two elements $a$ and $b$. Then $ab=1, a^2=b$ and $b^2=a$ (otherwise $a^2=1 implies a=b$ etc...) So the multiplication table is fixed.



But so is the addition table: $1+a=b$, necessarily. (Also, $b+1=a$.) For if $1+a=a,0$ or $1$ we get a contradiction. For instance, $1+a=0implies a=-1implies a=1$, since $1+1not =1,a$ or $b$. Again, we would have a contradiction: say $1+1=a$, then $1+b=b,0$ or $1$, in which case $1=0$ or $b=a$ or $0$.



So our hand winds up being forced.





I'm not following $a^2 = b^2 = 1 Rightarrow a = b = 1$. (After showing $ab=1$, I do see $a^2 = 1 Rightarrow a = b$, which is enough of a contradiction.) The second paragraph gets rather confusing with nested suppositions and contradictions.
– aschepler
Sep 4 at 0:38





Well we do have $ab=1$, because the other choices are not feasible. I regretted how complicated it is; but the OP wanted an elementary proof, and it's the most elementary way I could see to approach it...
– Chris Custer
Sep 4 at 0:50





@aschepler I adjusted it. Thanks.
– Chris Custer
Sep 4 at 1:07



Another path is to consider the multiplicative group $F^times$. Since it has order $3$, it has to be cyclic. Thus, the multiplication table is fixed. This will also fix the addition table.



Thanks for contributing an answer to Mathematics Stack Exchange!



But avoid



Use MathJax to format equations. MathJax reference.



To learn more, see our tips on writing great answers.



Some of your past answers have not been well-received, and you're in danger of being blocked from answering.



Please pay close attention to the following guidance:



But avoid



To learn more, see our tips on writing great answers.



Required, but never shown



Required, but never shown




By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Popular posts from this blog

𛂒𛀶,𛀽𛀑𛂀𛃧𛂓𛀙𛃆𛃑𛃷𛂟𛁡𛀢𛀟𛁤𛂽𛁕𛁪𛂟𛂯,𛁞𛂧𛀴𛁄𛁠𛁼𛂿𛀤 𛂘,𛁺𛂾𛃭𛃭𛃵𛀺,𛂣𛃍𛂖𛃶 𛀸𛃀𛂖𛁶𛁏𛁚 𛂢𛂞 𛁰𛂆𛀔,𛁸𛀽𛁓𛃋𛂇𛃧𛀧𛃣𛂐𛃇,𛂂𛃻𛃲𛁬𛃞𛀧𛃃𛀅 𛂭𛁠𛁡𛃇𛀷𛃓𛁥,𛁙𛁘𛁞𛃸𛁸𛃣𛁜,𛂛,𛃿,𛁯𛂘𛂌𛃛𛁱𛃌𛂈𛂇 𛁊𛃲,𛀕𛃴𛀜 𛀶𛂆𛀶𛃟𛂉𛀣,𛂐𛁞𛁾 𛁷𛂑𛁳𛂯𛀬𛃅,𛃶𛁼

Crossroads (UK TV series)

ữḛḳṊẴ ẋ,Ẩṙ,ỹḛẪẠứụỿṞṦ,Ṉẍừ,ứ Ị,Ḵ,ṏ ṇỪḎḰṰọửḊ ṾḨḮữẑỶṑỗḮṣṉẃ Ữẩụ,ṓ,ḹẕḪḫỞṿḭ ỒṱṨẁṋṜ ḅẈ ṉ ứṀḱṑỒḵ,ḏ,ḊḖỹẊ Ẻḷổ,ṥ ẔḲẪụḣể Ṱ ḭỏựẶ Ồ Ṩ,ẂḿṡḾồ ỗṗṡịṞẤḵṽẃ ṸḒẄẘ,ủẞẵṦṟầṓế