Why state thirteen conditions instead of just defining an invertible matrix?

Because the conditions arise naturally in different contexts and are not obviously related. An engineer asking whether a load case has a unique solution, a numerical analyst asking whether elimination terminates at the identity, and a geometer asking whether a set of directions spans are asking the same question in three vocabularies. The theorem is what licenses the translation, and it is the translation, not any single statement, that carries the value.

How many separate theorems does this single result contain?

Seventy-eight. A list of $k$ mutually equivalent statements asserts $\binom{k}{2}$ if-and-only-if theorems, and $\binom{13}{2} = 78$. The whole set is established by a cycle of implications rather than by proving each pair, which is why a result of this size is practical to prove at all.

Is a one-sided inverse enough for a square matrix?

Yes. If $A$ and $B$ are square of the same size and $AB = I_n$, then $BA = I_n$ follows automatically, so $B$ is the genuine two-sided inverse. This is emphatically false for rectangular matrices: a wide matrix can have a right inverse and no left inverse. The square case is another instance of injectivity and surjectivity implying one another.

Which of the conditions should I actually compute?

In exact arithmetic, row-reduce and check for $I_n$ — it costs about $n^3$ operations and yields the inverse for free if you augment with the identity. In floating point, use the LU factorisation you are computing anyway and inspect its pivots, then report a reciprocal condition estimate. Never compute a determinant or a spectrum solely to answer this question.

Does the list survive over the real numbers rather than the complex numbers?

Yes, all thirteen statements remain equivalent over $\mathbb{R}$, and indeed over any field. Statement twelve is safe because it is a negative statement: asserting that $0$ is not an eigenvalue requires no guarantee that any eigenvalue exists. What fails over $\mathbb{R}$ is the separate guarantee that a square matrix has an eigenvalue at all, which this list never uses.

My matrix is singular. What should I do?

Compute a basis for the null space and interpret it. In a structural model it will be a rigid-body motion; in a network it will be an undetermined reference level; in an estimation problem it will be an unidentifiable parameter combination. Fix the underlying model by adding the missing restraint, datum or observation. Only if the deficiency is genuinely intrinsic should you move to a pseudoinverse or a regularised solution, and then state which one you used.

Can I add a fourteenth condition of my own?

Yes, provided you prove it equivalent to one existing statement using results that do not themselves depend on the list. Common additions include a non-zero product of eigenvalues, non-zero singular values throughout, a trivial left null space, and $A^{t}$ being nonsingular. Each is a short proof, and each must be checked for circularity before it is admitted.

Nonsingular Matrix Equivalences — Foundations and Proof Network

Overview

A square matrix is nonsingular when the homogeneous system $A\vec{x} = \vec{0}$ has only the zero solution. That is a narrow, almost technical-looking definition, and taken alone it would be unremarkable. What makes it the organising idea of matrix algebra is that it turns out to be equivalent to a long list of conditions expressed in completely different vocabularies: a statement about row reduction, a statement about solution sets, a statement about linear independence, a statement about spanning, two statements about integer-valued invariants, a statement about a single scalar, a statement about the spectrum, and a statement about an associated function.

The list is assembled incrementally. Each time a new structure is introduced — matrix inverses, column spaces, bases, dimension, determinants, eigenvalues, linear transformations — a bridging theorem is proved connecting that structure to nonsingularity, and the list gains one entry. By the end there are thirteen statements. Because a theorem of this form declares every pair equivalent, thirteen statements package $\binom{13}{2} = 78$ separate if-and-only-if theorems, and the whole structure is established with far fewer than 78 proofs by arranging the implications in a chain that closes back on itself.

The engineering value is substitution. A question posed in one vocabulary can be answered in another, and the answering vocabulary can be chosen for cost, for numerical robustness, or for whatever information happens to be available. If a factorisation has already been computed, nonsingularity is free. If the columns are known on physical grounds to be independent — independent load paths, independent measurement directions — then a unique solution for every right-hand side follows without any arithmetic. If a determinant is available symbolically, the parameter values at which a design becomes singular can be solved for directly.

