SlideShare a Scribd company logo
1 of 1
Download to read offline
Let T be a linear operator on an n-dimensional vector space V such that I has n distinct
eigenvalues. Prove that V is a T-cyclic subspace of itsself.
Solution
Proof. If V is T-cyclic, then PT (X) = (1)
dim(V )mT (X). Since T is diagonal-izable,
mT (X) = (X 1)(X 2)....(X n);
where the i
's are the distinct eigenvalues of T. In other words, the algebraic
multiplicity mi of each eigenvalue i
is 1, and since the geometric multiplicity
of i respects the inequality
1 dim(ker (T- iI)) mi;
we see that dim(ker (T iI)) = 1 for all i.
Conversely, suppose that all eigenspaces have dimension 1. Since T is diag-onalizable, the
minimal polynomial splits as
mT (X) = (X 1)(X 2)....(X n)
and V decomposes asV = ker (T- 1I) ker (T- 2I) ... ker (T- nI)where the i's are the distinct
eigenvalues of T. Let vi be an eigenvector as-sociated to i for each i, and let v = v1 + ... + vn.
Since each eigenspace hasdimension 1, fvig is a basis for ker (T iI), and fv1; v2;....vng is a basis
for V .Now let c0; c1; ...; cn1 be scalars such thatc0v + c1T(v) + ... + cn1Tn1(v) = 0:From this
equation, we have0 = c0(v1 + v2 + .. + vn) + .... + cn1(n11v1 + n12v2... + n1nvn)= (c0 + c11 +
... + cn1n11)v1 + ... + (c0 + c1n + ... + cn1n1n)vn:By the linear independence of the vi's, each
iis a root of the polynomialg(X) = c0 + c1X + ... + cn1Xn1.
Since there are n distinct eigenvalues,the degree n 1 polynomial g(X) has n roots and is therefore
zero. Hence,c0 = c1 = .... = cn1 = 0, and fv; T(v); ....; Tn1(v)g is a basis for V .
Thus, theT-cyclic subspace generated by v is none other than V .

More Related Content

Similar to Let T be a linear operator on an n-dimensional vector space V such t.pdf

Signal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier TransformsSignal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier Transforms
Arvind Devaraj
 
PaperNo13-Habibi-IMF
PaperNo13-Habibi-IMFPaperNo13-Habibi-IMF
PaperNo13-Habibi-IMF
Mezban Habibi
 
Hi please complete the following with detailed working out Find the .pdf
Hi please complete the following with detailed working out Find the .pdfHi please complete the following with detailed working out Find the .pdf
Hi please complete the following with detailed working out Find the .pdf
ezhilvizhiyan
 
Conjugate Gradient Methods
Conjugate Gradient MethodsConjugate Gradient Methods
Conjugate Gradient Methods
MTiti1
 
Polyhedral and algebraic method in computational geometry
Polyhedral and algebraic method in computational geometryPolyhedral and algebraic method in computational geometry
Polyhedral and algebraic method in computational geometry
Springer
 
PaperNo16-Habibi-IMF-On Syndetically Hypercyclic Tuples
PaperNo16-Habibi-IMF-On Syndetically Hypercyclic TuplesPaperNo16-Habibi-IMF-On Syndetically Hypercyclic Tuples
PaperNo16-Habibi-IMF-On Syndetically Hypercyclic Tuples
Mezban Habibi
 

Similar to Let T be a linear operator on an n-dimensional vector space V such t.pdf (20)

Imc2017 day2-solutions
Imc2017 day2-solutionsImc2017 day2-solutions
Imc2017 day2-solutions
 
Signal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier TransformsSignal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier Transforms
 
Linear transforamtion and it,s applications.(VCLA)
Linear transforamtion and it,s applications.(VCLA)Linear transforamtion and it,s applications.(VCLA)
Linear transforamtion and it,s applications.(VCLA)
 
Fourier series
Fourier seriesFourier series
Fourier series
 
Interpolation techniques - Background and implementation
Interpolation techniques - Background and implementationInterpolation techniques - Background and implementation
Interpolation techniques - Background and implementation
 
