Show that every ordered field is equivalent to a Non-Archimedean ordered field.
- User
Show that every ordered field is equivalent to a Non-Archimedean ordered field.
- Assistant
To demonstrate that every ordered field is equivalent to a Non-Archimedean ordered field, we'll construct a non-Archimedean extension for any given ordered field. This involves embedding the original field into a larger field that possesses non-Archimedean properties. Here's a step-by-step proof of this assertion:
Definitions
-
Ordered Field: A field ( F ) equipped with a total order ( < ) such that for all ( a, b, c \in F ):
- If ( a < b ), then ( a + c < b + c ).
- If ( 0 < a ) and ( 0 < b ), then ( 0 < a \cdot b ).
-
Archimedean Property: An ordered field ( F ) is Archimedean if for every ( a \in F ), there exists a natural number ( n ) such that ( n > a ). Otherwise, ( F ) is Non-Archimedean.
-
Formal Laurent Series: For an ordered field ( F ), the field of formal Laurent series ( F((X)) ) consists of expressions of the form: [ f(X) = \sum_{n=N}^{\infty} a_n X^n ] where ( N ) is some integer (which can be negative), and each ( a_n \in F ). Only finitely many coefficients ( a_n ) have negative indices.
Construction of the Non-Archimedean Ordered Field
-
Embedding ( F ) into ( F((X)) ): Define a natural embedding ( \phi: F \hookrightarrow F((X)) ) by mapping each ( a \in F ) to the constant Laurent series: [ \phi(a) = a + 0X + 0X^2 + 0X^3 + \cdots ] This embedding preserves the field operations and the order:
- Addition & Multiplication: Clearly, ( \phi(a + b) = \phi(a) + \phi(b) ) and ( \phi(a \cdot b) = \phi(a) \cdot \phi(b) ).
- Order Preservation: If ( a < b ) in ( F ), then ( \phi(a) < \phi(b) ) in ( F((X)) ) because the leading coefficients (constants) preserve the order.
-
Ordering ( F((X)) ): Equip ( F((X)) ) with the lexicographic order:
- Compare two Laurent series ( f(X) = \sum_{n=N}^{\infty} a_n X^n ) and ( g(X) = \sum_{n=N}^{\infty} b_n X^n ) by finding the smallest integer ( k ) where ( a_k \neq b_k ).
- If ( a_k < b_k ) in ( F ), then ( f(X) < g(X) ) in ( F((X)) ); otherwise, ( f(X) > g(X) ).
-
Non-Archimedean Property of ( F((X)) ):
- Infinite Element: The element ( X \in F((X)) ) is greater than any element of ( \phi(F) ). To see this, for any ( a \in F ), ( \phi(a) = a + 0X + \cdots < X ) because the coefficient of ( X^1 ) in ( X ) is 1, which is greater than 0.
- No Archimedean Bound: Since ( X ) exceeds all elements of ( \phi(F) ), there is no natural number ( n ) in ( F ) such that ( n > X ). Therefore, ( F((X)) ) is Non-Archimedean.
-
Equivalence to a Non-Archimedean Ordered Field:
- The embedding ( \phi ) demonstrates that ( F ) is isomorphic to a subfield of ( F((X)) ).
- Since ( F((X)) ) is Non-Archimedean, this shows that every ordered field ( F ) is order-isomorphic to a subfield of a Non-Archimedean ordered field.
Conclusion
By constructing the field of formal Laurent series ( F((X)) ) and embedding the original ordered field ( F ) into it, we've established that every ordered field is equivalent to a Non-Archimedean ordered field. This embedding preserves the field structure and the order, ensuring that the original properties of ( F ) are retained within the non-Archimedean extension.
-