Equally important is what the list says about failure. Because the conditions are equivalent, their negations are equivalent too: a singular matrix does not row-reduce to the identity, has a non-trivial null space, has dependent columns whose span is a proper subspace, has rank below $n$ and nullity above zero, has zero determinant, has $0$ in its spectrum, and induces a non-invertible transformation. In a physical model these are not seven separate defects but seven readings of one defect — typically a redundant equation, an unconstrained rigid-body motion, or a missing reference datum — and the null space vector usually names it explicitly.

Definition

Nonsingular Matrix

A square matrix $A$ is nonsingular when the homogeneous system $A\vec{x} = \vec{0}$ has the zero vector as its only solution. Equivalently, $\mathcal{N}(A) = \{\, \vec{0} \,\}$ . A square matrix that is not nonsingular is singular, meaning some non-zero vector is annihilated by $A$ .

The definition is stated for square matrices only. A rectangular matrix is neither singular nor nonsingular; the terms are undefined for it, even though its null space may well be trivial.

Null Space of a Matrix

NSM

For an $m \times n$ matrix $A$ , the null space $\mathcal{N}(A) = \{\, \vec{x} \in \mathbb{C}^n \mid A\vec{x} = \vec{0} \,\}$ is the set of all solutions of the homogeneous system. It is always a subspace of $\mathbb{C}^n$ , and it always contains $\vec{0}$ ; the substance of nonsingularity is that it contains nothing else.

Matrix Inverse

A square matrix $A$ of size $n$ is invertible when there exists a square matrix $B$ of size $n$ with $AB = BA = I_n$ . Such a $B$ is unique when it exists and is written $A^{-1}$ . For square matrices a one-sided inverse is automatically two-sided: $AB = I_n$ alone forces $BA = I_n$ .

The one-sided result is specific to square matrices. A rectangular matrix can possess a right inverse and no left inverse, or the reverse, and never both.

Multiple Equivalences

A theorem whose conclusion is a list of statements declared mutually equivalent, so that any two of them may be joined by if and only if. A list of $k$ statements therefore asserts $\binom{k}{2}$ distinct theorems. The economical proof strategy is a cycle $P_1 \Rightarrow P_2 \Rightarrow \cdots \Rightarrow P_k \Rightarrow P_1$ , after which any desired equivalence is obtained by travelling round the circle.

In practice this list is built the other way: each new statement is attached to statement one by a dedicated bridging theorem, which keeps every addition independently checkable.

Concepts

The thirteen equivalent statements

Suppose $A$ is a square matrix of size $n$ . The following thirteen statements are equivalent — each one holds precisely when all the others do.

$A$ is nonsingular.
$A$ row-reduces to the identity matrix, $\operatorname{RREF}(A) = I_n$ .
The null space of $A$ contains only the zero vector, $\mathcal{N}(A) = \{\, \vec{0} \,\}$ .
The system $A\vec{x} = \vec{b}$ has a unique solution for every choice of $\vec{b}$ .
The columns of $A$ form a linearly independent set.
$A$ is invertible.
The column space of $A$ is all of $\mathbb{C}^n$ , that is $\mathcal{C}(A) = \mathbb{C}^n$ .
The columns of $A$ are a basis for $\mathbb{C}^n$ .
The rank of $A$ is $n$ , $\operatorname{rank}(A) = n$ .
The nullity of $A$ is zero, $\operatorname{nullity}(A) = 0$ .
The determinant of $A$ is non-zero, $\det(A) \ne 0$ .
$\lambda = 0$ is not an eigenvalue of $A$ .
The linear transformation $T \colon \mathbb{C}^n \to \mathbb{C}^n$ defined by $T(\vec{x}) = A\vec{x}$ is invertible.

Two details in the wording carry weight. Statement four says every $\vec{b}$ : a singular matrix may still give a unique solution for no $\vec{b}$ at all, but never for every one, and for a particular $\vec{b}$ a singular system has either no solution or infinitely many. Statement seven says the column space is the whole of $\mathbb{C}^n$ , not merely large; combined with statement five this is what upgrades the columns from independent to a basis in statement eight.

