Determinants using permutations

how to calculate determinants using permutation

Good question 👍 Let’s go step by step on how determinants are defined and
calculated using permutations (the formal definition).

1. General Definition
For an n × n matrix A = [aij ], the determinant is defined as:
​

n
det(A) = ∑ sgn(σ) ∏ ai,σ(i)
​ ​ ​

σ∈Sn ​ i=1

where:
Sn = the set of all permutations of {1, 2, … , n}.
​

σ(i) = the column chosen by the permutation σ for row i.

sgn(σ) = the sign of the permutation:
+1 if σ is an even permutation (can be formed using an even number of
swaps).
−1 if σ is an odd permutation (odd number of swaps).
So each term in the sum corresponds to picking exactly one element from each row
and each column, multiplied together, then weighted by the permutation’s sign.

2. Example: 2 × 2 matrix

a b
A=[ ]
c d
​ ​

Permutations of {1, 2}:

σ1 = (1, 2) (identity, even, sgn = +1).
​

Product: a1,1 a2,2 = ad.

​ ​

σ2 = (2, 1) (swap, odd, sgn = -1).

​

Product: a1,2 a2,1 = bc.

​ ​

det(A) = +ad − bc

1/21
 3. Example: 3 × 3 matrix

a b c
A= d ​ ​ e f
​ ​ ​

g h i

Permutations of {1, 2, 3}: (there are 3! = 6)

(1, 2, 3): even → aei
(1, 3, 2): odd → −af h
(2, 1, 3): odd → −bdi
(2, 3, 1): even → bf g
(3, 1, 2): even → cdh
(3, 2, 1): odd → −ceg

det(A) = aei + bf g + cdh − ceg − bdi − af h

This is exactly the expansion you usually see.

4. General Notes
This definition works for any size matrix, but requires summing over n! terms,
which grows very fast.
That’s why in practice, we use row-reduction or Laplace expansion instead of
raw permutations for large n.
But the permutation formula is the theoretical foundation of determinants.

👉 Do you want me to also explain how to find the sign of a permutation

systematically (using inversions), so you can compute determinant terms by hand?

yeah

Perfect 👍
Let’s go deeper into how to calculate the sign of a permutation so you can
systematically use the permutation formula for determinants.

2/21
 1. Sign of a Permutation
The sign (or parity) of a permutation σ is determined by the number of inversions in
it.

Definition of Inversion
Given a permutation σ = (σ(1), σ(2), … , σ(n)),
an inversion is a pair (i, j) such that:

i<j and σ(i) > σ(j)

If the number of inversions is even, σ is an even permutation, so sgn(σ) = +1.

If the number of inversions is odd, σ is an odd permutation, so sgn(σ) = −1.

2. Example: S3 (permutations of 3 elements)

​

(a) σ = (1, 2, 3)
Check inversions: none → even.
sgn = +1.

(b) σ = (2, 1, 3)
Pairs:
(2,1) → inversion
Only 1 inversion → odd.
sgn = −1.

(c) σ = (3, 2, 1)
Pairs:
(3,2), (3,1), (2,1) → 3 inversions.
3 is odd → odd.
sgn = −1.

(d) σ = (2, 3, 1)

3/21
 Pairs:

(2,1), (3,1) → 2 inversions.

2 is even → even.
sgn = +1.

So we get:

(1, 2, 3) → +1
(2, 1, 3) → −1
(3, 2, 1) → −1
(2, 3, 1) → +1
​ ​

(3, 1, 2) → +1
(1, 3, 2) → −1

This matches the signs in the 3 × 3 determinant expansion.

3. Shortcut with Transpositions

Another way:
A transposition is just swapping two elements.
Each swap changes the sign.
So if you can convert the permutation back to (1, 2, 3, … , n) using k swaps:
If k is even → sgn = +1.
If k is odd → sgn = −1.

✅ So, to compute a determinant using the permutation formula:

1. List all n! permutations.
2. For each permutation, compute its sign (using inversions).
3. Multiply the sign with the product of chosen elements.
4. Sum them up.

Do you want me to show the full determinant calculation of a 3 × 3 or 4 × 4 step

by step using this permutation + inversion method?

4/21
 2/2

how to find those permutations and why some are

zero?

Excellent doubt 🙌 Let’s carefully handle both parts:

1. How to find all permutations

For an n × n matrix, you need all permutations of {1, 2, … , n}.
Each permutation σ represents which column to pick for each row.
So for row 1 you pick column σ(1), for row 2 you pick column σ(2), etc.
Since σ is a permutation, every column appears exactly once.

Example: 3 × 3 matrix
Columns are {1, 2, 3}. All permutations are:

(1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), (3, 2, 1)

That’s 3! = 6 permutations.

Each gives a product like:

