Matrix Exponent Problem: Find smallest n such that Sn = I

In summary, the conversation discusses the matrix S, which represents a certain kind of transformation. The question is whether there exists a positive integer n such that Sn is equal to the 2x2 identity matrix. The conversation explores the idea of multiplying S by itself, denoted as S2, S3, etc., to find the smallest integer that satisfies this condition. It is suggested to think about what these multiples of S do to a vector they multiply, using standard trigonometric identities.
  • #1
DmytriE
78
0

Homework Statement


Consider the matrix

cos(3*pi/17) -sin(3*pi/17)
S = sin(3*pi/17) cos(3*pi/17)

Does there exist a positive integer n such that Sn = I where I is the 2x2 identity? If so, what is the smallest such integer? Explain.

Excuse the poor matrix formatting. I do not know how to use the latex formatting to put it into pretty print.

Homework Equations


Not sure...


The Attempt at a Solution



Where should I start? I really have no idea.
 
Physics news on Phys.org
  • #2
Hi DmytriE! :smile:

Hint: suppose S is

Code:
cosθ -sinθ
sinθ cosθ

What is S2 ? S3 ? etc? :wink:
 
  • #3
Let's suppose that n = 10. I don't think I have to multiply S by S 10 times to get the answer. Unfortunately the answer is not 10. How would S2, S3 help me figure it out?

S2:
UL:cos2(θ) - sin2(θ)
UR: -2sin(θ)cos(θ)
LL: 2sin(θ)cos(θ)
LR: -sin2(θ)+cos2(θ)

Each abbreviation represent the place in the matrix that they would appear. UL - Upper left, etc.

S3:
Alot of sines and cosines.
 
  • #4
That's not what tiny-tim is suggesting. Your matrix represents a certain kind of transformation.

Instead of thinking about what S, S2, S3, etc. are (in terms of their matrix representations), think about what they do to a vector they multiply.
 
  • #5
Thanks for the help! This forum really is the best!
 
  • #6
Hi DmytriE! :smile:

(just got up :zzz:)
DmytriE said:
S2:
UL:cos2(θ) - sin2(θ)
UR: -2sin(θ)cos(θ)
LL: 2sin(θ)cos(θ)
LR: -sin2(θ)+cos2(θ)

have you got it now?

if not, use standard trigonometric identities :wink:
 

FAQ: Matrix Exponent Problem: Find smallest n such that Sn = I

What is the Matrix Exponent Problem?

The Matrix Exponent Problem is a mathematical problem that involves finding the smallest positive integer n such that the matrix Sn is equal to the identity matrix I.

Why is the Matrix Exponent Problem important?

The Matrix Exponent Problem has significant applications in various fields such as computer science, physics, and engineering. It is used in the analysis of algorithms, control theory, and differential equations.

How do you solve the Matrix Exponent Problem?

To solve the Matrix Exponent Problem, you can use the Jordan canonical form theorem, which states that any square matrix can be transformed into a diagonal matrix by a suitable change of basis. Using this theorem, we can easily calculate the powers of a matrix and find the smallest n that satisfies Sn = I.

What are the limitations of solving the Matrix Exponent Problem?

One limitation of solving the Matrix Exponent Problem is that it can be computationally expensive, especially for large matrices. Additionally, there may not always exist a finite n that satisfies Sn = I, in which case the problem is unsolvable.

Are there any real-world applications of the Matrix Exponent Problem?

Yes, the Matrix Exponent Problem has various real-world applications. For example, it is used in the design and analysis of control systems, such as in robotics and aircraft navigation. It is also used in cryptography, where it is used to calculate the powers of matrices in encryption and decryption algorithms.

Similar threads

Replies
18
Views
3K
Replies
6
Views
940
Replies
2
Views
2K
Replies
2
Views
8K
Replies
1
Views
912
Back
Top