Four families of statement, and why the traffic between them matters

The thirteen statements fall into four families, and recognising the family a statement belongs to is what makes the list usable rather than merely memorable.

Solution-set statements — 1, 3, 4. These describe what happens when the matrix is used to solve something. They are the closest to the original engineering question and the reason the concept was isolated in the first place.
Computational statements — 2, 6. These describe the outcome of an algorithm: elimination terminates at the identity, and the inverse exists. Statement two is the practical test; statement six is the practical payoff.
Subspace and basis statements — 5, 7, 8, 9, 10. These describe the columns as a set of vectors in $\mathbb{C}^n$ : independent, spanning, a basis, and the two integer invariants that record those facts. They connect nonsingularity to the whole apparatus of dimension.
Scalar and operator statements — 11, 12, 13. These describe the matrix as an object acting on itself and on the space: one number certifies it, the spectrum omits zero, and the induced map is a bijection.

Movement between families is where the leverage lies. A structural argument — these load paths are geometrically independent, these measurement directions are not coplanar — establishes statement five with no arithmetic, and statement four follows immediately: the system is uniquely solvable for every load case. Conversely a numerical elimination establishes statement two, and statement eight follows: the columns may be used as a coordinate system.

How the list is assembled: one bridging theorem at a time

The list grows one statement at a time, and each addition is a separate theorem connecting a newly available structure back to statement one. Reading the sequence is a compressed tour of the whole subject.

Statements 2, 3, 4 arrive first, from three companion results: nonsingular matrices row reduce to the identity; nonsingular matrices have trivial null spaces; and nonsingular matrices give unique solutions for every vector of constants. Requires: only row reduction and the pivot count.
Statement 5 arrives with linear independence. A relation of linear dependence among the columns is exactly a non-zero solution of $A\vec{x} = \vec{0}$ , so independence of the columns and a trivial null space are the same statement in different words. Requires: the interpretation of a matrix-vector product as a linear combination of columns.
Statement 6 arrives with matrix inverses. One direction is a short computation: if $A^{-1}$ exists and $A\vec{x} = \vec{0}$ , then $\vec{x} = A^{-1}A\vec{x} = A^{-1}\vec{0} = \vec{0}$ . The other direction is constructive — augment with the identity, reduce, and read the inverse off — and needs the fact that a one-sided inverse of a square matrix is two-sided. Requires: matrix multiplication and its associativity.
Statement 7 arrives with column spaces. If $A$ is nonsingular then $A\vec{x} = \vec{b}$ is solvable for every $\vec{b}$ , and the set of solvable right-hand sides is the column space. Requires: the equivalence of consistency and membership of the column space.
Statement 8 arrives with bases: independent (statement 5) plus spanning (statement 7) is the definition of a basis. Requires: nothing new beyond the definition.
Statements 9 and 10 arrive with dimension. The rank is the dimension of the column space, which is $n$ exactly when the column space is everything; the nullity is then $n - n = 0$ by rank plus nullity. Requires: rank plus nullity, and the fact that a subspace of $\mathbb{C}^n$ of dimension $n$ is $\mathbb{C}^n$ .
Statement 11 arrives with determinants: a square matrix is singular if and only if its determinant is zero, and negating both sides gives the equivalence in the form needed here. Requires: the behaviour of the determinant under row operations.
Statement 12 arrives with eigenvalues. A matrix is singular exactly when some non-zero $\vec{x}$ satisfies $A\vec{x} = \vec{0} = 0\vec{x}$ , which is precisely the statement that $0$ is an eigenvalue. Negate to obtain statement 12. Requires: the definition of an eigenvalue and nothing more — notably not the characteristic polynomial.
Statement 13 arrives with linear transformations, once the dictionary between a matrix and its induced map is complete: the kernel corresponds to the null space and the range to the column space, so injectivity and surjectivity of $T$ correspond to statements 3 and 7. Requires: rank plus nullity for transformations and the correspondence between invertibility and bijectivity.