PaperNo13-Habibi-IMF
PaperNo13-Habibi-IMFPaperNo13-Habibi-IMF
PaperNo13-Habibi-IMF
 
Networking Assignment Help
Networking Assignment HelpNetworking Assignment Help
Networking Assignment Help
 
Weight enumerators of block codes and the mc williams
Weight  enumerators of block codes and  the mc williamsWeight  enumerators of block codes and  the mc williams
Weight enumerators of block codes and the mc williams
 
Hi please complete the following with detailed working out Find the .pdf
Hi please complete the following with detailed working out Find the .pdfHi please complete the following with detailed working out Find the .pdf
Hi please complete the following with detailed working out Find the .pdf
 
Linear Algebra
Linear AlgebraLinear Algebra
Linear Algebra
 
Basic Introduction to Algebraic Geometry
Basic Introduction to Algebraic GeometryBasic Introduction to Algebraic Geometry
Basic Introduction to Algebraic Geometry
 
Mathematics for Deep Learning (1)
Mathematics for Deep Learning (1)Mathematics for Deep Learning (1)
Mathematics for Deep Learning (1)
 
Imc2017 day1-solutions
Imc2017 day1-solutionsImc2017 day1-solutions
Imc2017 day1-solutions
 
Lecture_note2.pdf
Lecture_note2.pdfLecture_note2.pdf
Lecture_note2.pdf
 
An Algorithm to Find the Visible Region of a Polygon
An Algorithm to Find the Visible Region of a PolygonAn Algorithm to Find the Visible Region of a Polygon
An Algorithm to Find the Visible Region of a Polygon
 
Conjugate Gradient Methods
Conjugate Gradient MethodsConjugate Gradient Methods
Conjugate Gradient Methods
 
Polyhedral and algebraic method in computational geometry
Polyhedral and algebraic method in computational geometryPolyhedral and algebraic method in computational geometry
Polyhedral and algebraic method in computational geometry
 
02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf
 
02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf
 
PaperNo16-Habibi-IMF-On Syndetically Hypercyclic Tuples
PaperNo16-Habibi-IMF-On Syndetically Hypercyclic TuplesPaperNo16-Habibi-IMF-On Syndetically Hypercyclic Tuples
PaperNo16-Habibi-IMF-On Syndetically Hypercyclic Tuples
 

More from airtechsalesservices

More from airtechsalesservices (20)

