How to Prove the Determinant of a Cosine Matrix?

  • Thread starter Thread starter Nobody1111
  • Start date Start date
  • Tags Tags
    Determinant
Nobody1111
Messages
5
Reaction score
0
Proof, that determinant (with n rows and columns)

| cosx 1 0 0 ... 0 0 |
| 1 2cosx 1 0 ... 0 0 |
| 0 1 2cosx 1 ... 0 0 |
| 0 0 1 2cosx ... 0 0 | = cos nx
|...... |
| 0 0 0 0 ... 2cosx 1 |
| 0 0 0 0 ... 1 2cosx |

The main proble for me is to evaluate this determinant.

Do you have any ideas?

Thanks for help.
 
Physics news on Phys.org
It looks a lot like you want to use induction on the number of rows&columns.
 


The determinant of a matrix can be calculated by multiplying the elements along any row or column by their corresponding cofactors and then summing the products. In this case, we can use the first row to calculate the determinant. Let's call this determinant D.

We can see that the first row has only one non-zero term, cosx. We can use this to our advantage by expanding the determinant along the first row. This means that we will multiply the element cosx by its corresponding cofactor and then add it to the determinant of the remaining submatrix (formed by removing the first row and column).

So, we have:

D = cosx * cofactor + determinant of submatrix

Now, let's look at the cofactor. The cofactor of cosx is (-1)^2 * determinant of the submatrix formed by removing the first row and column. We can see that this submatrix is exactly the same as the original matrix, just with a smaller size (n-1 rows and columns). So, the cofactor is (-1)^2 * D.

Substituting this into our original equation, we get:

D = cosx * (-1)^2 * D + determinant of submatrix

Simplifying, we get:

D = cosx * D + determinant of submatrix

Now, let's focus on the determinant of the submatrix. We can see that it is the same as the original matrix, just with a smaller size (n-1 rows and columns). So, we can use the same process again to evaluate this determinant. Expanding along the first row, we get:

determinant of submatrix = cosx * cofactor + determinant of sub-submatrix

Substituting this into our original equation, we get:

D = cosx * D + cosx * cofactor + determinant of sub-submatrix

We can continue this process until we reach the determinant of a 2x2 matrix, which is simply (2cosx)^2 - 1. Substituting this back into our equation, we get:

D = cosx * D + cosx * (-1)^n * (2cosx)^2 - 1

Simplifying, we get:

D = cosx * D + (-1)^n * (4cos^2x - 1)

Now, we can solve for D by rearranging the equation:

D - cosx * D = (-1)^
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top