Every one of these bridging theorems reaches back only to material that does not itself depend on the list. That discipline is what keeps the structure from being circular, and it is worth checking whenever a fourteenth condition is proposed.

The contrapositive list: what a singular matrix looks like

Because the thirteen statements are equivalent, so are their negations, and the singular list is just as useful. For a square matrix $A$ of size $n$ , the following also stand or fall together.

$A$ is singular; some non-zero $\vec{x}$ satisfies $A\vec{x} = \vec{0}$ .
The reduced row-echelon form of $A$ has at least one zero row, so it is not $I_n$ .
$\dim(\mathcal{N}(A)) \ge 1$ ; there are free variables.
For each $\vec{b}$ , the system $A\vec{x} = \vec{b}$ has either no solution or infinitely many — never exactly one.
The columns are dependent: at least one is a linear combination of the others.
No matrix $B$ satisfies $AB = I_n$ , on either side.
$\mathcal{C}(A)$ is a proper subspace of $\mathbb{C}^n$ , of dimension $r < n$ .
$\operatorname{rank}(A) < n$ and $\operatorname{nullity}(A) > 0$ .
$\det(A) = 0$ , equivalently $p_A(0) = 0$ .
$\lambda = 0$ is an eigenvalue, and the null space is its eigenspace.
$T(\vec{x}) = A\vec{x}$ is neither injective nor surjective.

The fourth entry deserves emphasis because it is routinely misread. Singularity does not mean “no solution”. It means the solution count is never one: for right-hand sides inside the column space there are infinitely many solutions, differing by any element of the null space, and for right-hand sides outside it there are none. A design that appears to work because one particular load case produced an answer may still rest on a singular matrix.

Squareness is the hypothesis that makes the list cohere

Squareness is not a convenience in the hypothesis; it is what makes the list cohere. Consider each family against an $m \times n$ matrix with $m \ne n$ .

A trivial null space is still meaningful and still equivalent to independent columns, but it now forces $m \ge n$ and says nothing about solvability. A tall matrix with independent columns has no solution for most right-hand sides.
A full column space is still meaningful and still equivalent to consistency for every $\vec{b}$ , but it forces $m \le n$ and permits infinitely many solutions. A wide matrix that spans has a null space of dimension $n - m$ at least.
The two conditions above coincide only when $m = n$ . That coincidence is the entire content of the theorem: for a square matrix, injectivity and surjectivity of the associated map imply one another, so a single check settles both.
Determinant, eigenvalue and invertibility statements are not merely false for rectangular matrices, they are undefined. $\det$ requires equal row and column counts; $A\vec{x} = \lambda\vec{x}$ cannot even be typed unless the input and output live in the same space.

The generalisations that do survive are the rank statements, and they survive in weakened form: $\operatorname{rank}(A) = n$ characterises independent columns for any shape, and $\operatorname{rank}(A) = m$ characterises a full column space. Full rank in the sense of $\operatorname{rank}(A) = \min(m, n)$ gives one of the two properties, never both unless the matrix is square.

Choosing which condition to actually compute

Given thirteen interchangeable conditions, the practical question is which one to compute. Ranked by cost and by robustness they are not at all interchangeable.

