Determinant of a matrix over the integers mod n

In summary, the conversation discusses whether the statement \det_{\mathbb{Z}_n}M = (\det_{\mathbb{R}}M)\mod n holds true for all prime numbers n. It is clarified that the notation \mathbb{R} should be used instead of JamesZ and that the determinant should be taken over the ring F. It is agreed that the statement is true when computing the determinant by reducing mod n.
  • #1
jdstokes
523
1
Hi,

I'm curious if the following statement is true for all prime numbers n,

[itex]\det_{\mathbb{Z}_n}M = (\det_{\mathbb{R}}M)\mod n[/itex]

where [itex]\det_F M[/itex] is the determinant of M over the field F.

Thanks.

James
 
Last edited:
Physics news on Phys.org
  • #2
Z isn't a field. But if you mean that if you take a matrix, and compute its determinant by multiplying, adding, and subtracting the entries as integers and then reduce mod n, versus if you do all the arithmetic mod n, then the answer is 'yes'.
 
  • #3
Thanks for the correction, I guess what I meant to say was [itex]\mathbb{R}[/itex].
 
  • #4
no, what you meant to saY WAS THATyour notation denoted the determinant over the ring F.

since you cannot consider elements of R as if they were in Z/n unless they are integers.
 

Related to Determinant of a matrix over the integers mod n

1. What is the determinant of a matrix over the integers mod n?

The determinant of a matrix over the integers mod n is a value that can be calculated for any square matrix whose elements are integers mod n. It is used to determine various properties of the matrix, such as whether it is invertible or singular.

2. How is the determinant of a matrix over the integers mod n calculated?

The determinant of a matrix over the integers mod n is calculated using a specific formula that involves finding the products of certain elements in the matrix and then taking the sum or difference of these products. This formula is similar to the traditional method for calculating determinants, but with the added step of performing calculations mod n.

3. What does the determinant over the integers mod n tell us about a matrix?

The determinant over the integers mod n can tell us several important properties of a matrix. These include whether the matrix is invertible, which is the case if and only if the determinant is nonzero. It can also tell us the number of solutions to a system of linear equations represented by the matrix, and can be used to find the inverse of the matrix if it exists.

4. Can the determinant of a matrix over the integers mod n be negative?

No, the determinant of a matrix over the integers mod n cannot be negative. This is because all calculations in this context are performed using modular arithmetic, which only has positive values. In fact, the determinant will always be a nonnegative integer.

5. What are some real-world applications of the determinant of a matrix over the integers mod n?

The determinant of a matrix over the integers mod n has many applications in fields such as cryptography, coding theory, and engineering. It is used to solve systems of linear equations, encrypt and decrypt messages, and analyze the stability of structures and systems. It is also a fundamental concept in abstract algebra and has applications in computer science and physics.

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
998
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Linear and Abstract Algebra
Replies
17
Views
4K
  • Precalculus Mathematics Homework Help
Replies
27
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
988
  • Linear and Abstract Algebra
Replies
15
Views
4K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
8
Views
963
Back
Top