(1, 2, 3): pick a1,1 , a2,2 , a3,3 → product = aei

​ ​ ​

(2, 3, 1): pick a1,2 , a2,3 , a3,1 → product = bf g

​ ​ ​

…and so on.

2. Why do some terms become zero?

Good observation 👌 Some products vanish because the matrix might have zero
entries in the chosen positions.

Example

1 0 2
A= 0 3 0
​ ​ ​ ​ ​

4 0 5

Permutations (1, 2, 3): product = 1 ⋅ 3 ⋅ 5 = 15.

Permutations (1, 3, 2): product = 1 ⋅ 0 ⋅ 0 = 0.

5/21
 Permutations (2, 1, 3): product = 0 ⋅ 0 ⋅ 5 = 0.

So many terms disappear just because at least one chosen element was zero.

That’s why in sparse matrices (with many zeros), computing the determinant is
easier, because most permutation terms vanish.

3. Another Reason (not zero but canceling)

Even if terms are not zero, they may cancel because of the ± sign from
permutations.

That’s why determinant can be 0 even for nonzero entries — it means the matrix’s
rows/columns are linearly dependent, so all contributions balance out.

✅ Summary:
To find permutations: list all n! orderings of {1, 2, … , n}.
Each permutation = one product (one entry from each row & each column).
Some terms vanish if a chosen entry is zero.
Others may cancel out due to sign differences.

Would you like me to show you a full worked-out determinant of that 3×3 example
matrix above using the permutation method, with all 6 terms listed (including
zeros)?

it is quite confusing can you go from scratch about

determinants and this approach with example

Got it 👍 Let’s rebuild everything from scratch so you don’t feel lost.
We’ll start with what a determinant is, then how the permutation definition works,
and then do a full example step by step.

1. What is a Determinant?

6/21
 The determinant is a single number associated with a square matrix (same
number of rows and columns).
It tells you things like:
If the matrix is invertible (det ≠ 0).
How the matrix scales areas/volumes.
If rows/columns are linearly dependent (det = 0).

2. Formal Definition (Permutation Method)

For an n × n matrix A = [aij ]: ​

n
det(A) = ∑ sgn(σ) ∏ ai,σ(i)
​ ​ ​

σ∈Sn ​ i=1

Where:
Sn = all permutations of {1, 2, … , n}.
​

σ(i) = which column you choose in row i.

sgn(σ) = sign of permutation (+1 if even, −1 if odd).
So each permutation gives you one product: one entry per row, no two from same
column.
Then you add/subtract them depending on the permutation’s sign.

3. Start Simple: 2 × 2 Matrix

a b
A=[ ]
c d
​ ​

Step 1: List permutations of {1, 2}

(1, 2) → identity permutation (even → sign = +1)
(2, 1) → swap (odd → sign = -1)

Step 2: Build terms

For (1, 2): choose a1,1 , a2,2 → product = ad → +ad
​ ​

For (2, 1): choose a1,2 , a2,1 → product = bc → −bc

​ ​

Step 3: Add them

7/21
 det(A) = ad − bc

✅ That’s the familiar 2 × 2 formula.

4. Next: 3 × 3 Matrix
a b c
A= d ​ ​ e f
​ ​ ​

g h i

Step 1: Permutations of {1, 2, 3}

There are 3! = 6:
1. (1,2,3) → even (+)
2. (1,3,2) → odd (–)
3. (2,1,3) → odd (–)
4. (2,3,1) → even (+)
5. (3,1,2) → even (+)
6. (3,2,1) → odd (–)

Step 2: Write terms

(1,2,3): a1,1 a2,2 a3,3
​ ​ ​
= aei → +aei
(1,3,2): a1,1 a2,3 a3,2
​ ​ ​
= af h → −af h
(2,1,3): a1,2 a2,1 a3,3
​ ​ ​
= bdi → −bdi
(2,3,1): a1,2 a2,3 a3,1
​ ​ ​
= bf g → +bf g
(3,1,2): a1,3 a2,1 a3,2
​ ​ ​
= cdh → +cdh
(3,2,1): a1,3 a2,2 a3,1
​ ​ ​
= ceg → −ceg

Step 3: Combine

det(A) = aei + bf g + cdh − ceg − bdi − af h

✅ This is exactly the “rule of Sarrus” or cofactor expansion result you’ve seen before.

5. Why Some Terms = 0?

8/21
 If your matrix has zeros, some of those products vanish.
Example:

1 0 2
B= 0 3 0
​ ​ ​ ​ ​

4 0 5

(1,2,3): 1 ⋅ 3 ⋅ 5 = 15
(1,3,2): 1 ⋅ 0 ⋅ 0 = 0
(2,1,3): 0 ⋅ 0 ⋅ 5 = 0
(2,3,1): 0 ⋅ 0 ⋅ 4 = 0
(3,1,2): 2 ⋅ 0 ⋅ 0 = 0
(3,2,1): 2 ⋅ 3 ⋅ 4 = 24, but sign is (3,2,1) odd → −24

