有限体 の入口
である。
Entrance to finite fields
A
The first example is
for a prime number .
1なぜ素数 そすう が必要 ひつよう か
が
が
である。
もし が
だが も も 0 ではない。
1Why prime numbers are necessary
For to be a
The condition for to have an inverse is
If is prime, then means . Therefore , so an inverse exists.
On the other hand, if is composite and with , then
while neither nor is 0. Since
2具体例 ぐたいれい :F_5
である。
の
だからである。
このように、
2Concrete example: F_5
.
The inverse of is because
In this way, in a
3定理 ていり :有限体 ゆうげんたい の位数 いすう は素数冪 そすうべき
の
が 、 と
である。 の
を で
である。 は となる
かつ なので、 は
であり、 は
ベクトルの
と
が
である。
data/lecture/math/linear-algebra/vector-spaces-and-bases.lecture.n.md3Theorem: the order of a finite field is a prime power
The number of elements, or
where is prime and .
Proof. Since is finite, two terms in the sequence are equal. Subtracting them gives a positive integer such that . The least such is called the
If with , then
By the minimality of , both and are nonzero, contradicting the fact that a field has no zero divisors. Thus is a prime .
Define by . If , then is an integer multiple of , so the map is independent of representatives. Suppose , so . By integer division, write with . Then
Because is the least positive integer satisfying , the inequality forces . Hence and , so is injective. Moreover,
and . Thus preserves addition, multiplication, and the identity. Moreover, if , then
and injectivity gives . Hence the image is a subfield of : it is closed under addition, subtraction, multiplication, and multiplicative inverses of nonzero elements. We identify this subfield with .
Use the addition of as vector addition. Since is a field, it is an abelian group under this addition. For and , define scalar multiplication by
Even after identifying the subfield with , we keep in this formula to display the embedding explicitly. Because preserves addition, multiplication, and the identity, the field laws in give, for and ,
Thus is a vector space over . Since the finite set spans itself, removing redundant elements produces a finite basis; let its size be . Since , the basis is nonempty and .
Every element has a unique expression as a linear combination of the basis elements, and each coefficient has choices. Therefore
4何 なに を変 か えて何 なに を保存 ほぞん するか
4What changes and what is preserved
A finite field is a field restricted by the additional requirement that its set of elements be finite. All field axioms—addition, multiplication, and division by nonzero elements—remain in force. Finiteness makes these fields easy to handle computationally and useful in cryptography and error correction.
5証明 しょうめい 補足 ほそく :有限整域 ゆうげんせいいき は体 たい である
を
は
5Proof supplement: every finite integral domain 整域 せいいき is a field 体 たい
A finite
Proof. Take with . To show that is a
If , then . Since and is an
Because is a finite set, every
Finiteness is used exactly at the step where
6例 れい :4 個 こ の元 げん を持 も つ有限体 ゆうげんたい
は
を
の
を が
である。また、
と
と、
が
であり、
と
のいずれかである。これらは
となり、
さらに、0 でない
である。
6Example: a finite field 有限体 ゆうげんたい with 4 elements
The ring is not a field, but a finite field with 4 elements does exist. In , consider
Since and , the polynomial has no root over . If a quadratic factors into two nonconstant polynomials, it has a linear factor and hence a root. Thus is
The set of all polynomial multiples of ,
is the ideal generated by . Indeed, , and if , then
Moreover, for every , we have . Thus is closed under differences and under multiplication by arbitrary ring elements, so it is indeed an ideal. Form the quotient ring in which and represent the same element exactly when , and define
We verify directly below that this quotient is, as the notation suggests, a field with four elements. Write . From
and the identities and in characteristic 2, we get
We verify by induction on the exponent that every class has a representative of degree at most 1. For , we have and . If , then in the quotient ring
and both exponents on the right are smaller than . Strong induction therefore gives
for the class of every monomial . Adding the finitely many monomials of any polynomial gives a representative of the same form. Thus every element is one of
They are distinct: the difference of any two is a nonzero polynomial of degree at most 1. On the other hand, if , then , so such a difference cannot be a multiple of . Therefore this quotient ring has exactly four elements.
The reason for checking that is irreducible is now visible. If were a product of nonconstant polynomials, then, because is quadratic, both and would be linear. By the preceding degree argument, their classes would be nonzero, but in the quotient
producing zero divisors and preventing the quotient from being a field. Irreducibility rules out this obstruction. We do not use here the general theorem that the quotient of by an ideal generated by an irreducible polynomial is a field; for this particular quotient, we verify the field property directly by finding the inverse of every nonzero element.
The inverses of the nonzero elements are
Indeed, . Hence every nonzero element has an inverse, so this quotient ring is a field.
7演習 えんしゅう リンク
data/exercise/math/abstract-algebra/integral-domains-fields-and-finite-fields.exercise.n.md
7Exercise link
data/exercise/math/abstract-algebra/integral-domains-fields-and-finite-fields.exercise.n.md8まとめ
8Summary
A finite field is a field with finitely many elements. The ring is a finite field when is prime, whereas composite moduli have zero divisors. A finite field has prime characteristic and is a finite-dimensional vector space over , so its order is . The four-element field is not ; it can be constructed as .