Lecture 5: Span, linear independence, bases, and dimension



Similar documents
Convexity, Inequalities, and Norms

Chapter 5: Inner Product Spaces

Properties of MLE: consistency, asymptotic normality. Fisher information.

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

Asymptotic Growth of Functions

Overview of some probability distributions.

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

1. MATHEMATICAL INDUCTION

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Theorems About Power Series

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

CS103X: Discrete Structures Homework 4 Solutions

THE ABRACADABRA PROBLEM

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

Lecture 4: Cheeger s Inequality


4.3. The Integral and Comparison Tests

Infinite Sequences and Series

Maximum Likelihood Estimators.

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

A probabilistic proof of a binomial identity

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

3. Greatest Common Divisor - Least Common Multiple

Sequences and Series

3 Basic Definitions of Probability Theory

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 7 Methods of Finding Estimators

Metric, Normed, and Topological Spaces

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

Factors of sums of powers of binomial coefficients

A Note on Sums of Greatest (Least) Prime Factors

Output Analysis (2, Chapters 10 &11 Law)

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

Class Meeting # 16: The Fourier Transform on R n

2 MATH 101B: ALGEBRA II, PART D: REPRESENTATIONS OF GROUPS

1 Correlation and Regression Analysis

5 Boolean Decision Trees (February 11)

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

Permutations, the Parity Theorem, and Determinants

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

1 Computing the Standard Deviation of Sample Means

Irreducible polynomials with consecutive zero coefficients

Lesson 17 Pearson s Correlation Coefficient

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Section 11.3: The Integral Test

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Partial Di erential Equations

I. Chi-squared Distributions

INFINITE SERIES KEITH CONRAD

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Normal Distribution.

Analysis Notes (only a draft, and the first one!)

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

MARTINGALES AND A BASIC APPLICATION

Hypothesis testing. Null and alternative hypotheses

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK

Degree of Approximation of Continuous Functions by (E, q) (C, δ) Means

Department of Computer Science, University of Otago

How To Understand The Theory Of Coectedess

4. Trees. 4.1 Basics. Definition: A graph having no cycles is said to be acyclic. A forest is an acyclic graph.

S. Tanny MAT 344 Spring be the minimum number of moves required.

LECTURE NOTES ON DONSKER S THEOREM

1. C. The formula for the confidence interval for a population mean is: x t, which was

Overview on S-Box Design Principles

Soving Recurrence Relations

Entropy of bi-capacities

, a Wishart distribution with n -1 degrees of freedom and scale matrix.

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

NOTES ON PROBABILITY Greg Lawler Last Updated: March 21, 2016

A Recursive Formula for Moments of a Binomial Distribution

How To Solve An Old Japanese Geometry Problem

2. Degree Sequences. 2.1 Degree Sequences


PART TWO. Measure, Integration, and Differentiation

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

1 The Gaussian channel

EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES

T ( a i x i ) = a i T (x i ).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

SOME GEOMETRY IN HIGH-DIMENSIONAL SPACES

Inequalities for the surface area of projections of convex bodies

Incremental calculation of weighted mean and variance

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Statistical inference: example 1. Inferential Statistics

MEI Structured Mathematics. Module Summary Sheets. Statistics 2 (Version B: reference to new book)

Ekkehart Schlicht: Economic Surplus and Derived Demand

Some Inequalities for p-geominimal Surface Area and Related Results

Vector Spaces C H A P T E R 2

Transcription:

Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.; More geerally, what does it mea that F ad F{0, 1,..., 1 } have dimesio? What does it mea to be ifiite-dimesioal? To uderstad the relatioship betwee vector spaces ad special spaig lists. Mai goals: dimesio. To uderstad spa, liear idepedece, bases, ad Spa Fix a field F throughout. Recall from last time ad the homework: Defiitio 1. Let v 1,..., v V. Spa(v 1,..., v ) = {λ 1 v 1 + + λ v λ 1,..., λ F}. Defiitio 2. A vector space V is fiite-dimesioal if V = Spa(v 1,..., v ) for some v 1,..., v V ad some 1. Defiitio 3. The dimesio dim(v ) of a fiite-dimesioal vector space is the miimum such that V = Spa(v 1,..., v ). Fiite-dimesioal examples Let V = R 3. The V = Spa((1, 0, 0), (0, 1, 0), (0, 0, 1)). So dim(v ) 3. If V = Spa(v 1,..., v ), the also V = Spa(v 1,..., v, 0). Also, for all v V, V = Spa(v 1,..., v, v). 1

