Probability that a matrix is singular

  • Context: MHB 
  • Thread starter Thread starter juantheron
  • Start date Start date
  • Tags Tags
    Matrix Probability
Click For Summary
SUMMARY

The probability that a randomly formed $3 \times 3$ matrix using elements from the set $\{-1, 1\}$ is singular is calculated using combinatorial methods. There are a total of $2^9$ possible matrices. By considering the unique row vectors and their negatives, the number of nonsingular matrices is determined to be $\binom{4}{3} \cdot 3! \cdot 2^3$. Consequently, the probability of singularity is given by the formula: $$1 - \frac{\binom{4}{3} \cdot 3! \cdot 2^3}{2^9}$$.

PREREQUISITES
  • Understanding of linear algebra concepts, specifically matrix singularity.
  • Familiarity with combinatorial mathematics, including binomial coefficients.
  • Knowledge of permutations and factorial calculations.
  • Basic understanding of probability theory.
NEXT STEPS
  • Study the properties of singular and nonsingular matrices in linear algebra.
  • Explore combinatorial techniques for counting arrangements and selections.
  • Learn about the implications of matrix singularity in various applications.
  • Investigate advanced probability concepts related to random matrix theory.
USEFUL FOR

Mathematicians, students of linear algebra, and anyone interested in probability theory and combinatorial mathematics will benefit from this discussion.

juantheron
Messages
243
Reaction score
1
A $3 \times 3$ matrices are formed using the the elements of $\left\{-1,1\right\}$. Then the probability that it is Singular, is
 
Physics news on Phys.org
Re: probability

jacks said:
A $3 \times 3$ matrices are formed using the the elements of $\left\{-1,1\right\}$. Then the probability that it is Singular, is
There are $2^9$ matrices in all, which we are assume are equally likely. We would like to count those which are nonsingular.

To that end, note that there are $2^3$ possible row vectors. Each row vector $v$ has a negative $-v$ in the set of possible row vectors. Since a basis cannot include both a vector and its negative, let's restrict our attention to one vector $v$ from each of the pairs $v$ and $-v$. This leaves us with $(1/2) \; 2^3 = 4$ row vectors to consider. For example, we might choose the set $E = \{(1,1,1), (1,1,-1), (1,-1,1), (-1,1,1)\}$. Since the order of the row vectors does not affect the (non)singularity of a matrix, let's consider just the $\binom{4}{3} = 4$ subsets of size 3 taken from $E$. It's easy to check that each of the 4 3 by 3 matrices thus produced is nonsingular.

Taking into account the possible orderings of the three row vectors in a matrix, we must multiply by $3!$; and taking into account that each vector could be replaced by its negative, we must multiply by $2^3$. So all together, there are
$\binom{4}{3} \; 3! \; 2^3$
nonsingular matrices whose elements are -1 or 1.

So the probability that such a matrix is singular is

$$1 - \frac{\binom{4}{3} \; 3! \; 2^3}{2^9}$$.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 20 ·
Replies
20
Views
5K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
16
Views
4K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K