So determinant = 15 − 24 = −9.

✅ Big Picture
Determinant = sum over all permutations.
Each permutation picks one element from each row & each column.
Sign depends on whether permutation is even (+) or odd (–).
Many terms vanish if matrix has zeros.

👉 Do you want me to also show you a shortcut method (like cofactor expansion or
row reduction) and then compare it with the permutation definition for the same
example, so you see they match?

(1,2,3):
𝑎
1
,
1
𝑎
2
,
2
𝑎

9/21
 3
,
3
=
𝑎
𝑒
𝑖
a
1,1
​

a
2,2
​

a
3,3
​

=aei →
+
𝑎
𝑒
𝑖
+aei

(1,3,2):
𝑎
1
,
1
𝑎
2
,
3
𝑎
3
,
2
=
𝑎
𝑓

10/21
 ℎ
a
1,1
​

a
2,3
​

a
3,2
​

=afh →
−
𝑎
𝑓
ℎ
−afh

(2,1,3):
𝑎
1
,
2
𝑎
2
,
1
𝑎
3
,
3
=
𝑏
𝑑
𝑖
a
1,2
​

11/21
 2,1
​

a
3,3
​

=bdi →
−
𝑏
𝑑
𝑖
−bdi

(2,3,1):
𝑎
1
,
2
𝑎
2
,
3
𝑎
3
,
1
=
𝑏
𝑓
𝑔
a
1,2
​

a
2,3
​

a
3,1
​

12/21
 =bfg →
+
𝑏
𝑓
𝑔
+bfg

(3,1,2):
𝑎
1
,
3
𝑎
2
,
1
𝑎
3
,
2
=
𝑐
𝑑
ℎ
a
1,3
​

a
2,1
​

a
3,2
​

=cdh →
+
𝑐
𝑑
ℎ

13/21
 +cdh

(3,2,1):
𝑎
1
,
3
𝑎
2
,
2
𝑎
3
,
1
=
𝑐
𝑒
𝑔
a
1,3
​

a
2,2
​

a
3,1
​

=ceg →
−
𝑐
𝑒
𝑔
−ceg why to choose this specific elements for this
specific columns?

Aha! ✨ That’s the key idea you’re asking: why do we pick exactly those elements
for each permutation?

14/21
 Let’s slow it down.

1. Rule of the Game (Determinant Definition)

The determinant is defined so that:

We must pick one entry from each row.

We must pick one entry from each column.
No row or column can be repeated in the product.

This is exactly what a permutation enforces.

2. What does a permutation mean?

Take n = 3.

A permutation σ of {1, 2, 3} is a reordering of the column numbers.

σ = (σ(1), σ(2), σ(3))

σ(1) tells you which column to pick in row 1.

σ(2) tells you which column to pick in row 2.
σ(3) tells you which column to pick in row 3.
Since permutations never repeat numbers, this guarantees each column is chosen
exactly once.

3. Example Walkthrough

Permutation (1,2,3)
Row 1 → column 1 → a1,1 ​ =a
Row 2 → column 2 → a2,2 ​ =e
Row 3 → column 3 → a3,3 ​ =i
Product = aei.

Permutation (3,2,1)
Row 1 → column 3 → a1,3 ​ =c

15/21
 Row 2 → column 2 → a2,2 ​ =e
Row 3 → column 1 → a3,1 ​ =g
Product = ceg .

Permutation (2,3,1)
Row 1 → column 2 → a1,2 ​ =b
Row 2 → column 3 → a2,3 ​ =f
Row 3 → column 1 → a3,1 ​ =g
Product = bf g .

4. Why this structure?

If we didn’t use permutations, we might accidentally:
pick two elements from the same column (not allowed),
or skip a column completely.

Permutations are the mathematical way of ensuring a “perfect matching” between

rows and columns.

✅ So the reason you “choose those specific elements” is because:

The permutation tells you which column goes with each row.
That way, across all rows, you cover each column exactly once.

Would you like me to draw a grid-style visualization (like connecting rows to

columns with arrows for each permutation) so you can literally see why we pick those
elements?

it doesnt telll directly i am not able to catch that give

proper solution

Got it 👍 Let me make it crystal clear step by step.

The confusion is: “why do we choose those specific elements for those permutations?”

16/21
 The answer lies in how the permutation σ works.
I’ll rebuild it very carefully.

1. Determinant Rule (from definition)

For an n × n matrix, the determinant is:
n
det(A) = ∑ sgn(σ) ∏ ai,σ(i)
​ ​ ​

σ∈Sn ​ i=1

