Prove that an element is algebraic over a field extension

TopCat
Messages
55
Reaction score
0

Homework Statement


Let F|K be a field extension. If v e F is algebraic over K(u) for some u e F and v is transcendental over K, then u is algebraic over K(v).

Homework Equations


v transcendental over K implies K(v) iso to K(x).
Know also that there exists f e K(u)[x] with f(v) = 0.

The Attempt at a Solution


Want to show that there exists h e K(v)[x] with h(u) = 0.
I'm trying to find this directly since I don't see a contrapositive proof working out. I feel like I should use v alg|K(u) to get that K(u)(v) \cong K(u)[x]/(f) though I'm not sure how to get to that h in K(v)[x]. Somehow pass to that quotient field and show that u is a root of some remainder polynomial of f?
 
Physics news on Phys.org
Hint: K(u,v) is finite over K(u).
 
Thanks for the help, morphism.

So then I have [K(u,v):K] = [K(u,v):K(v)][K(v):K] = [K(u,v):K(u)][K(u):K] = n[K(u):K]. Since v trans|K, [K(v):K] is inf, and by equality [K(u):K] must be inf. But this means that u is trans|K, so there is an isomorphism from K(u) → K(v) mapping u → v. But this implies u is alg|K(v). Is that right, or did I get off track somewhere?
 
My only objection is to the sentence "But this implies u is alg|K(v)."

How did you arrive at this conclusion?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top