Let T R^2 - R^2 be the linear transformation given by T (x.pdf
Let T R^2 - R^2 be the linear transformation given by T (x.pdfLet T R^2 - R^2 be the linear transformation given by T (x.pdf
Let T R^2 - R^2 be the linear transformation given by T (x.pdf
 
Let S^2 and R^2 be the sample variance from two independent samples .pdf
Let S^2 and R^2 be the sample variance from two independent samples .pdfLet S^2 and R^2 be the sample variance from two independent samples .pdf
Let S^2 and R^2 be the sample variance from two independent samples .pdf
 
let S1be a countable set,S2 a set that is not countable, and S1S2. .pdf
let S1be a countable set,S2 a set that is not countable, and S1S2. .pdflet S1be a countable set,S2 a set that is not countable, and S1S2. .pdf
let S1be a countable set,S2 a set that is not countable, and S1S2. .pdf
 
let S1 and S2 be nonempty subspaces of a vector space V. Show sp(S1).pdf
let S1 and S2 be nonempty subspaces of a vector space V. Show sp(S1).pdflet S1 and S2 be nonempty subspaces of a vector space V. Show sp(S1).pdf
let S1 and S2 be nonempty subspaces of a vector space V. Show sp(S1).pdf
 
Let S be a subspace. Prove that S (intersection symbol) S(orthogonal.pdf
Let S be a subspace. Prove that S (intersection symbol) S(orthogonal.pdfLet S be a subspace. Prove that S (intersection symbol) S(orthogonal.pdf
Let S be a subspace. Prove that S (intersection symbol) S(orthogonal.pdf
 
Let S and T be finite sets with n and m elements, respectively. .pdf
Let S and T be finite sets with n and m elements, respectively. .pdfLet S and T be finite sets with n and m elements, respectively. .pdf
Let S and T be finite sets with n and m elements, respectively. .pdf
 
Let S be a non empty subset of the real numbers. Assume that L is th.pdf
Let S be a non empty subset of the real numbers. Assume that L is th.pdfLet S be a non empty subset of the real numbers. Assume that L is th.pdf
Let S be a non empty subset of the real numbers. Assume that L is th.pdf
 
Let S be a bounded set and let GLB(S) be its greatest lower bound. A.pdf
Let S be a bounded set and let GLB(S) be its greatest lower bound. A.pdfLet S be a bounded set and let GLB(S) be its greatest lower bound. A.pdf
Let S be a bounded set and let GLB(S) be its greatest lower bound. A.pdf
 
Let S be a nonempty bounded subset of R. Prove that sup S is unique..pdf
Let S be a nonempty bounded subset of R. Prove that sup S is unique..pdfLet S be a nonempty bounded subset of R. Prove that sup S is unique..pdf
Let S be a nonempty bounded subset of R. Prove that sup S is unique..pdf
 
Let S = { a,b,c,d } and T = { 1,2,3,4,5,6,7 }. How many functions a.pdf
Let S = { a,b,c,d } and T = { 1,2,3,4,5,6,7 }.  How many functions a.pdfLet S = { a,b,c,d } and T = { 1,2,3,4,5,6,7 }.  How many functions a.pdf
Let S = { a,b,c,d } and T = { 1,2,3,4,5,6,7 }. How many functions a.pdf
 
Let R be the ring of 2 × 2 matrices of the form a b 0 0 wh.pdf
Let R be the ring of 2 × 2 matrices of the form a b 0 0 wh.pdfLet R be the ring of 2 × 2 matrices of the form a b 0 0 wh.pdf
Let R be the ring of 2 × 2 matrices of the form a b 0 0 wh.pdf
 
Let R be a commutative ring with unity and let I,J be two ideals of .pdf
Let R be a commutative ring with unity and let I,J be two ideals of .pdfLet R be a commutative ring with unity and let I,J be two ideals of .pdf
Let R be a commutative ring with unity and let I,J be two ideals of .pdf
 
Let p, q, and r be the following statements p Jamie is on the .pdf
Let p, q, and r be the following statements     p Jamie is on the .pdfLet p, q, and r be the following statements     p Jamie is on the .pdf
Let p, q, and r be the following statements p Jamie is on the .pdf
 
Let p, q, and r be the following statements p Jamie is on the .pdf
Let p, q, and r be the following statements p Jamie is on the .pdfLet p, q, and r be the following statements p Jamie is on the .pdf
Let p, q, and r be the following statements p Jamie is on the .pdf
 
Let P(x) be hte statement x=x2 if the domain consists of the int.pdf
Let P(x) be hte statement x=x2 if the domain consists of the int.pdfLet P(x) be hte statement x=x2 if the domain consists of the int.pdf
Let P(x) be hte statement x=x2 if the domain consists of the int.pdf
 
Let H and K be finite abelian groups and let G be an infinite abelia.pdf
Let H and K be finite abelian groups and let G be an infinite abelia.pdfLet H and K be finite abelian groups and let G be an infinite abelia.pdf
Let H and K be finite abelian groups and let G be an infinite abelia.pdf
 
Let n be a non-negative integer and a and c be positive numbers. Use.pdf
Let n be a non-negative integer and a and c be positive numbers. Use.pdfLet n be a non-negative integer and a and c be positive numbers. Use.pdf
Let n be a non-negative integer and a and c be positive numbers. Use.pdf
 
Let G be a group. Recall that an automorphism of G is an isomorphi.pdf
Let G be a group. Recall that an automorphism of G is an isomorphi.pdfLet G be a group. Recall that an automorphism of G is an isomorphi.pdf
Let G be a group. Recall that an automorphism of G is an isomorphi.pdf
 
Let G be a group, G = n in N, and H is a subset of G. Then all tha.pdf
Let G be a group, G = n in N, and H is a subset of G. Then all tha.pdfLet G be a group, G = n in N, and H is a subset of G. Then all tha.pdf
Let G be a group, G = n in N, and H is a subset of G. Then all tha.pdf
 
Let I and J be ideals in a ring R.Solution H.pdf
Let I and J be ideals in a ring R.Solution                     H.pdfLet I and J be ideals in a ring R.Solution                     H.pdf
Let I and J be ideals in a ring R.Solution H.pdf
 

Recently uploaded

Beyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global ImpactBeyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global Impact
PECB
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
heathfieldcps1
 
Seal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptxSeal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptx
negromaestrong
 
Making and Justifying Mathematical Decisions.pdf
Making and Justifying Mathematical Decisions.pdfMaking and Justifying Mathematical Decisions.pdf
Making and Justifying Mathematical Decisions.pdf
Chris Hunter
 

Recently uploaded (20)

Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
ICT role in 21st century education and it's challenges.
ICT role in 21st century education and it's challenges.ICT role in 21st century education and it's challenges.
ICT role in 21st century education and it's challenges.
 
ComPTIA Overview | Comptia Security+ Book SY0-701
ComPTIA Overview | Comptia Security+ Book SY0-701ComPTIA Overview | Comptia Security+ Book SY0-701
ComPTIA Overview | Comptia Security+ Book SY0-701
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introduction
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
Class 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdfClass 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdf
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104
 
Beyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global ImpactBeyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global Impact
 
ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptx
 
Food Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-II
Food Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-IIFood Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-II
Food Chain and Food Web (Ecosystem) EVS, B. Pharmacy 1st Year, Sem-II
 
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
 
Measures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SDMeasures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SD
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
 
This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning ExhibitSociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
 
Seal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptxSeal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptx
 
Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...
Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...
Ecological Succession. ( ECOSYSTEM, B. Pharmacy, 1st Year, Sem-II, Environmen...
 
Making and Justifying Mathematical Decisions.pdf
Making and Justifying Mathematical Decisions.pdfMaking and Justifying Mathematical Decisions.pdf
Making and Justifying Mathematical Decisions.pdf
 

Let T be a linear operator on an n-dimensional vector space V such t.pdf

  • 1. Let T be a linear operator on an n-dimensional vector space V such that I has n distinct eigenvalues. Prove that V is a T-cyclic subspace of itsself. Solution Proof. If V is T-cyclic, then PT (X) = (1) dim(V )mT (X). Since T is diagonal-izable, mT (X) = (X 1)(X 2)....(X n); where the i 's are the distinct eigenvalues of T. In other words, the algebraic multiplicity mi of each eigenvalue i is 1, and since the geometric multiplicity of i respects the inequality 1 dim(ker (T- iI)) mi; we see that dim(ker (T iI)) = 1 for all i. Conversely, suppose that all eigenspaces have dimension 1. Since T is diag-onalizable, the minimal polynomial splits as mT (X) = (X 1)(X 2)....(X n) and V decomposes asV = ker (T- 1I) ker (T- 2I) ... ker (T- nI)where the i's are the distinct eigenvalues of T. Let vi be an eigenvector as-sociated to i for each i, and let v = v1 + ... + vn. Since each eigenspace hasdimension 1, fvig is a basis for ker (T iI), and fv1; v2;....vng is a basis for V .Now let c0; c1; ...; cn1 be scalars such thatc0v + c1T(v) + ... + cn1Tn1(v) = 0:From this equation, we have0 = c0(v1 + v2 + .. + vn) + .... + cn1(n11v1 + n12v2... + n1nvn)= (c0 + c11 + ... + cn1n11)v1 + ... + (c0 + c1n + ... + cn1n1n)vn:By the linear independence of the vi's, each iis a root of the polynomialg(X) = c0 + c1X + ... + cn1Xn1. Since there are n distinct eigenvalues,the degree n 1 polynomial g(X) has n roots and is therefore zero. Hence,c0 = c1 = .... = cn1 = 0, and fv; T(v); ....; Tn1(v)g is a basis for V . Thus, theT-cyclic subspace generated by v is none other than V .