Focus on the product:

n
∏ ai,σ(i)
​ ​

i=1

This means:
For each row i, you pick the element in column σ(i).

So the permutation σ is literally an instruction list:

“In row 1, go to column σ(1).

In row 2, go to column σ(2).
… continue until row n.”

2. Why permutations?
A permutation is a reordering of the set {1, 2, 3}.
This guarantees no column is repeated.
That’s exactly what we need: one element per row, and one from each column.

3. Example with 3 × 3 matrix

a b c
A= d ​ ​ e f
​ ​ ​

g h i

Permutation (1,2,3)
Row 1 → col 1 → a1,1 ​ =a

17/21
 Row 2 → col 2 → a2,2 ​ =e
Row 3 → col 3 → a3,3 ​ =i
Product = aei.

Permutation (3,2,1)
Row 1 → col 3 → a1,3 ​ =c
Row 2 → col 2 → a2,2 ​ =e
Row 3 → col 1 → a3,1 ​ =g
Product = ceg .

Permutation (2,3,1)
Row 1 → col 2 → a1,2 ​ =b
Row 2 → col 3 → a2,3 ​ =f
Row 3 → col 1 → a3,1 ​ =g
Product = bf g .

4. Why exactly those elements?

Because the permutation index σ(i) gives you the column number for row i.
That’s why:
For (1,2,3): you pick diagonal (col 1 for row 1, col 2 for row 2, col 3 for row 3).
For (3,2,1): you pick “reverse diagonal.”
For (2,3,1): you pick one from col 2 in row 1, col 3 in row 2, col 1 in row 3.

Each permutation = one unique “path” through the matrix that hits every row and
column once.

✅ In short:
The permutation is a mapping from rows → columns.
That mapping decides exactly which elements you must choose.
You don’t choose them arbitrarily — the permutation fixes the choice.

18/21
 Would you like me to draw it like a grid with arrows (rows → columns) so you can
visually see how each permutation selects elements? That way you’ll see the “path”
through the matrix.

how this idea formed

🔥 Excellent question — you want the origin story: where did this idea of using
permutations come from for determinants?
Let’s trace it properly.

1. The Original Problem

Mathematicians wanted a formula for solving linear equations like:

⎧ a11 x1 + a12 x2 + a13 x3 = b1

​ ​ ​ ​ ​ ​ ​

⎨ a21 x1 + a22 x2 + a23 x3 = b2

​
​ ​ ​ ​ ​ ​
​
​

⎩
a31 x1 + a32 x2 + a33 x3 = b3
​ ​ ​ ​ ​ ​ ​

This is a 3 × 3 system.
People noticed you can eliminate variables, but they wanted a general formula for
the solution.

That formula is Cramer’s Rule, which uses determinants.

So determinants were invented as the tool to express the solution.

2. What rules must the formula follow?

The number (determinant) they wanted had to satisfy:
1. Linear in each row (if you scale a row, determinant scales; if you add two rows,
determinant adds).
2. Changes sign if you swap two rows (because swapping two equations flips
orientation).
3. Determinant = 0 if two rows are equal (system has dependent equations).
4. Identity matrix determinant = 1 (baseline).

These rules describe a very strict object.

Turns out: the only possible formula that satisfies these rules is the permutation

19/21
 formula.

3. Why permutations naturally appear

When you expand by “linear in each row,” you’re forced to choose one entry
from each row.
To also avoid repeating columns, you must choose one from each column.
The only way to describe such a one-to-one matching between rows and
columns is with a permutation.

So:
Row index = fixed (1,2,…,n).
Column index = given by a permutation.

That’s why terms look like a1,σ(1) a2,σ(2) … an,σ(n) .

​ ​ ​

4. Why signs appear (sgn)

Now, rule (2) says: if we swap two rows, the determinant changes sign.

But swapping rows is equivalent to changing the order of the permutation.

If a permutation is even (requires even swaps to reach identity), sign = +1.

If odd (requires odd swaps), sign = –1.

Thus, sgn(σ) enters naturally.

5. Historical Note
17th century: Leibniz and Cramer defined determinants with the permutation
formula.
Later, people invented shortcuts (cofactor expansion, row reduction).
But the deepest definition is still:
n
det(A) = ∑ sgn(σ) ∏ ai,σ(i)
​ ​ ​

σ∈Sn ​ i=1

✅ Big Picture:
20/21
 Determinants were invented to capture how systems of linear equations behave.
The rules forced mathematicians to use “one entry per row, one per column” →
permutations.
The row-swapping rule forced the use of signs (sgn).
That’s why the permutation idea was formed — not arbitrary, but the only
formula that works.

Would you like me to now show how Cramer’s Rule directly uses this permutation
definition? That will make the purpose of determinants clearer, not just the formula.

21/21