This page is the ground floor. The parent note fires off symbols like aij, σ, sgn, Ri, detA, A⊤ — and quietly assumes you already picture what each one means. Here we build every one of them from nothing, in the order that each depends on the last.
Look at the figure: the matrix is a grid. The horizontal strip highlighted in blue is a row; the vertical strip in orange is a column. Nothing more mysterious than a seating chart.
We call a matrix square when it has the same number of rows as columns (2×2, 3×3, ...). Determinants are only defined for square matrices — you need equal rows and columns for the "area" idea to make sense, and we'll see exactly why in section 5.
In the figure below, we point an arrow at a23: walk down to row 2, then across to column 3. The topic needs this because the determinant formula picks entries one at a time by address, and if you read the address backwards every property comes out wrong.
The parent note writes the determinant as a function D(R1,R2,…,Rn). Read that as: "feed in the rows one bundle at a time, get a number out." Why bundle rows? Because every property (swap rows, scale a row, add rows) is a story about moving these strips around — and it's far easier to picture three strips than nine loose numbers.
For a 2×2 matrix the recipe is:
det[acbd]=acbd=ad−bc.
What does ad−bc look like? It is exactly the area of the parallelogram made by the two row-arrows (a,b) and (c,d) — with a sign for orientation. The figure builds it: the big rectangle has area (a+?)... more simply, the shaded blue region is the parallelogram, and ad−bc is its signed area.
You don't need to fear ∑σsgn(σ)a1σ(1)⋯ yet. It just says: make a big sum, where each piece grabs one entry per row and per column, and stick a ± on it. The next two sections define σ and sgn so that sum stops looking like hieroglyphics.
The figure shows two shuffles for a 3×3: the identity (every arrow goes straight across — this picks the diagonal) and a swap (two arrows cross). Each set of non-crossing/crossing arrows is one σ, and it selects exactly one entry from every row and column.
Why does the topic need permutations? Because the determinant is the only natural way to combine "one entry per row and column" — and permutations are the exhaustive list of ways to do that.
Picture a mirror line running down the diagonal; every entry hops to its reflection. The parent's P1 says det(A⊤)=detA — meaning "whatever is true for rows is equally true for columns." That's why the note can prove things about rows and get columns for free.