Basic transcendental field extension question

In summary, the conversation discusses the definition of F(u) and its relationship to F(x), the field of quotients of the integral domain F[x]. It is shown that F(u) contains all polynomials of the form f(u) and their inverses f(u)^-1, and is the smallest field containing both F and u. The use of a transcendental element u allows for the division by g(u) in the larger field, and the field of quotients is constructed by taking the collection of all pairs (f(x), g(x)) with g(x) ≠ 0 and quotienting by an equivalence relation. The conversation also mentions that F(x) and F(u) are isomorphic, with the proof being left to
  • #1
PsychonautQQ
784
10
My textbook says:
If u is transcnedetal over F, it is routine to verify that:
F(u) = {f(u)g(u)^(-1) | f,g in F[x]; g /= 0}

However, me being the scrubbiest of all scrubs does not understand what they did here.

First of all, I don't understand why they needed to invert the g(u) function.

It goes on to say that F(u) is isomorphic to F(x), the field of quotients of the integral domain F[x].

Can somebody shed some light on this stuff for me?
 
Physics news on Phys.org
  • #2
By definition [itex] F(u) [/itex] is the smallest field containing [itex] F [/itex] as well as [itex] u [/itex]. Since [itex] F(u) [/itex] is a field it is closed under multiplication and addition. So, if it contains [itex] u [/itex] then it contains [itex] u^n [/itex] for any [itex] n[/itex], hence it contains [itex] au^n[/itex] for any [itex] a\in F[/itex] and so must also contain all sums of these terms ie. every polynomial of the form [itex] f(u) [/itex]. Further, a field must contain inverses of all elements, so if it contains an expression [itex] f(u)[/itex] then it must contain the inverse [itex] f(u)^{-1} [/itex] as well. Finally, since we've shown it contains [itex] f(u)[/itex] and [itex] g(u)^{-1}[/itex], for any polynomials [itex] f,g [/itex] it must contain [itex] f(u)g(u)^{-1} [/itex] since it is closed under multiplication. This shows that [itex] F(u) [/itex] must contain the collection
[tex] K=\left\{\frac{f(u)}{g(u)}~\bigg|~ f,g\in F[x], g\neq 0 \right\} [/tex]
The fact that the [itex] u [/itex] is transcendental is used here in that [itex] g\neq 0[/itex] implies that [itex] g(u)\neq 0 [/itex] so that it makes sense to divide by [itex] g(u) [/itex] in the larger field containing [itex] u [/itex].

To finish it off, you just need to check that this collection of quotients of polynomials is actually a field, and then it will necessarily be the smallest field containing both [itex] F [/itex] and [itex] u [/itex].

Intuitively, the field of quotients of [itex] F[x] [/itex] is the smallest field containing [itex] F[x] [/itex] in which every nonzero element has an inverse. So it should be the set of all quotients of [itex] f(x)/g(x) [/itex] where [itex] g\neq 0 [/itex]. But since [itex] u [/itex] is transcendental, it satisfies no polynomial relations and so we can relabel [itex] x[/itex] by [itex] u [/itex] and we should still get the same thing.

To make this somewhat rigorous, to construct the field of quotients of [itex] F[x] [/itex], you take the collection of all pairs [itex] (f(x),g(x) )[/itex] where [itex] g(x)\neq 0 [/itex] and quotient by the equivalence relation [itex] (f(x),g(x))\sim (f'(x),g'(x)) [/itex] when [itex] f(x)g'(x)-f'(x)g(x)=0 [/itex]. Of course the pair [itex] (f(x),g(x) ) [/itex] is intuitively supposed to represent the quotient f(x)/g(x) so there is an obvious map [itex] \phi:\mathrm{Quot}(F[x])\to K [/itex] defined by
[tex] \phi(f(x),g(x) )=\frac{f(u)}{g(u)} [/tex]
To prove that these two things are isomorphic, check that this is well defined and an isomorphism. The fact that this is well-defined follows from the fact that the equivalence relation here is the same as cross multiplying fractions and the fact that [itex] u [/itex] is transcendental so that [itex] g(u)\neq 0[/itex] for [itex] g\neq 0[/itex]. Similarly, the fact that it is a ring homomorphism is because the addition and subtraction in the quotient field are essentially defined to copy the addition/multiplication of fractions. Finally, surjectivity is obvious and injectivity follows using the fact that [itex] u [/itex] is transcendental.
 
Last edited:
  • Like
Likes PsychonautQQ

FAQ: Basic transcendental field extension question

What is a basic transcendental field extension?

A basic transcendental field extension is a mathematical concept used in abstract algebra. It is a way of extending a field (a set of numbers with operations such as addition and multiplication) by adding new elements, called transcendental elements, that are not solutions to any algebraic equation with coefficients from the original field.

How is a basic transcendental field extension different from an algebraic field extension?

The main difference between a basic transcendental field extension and an algebraic field extension is that transcendental elements cannot be expressed as roots of any polynomial equation with coefficients from the original field. In contrast, algebraic elements can be expressed as roots of such equations.

What are some examples of transcendental elements?

Some examples of transcendental elements include the numbers π (pi) and e, which are not solutions to any polynomial equation with rational coefficients. The variable x is also a transcendental element when considered in the field of rational numbers.

What is the significance of studying basic transcendental field extensions?

Studying basic transcendental field extensions is important in abstract algebra because it allows us to extend the properties and operations of a field to include new elements. It also helps us understand the structure and properties of different types of fields, which has applications in various branches of mathematics, including number theory and algebraic geometry.

How are basic transcendental field extensions used in real-world applications?

Basic transcendental field extensions have many applications in physics, engineering, and computer science. For example, they are used in the development of algorithms for solving differential equations, in coding theory for error correction, and in cryptography for creating secure communication systems. They also have applications in signal processing and control systems.

Similar threads

Back
Top