We have F = Spa(δ 1,..., δ ) where δ i = (0, 0,..., 0, 1, 0, 0,..., 0), with 1 i the i-th coordiate ad 0 elsewhere. So, dim(f ). Similarly, F{0, 1,..., 1 } = Spa(δ 0, δ 1,..., δ 1 ). So, dim(f{0, 1,..., 1 }). Ifiite-dimesioal examples The vector space of polyomials P(F). Cotiuous fuctios [0, 1] R. Ifiite lists F. F(X) where X is ifiite. We ca prove the first directly (x d+1 does ot appear i ay fiite list of polyomials of maximum degree d). Secod oe: homework problem (!) Last two: There are liearly idepedet lists of arbitrary legth. We will show that, if V is fiite-dimesioal, the liearly idepedet lists are at most dim V i size. Liear (i)depedece Recall from last time: Defiitio 4. A liearly idepedet list of vectors (v 1,..., v ) is oe such that, if λ 1 v 1 + + λ v = 0, the λ 1 = = λ = 0. A list which is ot liearly idepedet is liearly depedet. The, λ 1 v 1 + + λ v = 0 for some λ i which are ot all zero. Examples: ((v 1,..., v, 0)) is always liearly depedet. For every vector space V ad ozero vector v V, (v) is liearly idepedet. I R 2, ((1, 0), (1, 1)) is liearly idepedet. I F, the list ((1, 0, 0,..., 0), (0, 1, 0,..., 0),..., (0, 0,..., 0, 1)) is liearly idepedet. Similarly (δ 0, δ 1,..., δ 1 ) i F{0, 1,..., 1 }. 2

Reducig spaig lists to liearly idepedet oes Lemma 5 (Lemma 2.4 + more). Let V = Spa(v 1,..., v ). The, (v 1,..., v ) is liearly idepedet if ad oly if, for all i, Spa(v 1,..., v i 1, v i+1,..., v ) Spa(v 1,..., v ). (1.1) I other words, a spaig list is liearly idepedet if ad oly if it is miimal. Examples: (1, 0), (0, 1) is a miimal spaig list, hece liearly idepedet. Same is true for (1, 0), (1, 1), or ay spaig list of two vectors i R 2. If the zero vector is i a spaig list, it is ot miimal (hece liearly depedet). Defiitio 6. A liearly idepedet spaig set is called a basis. By the lemma, every spaig set ca be reduced to a basis (Theorem 2.10). Just discard vectors util (1.1) is true! Maximal liearly idepedet lists Lemma 7 (Part of Theorem 2.12). A liearly idepedet list (v 1,..., v ) of vectors of V spas V if ad oly if it is maximal: (v 1,..., v, v) is ot liearly idepedet for all v V. Examples: (1, 0, 0), (1, 1, 0) is liearly idepedet, but ot maximal. (1, 1), ( 2, 1) is a maximal liearly idepedet list, hece it spas. Ay liearly idepedet list which does ot spa ca be ex- Cosequece: teded. The fudametal iequality ad bases Theorem 8 (Theorem 2.6). The legth of every liearly idepedet list is less tha or equal to the legth of every spaig list. Corollary 9 (Theorem 2.14). Every basis has the same legth. Proof. Let (v 1,..., v m ) ad (w 1,..., w ) be bases. Sice (v 1,..., v m ) is liearly idepedet ad (w 1,..., w ) spas, m. Sice (v 1,..., v m ) spas ad (w 1,..., w ) is liearly idepedet, m. 3

Bases, cotiued Corollary 10 (Corollary 2.11 + more). Every fiite-dimesioal vector space V has a basis, ad every basis has legth dim V. Proof. Every spaig list of legth dim V must be miimal, hece liearly idepedet, i.e., a basis. By the previous corollary, all bases have the same legth. Corollary 11 (Theorem 2.12). Every liearly idepedet list i a fiitedimesioal vector space ca be exteded to a basis. Proof. Liearly idepedet lists i V of legth < dim V do t spa, so ca be exteded. Liearly idepedet lists of legth dim V must have legth exactly dim V. Thus, they are maximal ad spa. Examples For R 2, every pair of ozero vectors, either of which is a multiple of the other, is a basis. I F, the delta vectors form a basis. Also ay li. id. list of legth (or ay spaig list of legth ). I F{0, 1,..., 1 }, agai, the delta fuctios form a basis. For F = C, aother basis importat for Fourier trasform: {1, e 2πit, e 4πit,..., e 2( 1)πit, where e iy = cos(y) + i si(y). Lots of bases importat for MP3s, auto-tue, DVDs, etc! The basis theorem Theorem 12 (Propositios 2.8, 2.16, ad 2.17). The followig coditios for a list (v 1,..., v ) i V are equivalet: (a) It is a basis. (b) It is liearly idepedet of legth dim V. (c) It is spaig of legth dim V. (d) For all v V, there exist uique λ 1,..., λ such that v = λ 1 v 1 + +λ v. Proof. By the corollary, (a) implies (b) ad (c). (b) implies (a) sice liearly idepedet sets of legth dim V are maximal. Similarly, (c) implies (a) sice spaig sets of legth dim V are miimal. (a) implies (d): There exist λ 1,..., λ sice v 1,..., v spa. uique by liear idepedece. They are 4

Dimesio Theorem 13 (Propositios 2.7 ad 2.15). If V is fiite-dimesioal ad U V is a subspace, the U is fiite-dimesioal, ad dim U dim V. Proof. Ay liearly idepedet list i U is also liearly idepedet i V, so has legth at most dim V. So, there is a maximal such list, which must be a basis. Sice it has legth at most dim V, we obtai that dim U dim V. 5