Beruflich Dokumente
Kultur Dokumente
Bases
Algebras
Vector Spaces
Bases
Algebras
Introduction
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms (R is the complete, totally ordered eld).
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms (R is the complete, totally ordered eld). 2. We have noted that C has all the properties we would like when in comes to solving polynomial equations
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms (R is the complete, totally ordered eld). 2. We have noted that C has all the properties we would like when in comes to solving polynomial equations (Fundamental Theorem of Algebra).
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms (R is the complete, totally ordered eld). 2. We have noted that C has all the properties we would like when in comes to solving polynomial equations (Fundamental Theorem of Algebra). 3. What other (useful) elds are there beyond R and C?
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms (R is the complete, totally ordered eld). 2. We have noted that C has all the properties we would like when in comes to solving polynomial equations (Fundamental Theorem of Algebra). 3. What other (useful) elds are there beyond R and C? 4. To answer this question, we rst need to talk about vector spaces and algebras.
Vector Spaces
Bases
Algebras
Introduction
1. We have seen that R is uniquely determined (up to isomorphism) by its axioms (R is the complete, totally ordered eld). 2. We have noted that C has all the properties we would like when in comes to solving polynomial equations (Fundamental Theorem of Algebra). 3. What other (useful) elds are there beyond R and C? 4. To answer this question, we rst need to talk about vector spaces and algebras. 5. As we work with vector spaces, we prove a few results that will be helpful when discussing the unsolvability of the quintic by radicals.
logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Denition.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z).
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x. 3. There is an element 0 X so that for all x X we have x + 0 = x.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x. 3. There is an element 0 X so that for all x X we have x + 0 = x. 4. For every x X there is a (x) X so that x + (x) = 0.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x. 3. There is an element 0 X so that for all x X we have x + 0 = x. 4. For every x X there is a (x) X so that x + (x) = 0. 5. For all x, y X and F we have (x + y) = x + y.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x. 3. There is an element 0 X so that for all x X we have x + 0 = x. 4. For every x X there is a (x) X so that x + (x) = 0. 5. For all x, y X and F we have (x + y) = x + y. 6. For all x X and , F we have ( + ) x = x + x.
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x. 3. There is an element 0 X so that for all x X we have x + 0 = x. 4. For every x X there is a (x) X so that x + (x) = 0. 5. For all x, y X and F we have (x + y) = x + y. 6. For all x X and , F we have ( + ) x = x + x. 7. For all x X and , F we have ( x) = ( ) x.
Bernd Schr oder Beyond Fields: Vector Spaces and Algebras logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Denition. A vector space over the eld F is a triple (X , +, ) of a set X and two binary operations, vector addition + : X X X and scalar multiplication : F X X, so that the following hold. 1. For all x, y, z X we have (x + y) + z = x + (y + z). 2. For all x, y X we have x + y = y + x. 3. There is an element 0 X so that for all x X we have x + 0 = x. 4. For every x X there is a (x) X so that x + (x) = 0. 5. For all x, y X and F we have (x + y) = x + y. 6. For all x X and , F we have ( + ) x = x + x. 7. For all x X and , F we have ( x) = ( ) x. 8. For all x X we have 1 x = x.
Bernd Schr oder Beyond Fields: Vector Spaces and Algebras logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Denition.
Vector Spaces
Bases
Algebras
Denition. An element of a vector space is also called a vector and an element of F is also called a scalar.
Vector Spaces
Bases
Algebras
Denition. An element of a vector space is also called a vector and an element of F is also called a scalar. We will usually refer to the set X as the vector space.
Vector Spaces
Bases
Algebras
Denition. An element of a vector space is also called a vector and an element of F is also called a scalar. We will usually refer to the set X as the vector space. As is customary for multiplications, the dot is usually omitted.
Vector Spaces
Bases
Algebras
Example.
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x)
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x)
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F. For example, for all x D we have that (f + g)(x)
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F. For example, for all x D we have that (f + g)(x) = f (x) + g(x)
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F. For example, for all x D we have that (f + g)(x) = f (x) + g(x) = g(x) + f (x)
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F. For example, for all x D we have that (f + g)(x) = f (x) + g(x) = g(x) + f (x) = (g + f )(x).
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F. For example, for all x D we have that (f + g)(x) = f (x) + g(x) = g(x) + f (x) = (g + f )(x). The neutral element for addition is the function that is equal to 0 F for all x X.
Vector Spaces
Bases
Algebras
Example. Let d N and let F be a eld. The set Fd := (x1 , . . . , xd ) : xi F with componentwise addition and scalar multiplication is a vector space. Example. Let D be a set and let F be a eld. The set F (D, F) of all functions f : D F with addition dened pointwise by (f + g)(x) := f (x) + g(x) and scalar multiplication dened pointwise by ( f )(x) := f (x) is a vector space. All properties follow from the corresponding pointwise properties for F. For example, for all x D we have that (f + g)(x) = f (x) + g(x) = g(x) + f (x) = (g + f )(x). The neutral element for addition is the function that is equal to 0 F for all x X.
Vector Spaces
Bases
Algebras
Denition.
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space. A subset S X \ {0} is called linearly independent iff for all nite subsets {x1 , . . . , xn } S and all sets of scalars {1 , . . . , n } F the
n
equation
i=1
ixi = 0 implies 1 = 2 = = n = 0.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space. A subset S X \ {0} is called linearly independent iff for all nite subsets {x1 , . . . , xn } S and all sets of scalars {1 , . . . , n } F the
n
equation
n
i=1
ixi = 0 implies 1 = 2 = = n = 0.
A sum
i=1
combination of x1 , . . . , xn .
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space. A subset S X \ {0} is called linearly independent iff for all nite subsets {x1 , . . . , xn } S and all sets of scalars {1 , . . . , n } F the
n
equation
n
i=1
ixi = 0 implies 1 = 2 = = n = 0.
A sum
i=1
combination of x1 , . . . , xn . Denition.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space. A subset S X \ {0} is called linearly independent iff for all nite subsets {x1 , . . . , xn } S and all sets of scalars {1 , . . . , n } F the
n
equation
n
i=1
ixi = 0 implies 1 = 2 = = n = 0.
A sum
i=1
combination of x1 , . . . , xn . Denition. A linearly independent set B X such that for every x X there are a nite subset {b1 , . . . , bn } B and a set of
n
i=1
Vector Spaces
Bases
Algebras
Example.
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero.
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd .
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence:
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei .
(j)
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 (j)
iei = 0
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 d i=1 (j)
iei
(j)
=0
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 d i=1 (j)
iei
(j)
= 0, which
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 d i=1 (j)
iei
(j)
= 0, which
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 d i=1 (j)
iei
(j)
= 0, which
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 d i=1 (j)
iei
(j)
= 0, which
for each j simply state that j = 0, as was to be proved. Representation of elements: For each x = (x1 , . . . , xd ) Fd we have that x = (x1 , . . . , xd ) = xi ei .
i=1
Vector Spaces
Bases
Algebras
Example. In Fd , let ei denote the vector such that the ith component is 1 and all other components are zero. Then {e1 , . . . , ed } is a base of Fd . Linear independence: For each i = 1, . . . , d let ei denote the jth component of ei . Then for any 1 , . . . , d the vector equation
d i=1 d i=1 (j)
iei
(j)
= 0, which
for each j simply state that j = 0, as was to be proved. Representation of elements: For each x = (x1 , . . . , xd ) Fd we have that x = (x1 , . . . , xd ) = xi ei .
i=1
Vector Spaces
Bases
Algebras
Theorem.
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F.
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F.
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof.
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X .
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F .
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. elements than F , then L
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F .
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise).
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise)
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise), so H = 0. /
logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise), so H = 0. / Hence, C has more elements than F .
logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise), so H = 0. / Hence, C has more elements than F . Because b F , we obtain (L \ {b}) H F
Bernd Schr oder Beyond Fields: Vector Spaces and Algebras logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise), so H = 0. / Hence, C has more elements than F . Because b F , we obtain (L \ {b}) H F = (L F ) H
Bernd Schr oder Beyond Fields: Vector Spaces and Algebras logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise), so H = 0. / Hence, C has more elements than F . Because b F , we obtain (L \ {b}) H F = (L F ) H > |L F |
Bernd Schr oder Beyond Fields: Vector Spaces and Algebras logo1 Louisiana Tech University, College of Engineering and Science
Vector Spaces
Bases
Algebras
Theorem. Let X be a vector space with a nite base F. Then every linearly independent subset L of X has at most as many elements as F. Moreover, all bases of X have as many elements as F. Proof. Let F = {f1 , . . . , fn } be a nite base of X . Suppose for a contradiction that there is a linearly independent set L X that has more elements than F . WLOG assume that L is such that if is another linearly independent subset of X with more L F |L F |. Let b L \ F and elements than F , then L consider the linearly independent sets L \ {b} and F . There is a subset H F \ L so that C := L \ {b} H is a base of X (good exercise). But L \ {b} is not a base of X (good exercise), so H = 0. / Hence, C has more elements than F . Because b F , we obtain (L \ {b}) H F = (L F ) H > |L F |, a contradiction. logo1
Vector Spaces
Bases
Algebras
Proof (concl.).
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F .
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F . Now, if B is another base of X
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F . Now, if B is another base of X , then |B| |F |.
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F . Now, if B is another base of X , then |B| |F |. Therefore B is nite.
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F . Now, if B is another base of X , then |B| |F |. Therefore B is nite. With the same argument as above, if L X is linearly independent, then |L| |B|.
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F . Now, if B is another base of X , then |B| |F |. Therefore B is nite. With the same argument as above, if L X is linearly independent, then |L| |B|. Because F is linearly independent, we obtain |F | |B|, and hence |F | = |B|.
Vector Spaces
Bases
Algebras
Proof (concl.). Thus no linearly independent subset of X has more elements than F . Now, if B is another base of X , then |B| |F |. Therefore B is nite. With the same argument as above, if L X is linearly independent, then |L| |B|. Because F is linearly independent, we obtain |F | |B|, and hence |F | = |B|.
Vector Spaces
Bases
Algebras
Denition.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition. 3. For all F and all x, y X we have that (xy) = ( x)y = x( y).
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition. 3. For all F and all x, y X we have that (xy) = ( x)y = x( y). Example.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition. 3. For all F and all x, y X we have that (xy) = ( x)y = x( y). Example. Let D be a set and let F be a eld.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition. 3. For all F and all x, y X we have that (xy) = ( x)y = x( y). Example. Let D be a set and let F be a eld. The vector space F (D, F) of all functions f : D F is an algebra with the multiplication operation dened pointwise by (f g)(x) := f (x) g(x).
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition. 3. For all F and all x, y X we have that (xy) = ( x)y = x( y). Example. Let D be a set and let F be a eld. The vector space F (D, F) of all functions f : D F is an algebra with the multiplication operation dened pointwise by (f g)(x) := f (x) g(x). All properties follow from the corresponding pointwise properties for elements of elds.
Vector Spaces
Bases
Algebras
Denition. Let X be a vector space over the eld F and let : X X X be a binary operation. Then (X , ) is called an algebra iff 1. The multiplication operation is associative, and 2. Multiplication is left- and right distributive over addition. 3. For all F and all x, y X we have that (xy) = ( x)y = x( y). Example. Let D be a set and let F be a eld. The vector space F (D, F) of all functions f : D F is an algebra with the multiplication operation dened pointwise by (f g)(x) := f (x) g(x). All properties follow from the corresponding pointwise properties for elements of elds.
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras
Vector Spaces
Bases
Algebras