Linear algebra, field morphisms and linear independence

Click For Summary
SUMMARY

The discussion focuses on proving the linear independence of field morphisms f1, f2, ..., fn from field K to field L, under the condition that fi != fj for all i ≠ j. It is established that since each fi is a field morphism, the kernel of each morphism is zero, confirming their injectivity. The approach suggested involves starting with small values of n (specifically n=1 and n=2) to build a foundation for a general proof or to apply mathematical induction.

PREREQUISITES
  • Understanding of field morphisms and their properties
  • Knowledge of linear independence in vector spaces
  • Familiarity with kernels and injective functions in linear algebra
  • Basic principles of mathematical induction
NEXT STEPS
  • Study the properties of field morphisms in detail
  • Learn about linear independence in vector spaces
  • Explore the concept of kernels in linear transformations
  • Review mathematical induction techniques for proofs
USEFUL FOR

Students and educators in advanced linear algebra, mathematicians focusing on field theory, and anyone interested in the properties of linear transformations and their applications in abstract algebra.

mariang
Messages
1
Reaction score
0

Homework Statement


Let f1,f2, ..., fn : K -> L be field morphisms. We know that fi != fj when i != j, for any i and j = {1,...,n}. Prove that f1,f2, ..., fn are linear independent / K.

Homework Equations


f1, ..., fn are field morphisms => Ker (fi) = 0 (injective)

The Attempt at a Solution


I tried to use the linearity and the injectivity but i got stuck.
 
Physics news on Phys.org
mariang said:

Homework Statement


Let f1,f2, ..., fn : K -> L be field morphisms. We know that fi != fj when i != j, for any i and j = {1,...,n}. Prove that f1,f2, ..., fn are linear independent / K.

Homework Equations


f1, ..., fn are field morphisms => Ker (fi) = 0 (injective)

The Attempt at a Solution


I tried to use the linearity and the injectivity but i got stuck.
In such cases it is often helpful to start with ##n=1## and ##n=2## to see how possible arguments work. From there one can either proceed by a general ##n## or per induction. I assume we also have to require ##f_i \neq 0\,.##
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
0
Views
554
  • · Replies 8 ·
Replies
8
Views
13K
  • · Replies 28 ·
Replies
28
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K