Row reduction to $I_n$ — about $n^3$ operations. The default for exact arithmetic. It answers the question and, if the reduction is performed on $[\, A \mid I_n \,]$ , delivers the inverse in the same pass. In floating point the terminal test becomes a tolerance decision on the smallest pivot.
LU factorisation — about $\tfrac{2}{3}n^3$ operations. Cheaper than full reduction and reusable across right-hand sides. Nonsingularity appears as the absence of a zero (or unacceptably small) pivot, and the factorisation is normally computed anyway to solve the system.
Determinant — free once a factorisation exists, being the product of the pivots with a sign for the row interchanges. Excellent as an exact or symbolic certificate; a poor numerical test, because $\det(cA) = c^{n}\det(A)$ makes the magnitude of a determinant meaningless without a scale.
Reciprocal condition estimate — about $O(n^2)$ on top of a factorisation. Not one of the thirteen statements, and strictly more informative than all of them in floating point: it measures how far the matrix is from singular rather than whether it happens to be singular exactly.
Smallest singular value — about $10n^3$ to $20n^3$ operations. The most defensible numerical answer, since $\sigma_{\min}$ is the exact distance in the spectral norm to the nearest singular matrix. Reserve for cases where the decision matters and the cost is affordable.
Eigenvalues — iterative, $10n^3$ and upwards. Never compute a spectrum merely to check for a zero eigenvalue. Statement 12 is for reasoning, not for testing.

The ordering to remember is that the cheap tests are the structural ones near the top of the list and the expensive tests are the spectral ones near the bottom, while the most useful numerical question — how close to singular — is not on the list at all.

Selecting a nonsingularity test

Confirm the matrix is squareIf

A

is not

n \times n

, none of the thirteen statements applies. Ask instead about

\operatorname{rank}(A)

relative to

m

and

n

, which is the shape-agnostic replacement.

Is a structural argument available?If the columns are known on physical or geometric grounds to be independent — distinct load paths, non-coplanar measurement axes, a grounded reference node — statement five is established with no arithmetic and the remaining twelve follow.

Is the arithmetic exact?With rational or integer entries, row-reduce and compare with

I_n

, or compute the determinant by fraction-free elimination. Both give a definitive yes or no with no tolerance to choose.

Is a factorisation already being computed?If the system is being solved anyway, the LU factorisation already answers the question: a zero or negligible pivot is exactly a singular matrix. Do not perform a second, separate test.

Does the decision matter numerically?In floating point, replace the exact question with a quantitative one. Compute a reciprocal condition estimate for a cheap answer, or the smallest singular value for the distance to the nearest singular matrix.

If singular, read the null spaceA basis for

\mathcal{N}(A)

names the defect: a rigid-body motion, an undetermined reference level, a redundant equation or an unobservable state direction. Fixing the model is usually cheaper than regularising the algebra.

Equations

The defining condition

EQ-NME-01

N (A) = {\vec{x} \in ℂ^{n} ∣ A \vec{x} = \vec{0}} = {\vec{0}}

Statement three, and the definition itself. Every other statement in the list is proved equivalent to this one.

Reduction to the identity

EQ-NME-02

RREF (A) = I_{n} \Leftrightarrow rank (A) = n \Leftrightarrow nullity (A) = 0

Statements two, nine and ten. A square matrix whose reduced form has $n$ pivots has no room for a zero row, so the reduced form is forced to be the identity.

Unique solution for every right-hand side

EQ-NME-03

Unique solution for every right-hand side

Statements four and six together. The universal quantifier is essential: a singular matrix never gives a unique solution for any right-hand side, but the failure is invisible if only one $\vec{b}$ is ever tried.

The columns as a basis

EQ-NME-04

C (A) = ℂ^{n}, \dim (C (A)) = n, {A_{1}, A_{2}, \dots, A_{n}} independent

Statements five, seven and eight. For exactly $n$ vectors in $\mathbb{C}^n$ , independence and spanning imply one another, so verifying either one certifies a basis.

Rank plus nullity forces the equivalence

EQ-NME-05

rank (A) + nullity (A) = n

The identity that makes statements nine and ten interchangeable, and the reason a square matrix cannot have both a non-trivial null space and a full column space.

Determinant and the zero eigenvalue

EQ-NME-06

p_{A} (0) = \det (A - 0 \cdot I_{n}) = \det (A) \neq 0

Statements eleven and twelve, and the reason they are the same statement. The constant term of the characteristic polynomial is the determinant, so a non-zero determinant is exactly the assertion that $0$ is not a root.

Equivalences packaged by the theorem

EQ-NME-07

