ΘρϵηΠατπ

Field
A field is a set F with two binary operations ⊕︎, such that for any a,b,cF we have
  1. ⊕︎, are both associative and commutative
  2. Identities: There exist identity elements 0F1FF for ⊕︎ and respectively
  3. Additive Inverses: There exists an aF such that a⊕︎a=0F
  4. Multiplicative Inverses: If a0 there exists an a1F such that aa1=1F
  5. Distributivity: distributes into ⊕︎
The Complex Numbers Form a Field
The complex numbers with their standard addition and multiplication form a field
A Field is a Crone
Suppose that F is a field, then F is a crone
A Crone with Multiplicative Inverses is a Field
Suppose that (R,⊕︎,) is a non-zero crone then if for every a0, there is an aa1=1R then R is a field
Field Implies Domain
Suppose that F is a field, then F is a domain

We already know that since F is a field then F is a crone, so one way would be just showing that it's a domain through this characterization of a domain

Suppose that x,yF and assume that xy=0F, if x=0R, we've proven the statement, if x0R, then since F has multiplicative inverses for non-zero elements we know that x1xy=x10R=0R, thus after cancellation and multiplication by one we have y=0R as needed.

Finite Extension of the Rationals
We define the set for any x as (x):={a+bx:a,b}
Multiplicative Inverse in a Finite Extension of the Rationals
Suppose that p is prime and that x+yp(p), such that x+yp0, then it's multiplicative inverse can be written as a+bp for some a,b
Since x+yp, and it's non-zero, then in we have an inverse: 1/(x+yp), we can then rationalize that as follows 1x+ypamp;=1x+ypxypxypamp;=xypx2y2p

Now let's observe the denominator x2y2p, if this equals zero, then we have the following (xy)2=p note that division is justified since y0 from the fact that x+yp was non-zero. For this equation to make any sense we require that (xy)2 be an integer, which isn't necessarily the case and if it's not the case we've reached a contradiction.

Perhaps (xy)2 is an integer (non-zero), in that case we're saying that there exists some integer a such that a2=p, but this is a contradiction as clearly the square of any non-zero integer is not prime, thus our original assumption that x2y2p=0 is false, and thus we can safely write our multiplicative inverse as

xx2y2pyx2y2pp
The Integers mod a Prime Form a Field
/n is a field if and only if n is prime.

Suppose that n is prime, we recall that /n is a crone. Therefore to show it's a field we have to show it has multiplicative inverses, so let a/n{0}. Since a0 then a≢0(modn) therefore na thus gcd(n,a)=1 and we must have s,t such that 1=ns+at, taking this equation mod n we see that at1(modn) in otherwords at=1 so that t is a's multiplicative inverse so that /n is a field.

We use the contrapositive so assume that n is not prime, therefore n is composite, so we have n=ab for some a,b1,...n1 so clearly a0 and b0 but at the same time n|ab therefore ab=0, which shows that /n is not a domain, therefore it cannot be a field, as needed for the contrapositive, so the original implication holds true