(\binom{13}{2}) = \frac{13 \cdot 12}{2} = 78

The number of distinct if-and-only-if theorems asserted. A cycle of thirteen implications establishes all of them, which is the economy that makes a list of this length worth stating as a single result.

Variable Definitions

Symbols used on this page
Symbol	Name	Meaning	Domain / type
$A$	Square matrix	The $n \times n$ matrix whose nonsingularity is in question	n x n matrix over C
$n$	Size	Common row and column count; also the dimension of the ambient space $\mathbb{C}^n$	positive integer
$I_{n}$	Identity matrix	Square matrix with ones on the diagonal and zeros elsewhere; the target of the reduction test	n x n matrix
$N (A)$	Null space	All solutions of $A\vec{x} = \vec{0}$ ; trivial exactly when $A$ is nonsingular	subspace of C^n
$C (A)$	Column space	Span of the columns; equals $\mathbb{C}^n$ exactly when $A$ is nonsingular	subspace of C^n
$A^{- 1}$	Matrix inverse	Unique matrix with $AA^{-1} = A^{-1}A = I_n$ ; exists exactly when $A$ is nonsingular	n x n matrix
$\det (A)$	Determinant	Scalar certificate of nonsingularity, non-zero exactly when $A$ is nonsingular	complex number
$λ$	Eigenvalue	Scalar with $A\vec{x} = \lambda\vec{x}$ for some non-zero $\vec{x}$ ; nonsingularity excludes $\lambda = 0$	complex number
$r$	Rank	Number of pivot columns of the reduced form; equals $n$ exactly when $A$ is nonsingular	0 to n
$T$	Induced transformation	The map $T(\vec{x}) = A\vec{x}$ on $\mathbb{C}^n$ ; invertible exactly when $A$ is	linear map C^n to C^n

Worked Numerical Example

Problem statement

A four-node resistive network is analysed by nodal admittance. Compare the floating network, whose conductance matrix is singular, with the same network after one node is tied to earth. Verify several of the thirteen conditions on each and confirm that they agree.

Assemble the floating conductance matrix
Nodes 1 to 4 are joined by unit conductances between the pairs $(1,2)$ , $(1,3)$ , $(2,3)$ and $(3,4)$ . Nodal analysis gives $L\vec{v} = \vec{i}$ , where each diagonal entry is the total conductance at a node and each off-diagonal entry is minus the conductance joining two nodes.
$L = [\begin{matrix} 2 & - 1 & - 1 & 0 \\ - 1 & 2 & - 1 & 0 \\ - 1 & - 1 & 3 & - 1 \\ 0 & 0 & - 1 & 1 \end{matrix}]$
Statement 3 fails immediately for the floating network
Every row of $L$ sums to zero, because every conductance appears once positively on the diagonal and once negatively off it. Therefore the all-ones vector is annihilated. This is not an arithmetic accident: raising every node potential by the same amount changes no branch voltage and therefore no current. The null space is non-trivial, so $L$ is singular.
$Statement 3 fails immediately for the floating network$
Confirm the remaining twelve statements fail together
Row reduction gives three pivots, not four, so the reduced form is not $I_4$ (statement 2 fails), the rank is $3 < 4$ and the nullity is $1 > 0$ (statements 9 and 10 fail), the columns are dependent and span only a three-dimensional subspace (statements 5, 7, 8 fail), the determinant vanishes (statement 11 fails), and the characteristic polynomial has $0$ as a root (statement 12 fails).
$RREF (L) = [\begin{matrix} 1 & 0 & 0 & - 1 \\ 0 & 1 & 0 & - 1 \\ 0 & 0 & 1 & - 1 \\ 0 & 0 & 0 & 0 \end{matrix}], \det (L) = 0$
Read the spectrum of the singular matrix
The characteristic polynomial factors completely over the integers. The presence of the factor $x$ is statement 12 failing, and its eigenspace is precisely the null space found in step two. The three non-zero eigenvalues describe how quickly the three genuine degrees of freedom relax; the zero eigenvalue describes the direction in which nothing happens at all.
$p_{L} (x) = \det (L - x I_{4}) = x^{4} - 8 x^{3} + 19 x^{2} - 12 x = x (x - 1) (x - 3) (x - 4)$
Ground one node and re-form the matrix
Tie node 4 to earth through a unit conductance. Only the fourth diagonal entry changes, from $1$ to $2$ . Physically the reference ambiguity has been removed; algebraically the rows no longer sum to zero, so the all-ones vector is no longer annihilated.
$A = [\begin{matrix} 2 & - 1 & - 1 & 0 \\ - 1 & 2 & - 1 & 0 \\ - 1 & - 1 & 3 & - 1 \\ 0 & 0 & - 1 & 2 \end{matrix}]$
Statements 2, 3, 9 and 10 now hold
Gauss-Jordan elimination on $A$ terminates at the identity, so there are four pivot columns, the rank is $4$ , the nullity is $0$ and the null space is trivial. By the equivalences, the columns are independent, they span $\mathbb{C}^4$ , and they are a basis — none of which required a separate calculation.
$Statements 2, 3, 9 and 10 now hold$
Statements 6 and 4: the inverse and the unique solution
Reducing $[\, A \mid I_4 \,]$ produces the inverse in the same pass. Injecting one ampere at node 1 and nothing elsewhere gives a unique node-voltage vector, obtained as the first column of $A^{-1}$ . Substituting back into $A\vec{v}$ reproduces the injected current vector exactly, which is the check worth doing.
$A^{- 1} = \frac{1}{3} [\begin{matrix} 8 & 7 & 6 & 3 \\ 7 & 8 & 6 & 3 \\ 6 & 6 & 6 & 3 \\ 3 & 3 & 3 & 3 \end{matrix}], \vec{v} = A^{- 1} [\begin{matrix} 1 \\ 0 \\ 0 \\ 0 \end{matrix}] = [\begin{matrix} 8 / 3 \\ 7 / 3 \\ 2 \\ 1 \end{matrix}]$
Statements 11 and 12: the determinant and the spectrum
The determinant is $3$ , non-zero as required. Its role in statement 12 is direct: the constant term of the characteristic polynomial equals the determinant, so $p_A(0) = 3 \ne 0$ and $0$ is not an eigenvalue. Note that no eigenvalue was computed to establish this — a single determinant settles the whole spectral statement.
$\det (A) = 3, p_{A} (x) = x^{4} - 9 x^{3} + 26 x^{2} - 25 x + 3, p_{A} (0) = 3 \neq 0$

Result

The floating network is singular for a reason that is physical rather than numerical: node potentials are defined only up to a common offset, and that offset is exactly the null space direction $[1, 1, 1, 1]^{t}$ . No amount of extra precision or regularisation fixes it, and a solver that appears to succeed on such a matrix has silently chosen one member of an infinite family. Grounding one node changes a single diagonal entry, removes the null space, and flips all thirteen conditions simultaneously — the reduced form becomes the identity, the rank rises to four, the determinant becomes $3$ , the zero eigenvalue disappears, and every injected-current pattern acquires exactly one node-voltage solution.

Overview

Definition

Nonsingular Matrix

Null Space of a Matrix

Matrix Inverse

Multiple Equivalences

Concepts

The thirteen equivalent statements

Four families of statement, and why the traffic between them matters

How the list is assembled: one bridging theorem at a time

The contrapositive list: what a singular matrix looks like

Squareness is the hypothesis that makes the list cohere

Choosing which condition to actually compute

Selecting a nonsingularity test

Equations

Variable Definitions

Worked Numerical Example

Problem statement

Assemble the floating conductance matrix

Statement 3 fails immediately for the floating network

Confirm the remaining twelve statements fail together

Read the spectrum of the singular matrix

Ground one node and re-form the matrix

Statements 2, 3, 9 and 10 now hold

Statements 6 and 4: the inverse and the unique solution

Statements 11 and 12: the determinant and the spectrum

Continue learning