Ranks and Transposes | KEVOS® Mathematics

Overview

An $m \times n$ matrix carries a column space inside $\mathbb{C}^m$ and a row space inside $\mathbb{C}^n$ . For a rectangular matrix these are subspaces of different spaces, so their elements are not even comparable — vectors of one have $m$ entries and vectors of the other have $n$ . There is no obvious reason for the two to be related at all. Nevertheless they always have exactly the same dimension.

Since the row space of $A$ is precisely the column space of $A^{t}$ , the statement is equivalent to $\operatorname{rank}(A) = \operatorname{rank}(A^{t})$ : transposing a matrix never changes its rank. This is the reason the single word rank is unambiguous. Without it, every use of the term would have to specify whether the row rank or the column rank was intended, and every result about one would need a separate proof for the other.

The proof is a short chain of already-established facts. A reduction of $A$ to reduced row-echelon form with $r$ non-zero rows produces simultaneously a basis of the column space with $r$ vectors, selected by the pivot columns, and a basis of the row space with $r$ vectors, given by the non-zero rows. The same integer $r$ counts both, and the equality follows. What makes the result feel surprising is that these two bases are constructed by completely different mechanisms from the same reduction.

The symmetry is partial and the boundary matters. Rank transfers under transposition; nullity does not. The null space of $A$ has dimension $n - r$ and the null space of $A^{t}$ has dimension $m - r$ , so the two agree only for square matrices. Confusing the two is one of the more expensive errors available in structural and network analysis, where the two null spaces have entirely different physical meanings.

Definition

Rank of a Matrix is the Rank of the Transpose

RMRT

Let $A$ be an $m \times n$ matrix. Then $\operatorname{rank}(A) = \operatorname{rank}(A^{t})$ . Equivalently, the row space and the column space of any matrix have the same dimension, so the phrases row rank and column rank denote the same number and the qualifier may be dropped.

Row Space of a Matrix

RSM

The row space $\mathcal{R}(A)$ of an $m \times n$ matrix $A$ is the span of its rows, each row regarded as a column vector of size $n$ . It is a subspace of $\mathbb{C}^n$ , and it satisfies $\mathcal{R}(A) = \mathcal{C}(A^{t})$ by construction, since the rows of $A$ are exactly the columns of $A^{t}$ .

Row operations leave the row space unchanged, which is why the non-zero rows of a reduced row-echelon form are a basis of it. Row operations do change the column space, which is why a column space basis must be extracted from the original columns.

Full Row Rank and Full Column Rank

FRC

An $m \times n$ matrix has full column rank when $\operatorname{rank}(A) = n$ , so its columns are linearly independent and $\operatorname{nullity}(A) = 0$ . It has full row rank when $\operatorname{rank}(A) = m$ , so its rows are linearly independent and its column space is all of $\mathbb{C}^m$ . Because rank is bounded by $\min(m,n)$ , a matrix can have both only when it is square.

Concepts

The proof as a chain of equalities

Reduce $A$ to a matrix $B$ in reduced row-echelon form with $r$ non-zero rows. That single integer $r$ has three simultaneous readings in $B$ : the number of leading ones, the number of non-zero rows and the number of pivot columns. The proof uses the last two.

The pivot columns of $B$ select $r$ columns of the original matrix $A$ that form a basis of $\mathcal{C}(A)$ , so $\operatorname{rank}(A) = \dim(\mathcal{C}(A)) = r$ . The non-zero rows of $B$ form a basis of the row space, so $\dim(\mathcal{R}(A)) = r$ as well. Since $\mathcal{R}(A) = \mathcal{C}(A^{t})$ , this last quantity is $\dim(\mathcal{C}(A^{t})) = \operatorname{rank}(A^{t})$ . Reading the chain end to end gives $\operatorname{rank}(A) = \operatorname{rank}(A^{t})$ .

Why the result deserves to be surprising

The two spaces are not merely different sets; for a rectangular matrix they sit in ambient spaces of different sizes and share no vectors whatever. A $4 \times 6$ matrix has a column space inside $\mathbb{C}^4$ and a row space inside $\mathbb{C}^6$ . No natural correspondence between individual elements exists, so no argument that pairs up vectors can work.

What the two spaces do share is the reduction that produced them. The bases arrive by different mechanisms — one by selecting original columns using pivot indices, the other by taking the reduced rows verbatim — yet both are counted by the same $r$ . The equality of dimensions is a property of the reduction, not a property of the vectors, and that is precisely why it is not visible by inspection.

What transposition preserves and what it does not

Rank is preserved; nullity is not. For $A$ the rank-nullity identity reads $\operatorname{rank}(A) + \operatorname{nullity}(A) = n$ , while for $A^{t}$ , which has $m$ columns, it reads $\operatorname{rank}(A^{t}) + \operatorname{nullity}(A^{t}) = m$ . Since the ranks agree at $r$ , the nullities are $n - r$ and $m - r$ respectively, and they coincide only when $m = n$ .

The four subspace dimensions therefore follow from $r$ , $m$ and $n$ alone: the column space has dimension $r$ inside $\mathbb{C}^m$ , the row space has dimension $r$ inside $\mathbb{C}^n$ , the null space has dimension $n - r$ inside $\mathbb{C}^n$ , and the null space of the transpose has dimension $m - r$ inside $\mathbb{C}^m$ . One reduction fixes all four.

The rank bound as a corollary

The column space is spanned by $n$ columns, so $\operatorname{rank}(A) \le n$ . Applying the same reasoning to $A^{t}$ , which has $m$ columns, gives $\operatorname{rank}(A^{t}) \le m$ , and since the two ranks are equal, $\operatorname{rank}(A) \le m$ as well. Together these give the familiar bound $\operatorname{rank}(A) \le \min(m, n)$ .

Without the transpose theorem only the first bound would be available, and a wide matrix could in principle have rank up to its column count. The bound is what guarantees that a wide matrix always has a non-trivial null space, that a tall matrix always has a non-trivial left null space, and that full rank in both senses at once forces a square matrix.

Conjugation, adjoints and products

Rank is unchanged by entrywise conjugation, since conjugating a relation of linear dependence conjugates its coefficients without creating or destroying one. Combining this with the transpose result gives $\operatorname{rank}(A) = \operatorname{rank}(\overline{A}) = \operatorname{rank}(A^{t}) = \operatorname{rank}(A^{*})$ , so all four matrices share a rank.

A related identity is worth stating carefully because a real-matrix habit misleads. Over $\mathbb{C}$ , $\operatorname{rank}(A^{*}A) = \operatorname{rank}(A)$ , because $A^{*}A\vec{x} = \vec{0}$ implies $\vec{x}^{*}A^{*}A\vec{x} = 0$ , which forces $A\vec{x} = \vec{0}$ . The unconjugated product $A^{t}A$ carries no such guarantee for complex matrices and can lose rank. Normal-equations arguments must therefore use the adjoint, not the plain transpose.

Computational consequence: choose the cheaper orientation

Because the rank does not depend on orientation, a rank computation may be performed on whichever of $A$ and $A^{t}$ is cheaper to process. For a strongly rectangular matrix this matters: reducing a $10000 \times 50$ matrix costs on the order of $mn^2$ , whereas a naive algorithm that treats the long dimension as the inner loop can be far slower. Most library routines already handle this internally, but the freedom is worth knowing when writing one's own reduction.

The same invariance underlies the sparse storage duality between compressed row and compressed column formats. A matrix stored by rows may be analysed as its transpose stored by columns with no data movement at all, only a reinterpretation of the index arrays, and the rank obtained is identical.

Procedure: confirm rank invariance under transposition

Reduce $A$ and record $r$ Row-reduce to reduced row-echelon form and count the non-zero rows. This value is

\operatorname{rank}(A)

Extract both bases from the same reductionPivot columns of the reduced form index a column space basis taken from the original

A

; the non-zero rows are a row space basis.

Form $A^{t}$ and reduce itTranspose and repeat the reduction. The count of non-zero rows is

\operatorname{rank}(A^{t})

Compare the two countsThey agree. Any discrepancy is an arithmetic error in one of the two reductions, so this doubles as a verification of both.

Compute the two nullities separately

\operatorname{nullity}(A) = n - r

and

\operatorname{nullity}(A^{t}) = m - r

. Do not expect these to match unless the matrix is square.

Populate the four subspace dimensionsFrom

r

m

and

n

alone, all four fundamental subspaces of

A

have known dimensions.

Equations

Rank invariance under transposition

EQ-RT-01

rank (A) = rank (A^{t})

Holds for every matrix of every shape, over any field. It is the reason the word rank needs no qualifier.

Row space as a column space

EQ-RT-02

R (A) = C (A^{t})

True by construction: the rows of $A$ , written as column vectors, are exactly the columns of $A^{t}$ . This is the bridge that turns a statement about row spaces into one about transposes.

The proof chain

EQ-RT-03

rank (A) = \dim (C (A)) = r = \dim (R (A)) = \dim (C (A^{t})) = rank (A^{t})

Each equality is a previously established fact; the argument contributes only the observation that the same $r$ counts both bases.

Bound on rank

EQ-RT-04

rank (A) \leq min (m, n)

A corollary. The column bound comes from $A$ and the row bound from $A^{t}$ ; neither is available without the invariance.

Nullities are not equal

EQ-RT-05

nullity (A) = n - r, nullity (A^{t}) = m - r

The rank-nullity identity applied to each matrix in turn. The two agree only for square matrices.

Dimensions of the four fundamental subspaces

EQ-RT-06

\dim (C (A)) = r, \dim (R (A)) = r, \dim (N (A)) = n - r, \dim (L (A)) = m - r

All four follow from a single reduction. $\mathcal{L}(A)$ denotes the left null space, which is the null space of $A^{t}$ .

Adjoint and Gram products

EQ-RT-07

rank (A) = rank (\bar{A}) = rank (A^{*}) = rank (A^{*} A)

The final equality uses the adjoint, not the plain transpose: over $\mathbb{C}$ the product $A^{t}A$ can have strictly smaller rank than $A$ .

Variable Definitions

Symbols used on this page
Symbol	Name	Meaning	Domain / type
$A$	Matrix	The $m \times n$ matrix under study	m x n complex matrix
$A^{t}$	Transpose	The $n \times m$ matrix obtained by exchanging rows and columns	n x m complex matrix
$A^{*}$	Adjoint	Conjugate transpose; shares the rank of $A$ and satisfies $\operatorname{rank}(A^{*}A) = \operatorname{rank}(A)$	n x m complex matrix
$r$	Rank	Number of non-zero rows of the reduced row-echelon form; counts both bases	0 to min(m,n)
$m$	Row count	Rows of $A$ ; ambient dimension of the column space and left null space	positive integer
$n$	Column count	Columns of $A$ ; ambient dimension of the row space and null space	positive integer
$C (A)$	Column space	Span of the columns, of dimension $r$	subspace of C^m
$R (A)$	Row space	Span of the rows written as column vectors, of dimension $r$	subspace of C^n
$L (A)$	Left null space	Null space of $A^{t}$ , of dimension $m - r$	subspace of C^m

Worked Numerical Example

Problem statement

A four-sensor, six-actuator influence matrix is measured on a test rig. Determine its rank from the matrix and again from its transpose, exhibit bases of the row and column spaces, and show that the two nullities differ.

State the influence matrix
Rows correspond to sensors and columns to actuators, giving $m = 4$ and $n = 6$ . Nothing about the shape suggests any relationship between the sensor-side and actuator-side subspaces.
$A = [\begin{matrix} 1 & 2 & 0 & - 1 & 0 & 3 \\ 1 & 2 & 1 & 1 & 0 & 2 \\ 2 & 4 & - 1 & - 4 & 1 & 11 \\ 0 & 0 & 1 & 2 & 1 & 3 \end{matrix}]$
Reduce $A$
Eliminate left to right. Column 2 acquires no pivot, being twice column 1; columns 4 and 6 likewise contribute no new directions. One zero row appears, so one sensor row is a combination of the others.
$RREF (A) = [\begin{matrix} 1 & 2 & 0 & - 1 & 0 & 3 \\ 0 & 0 & 1 & 2 & 0 & - 1 \\ 0 & 0 & 0 & 0 & 1 & 4 \\ 0 & 0 & 0 & 0 & 0 & 0 \end{matrix}]$
Read the rank and both bases
Three non-zero rows give $\operatorname{rank}(A) = 3$ , with pivot columns $D = \{1, 3, 5\}$ . The non-zero rows are a basis of the row space, a subspace of $\mathbb{C}^6$ ; the original columns indexed by $D$ are a basis of the column space, a subspace of $\mathbb{C}^4$ .
$C (A) = span ([\begin{matrix} 1 \\ 1 \\ 2 \\ 0 \end{matrix}], [\begin{matrix} 0 \\ 1 \\ - 1 \\ 1 \end{matrix}], [\begin{matrix} 0 \\ 0 \\ 1 \\ 1 \end{matrix}])$
Note that the two bases share nothing
The row space basis vectors have six entries and the column space basis vectors have four. They are not merely different vectors; they belong to different ambient spaces and cannot be compared entry by entry. Only their counts can be compared, and both are three.
$R (A) = span ([\begin{matrix} 1 \\ 2 \\ 0 \\ - 1 \\ 0 \\ 3 \end{matrix}], [\begin{matrix} 0 \\ 0 \\ 1 \\ 2 \\ 0 \\ - 1 \end{matrix}], [\begin{matrix} 0 \\ 0 \\ 0 \\ 0 \\ 1 \\ 4 \end{matrix}])$
Form the transpose
Exchanging rows and columns produces a $6 \times 4$ matrix. Its columns are the rows of $A$ , so its column space is the row space of $A$ .
$A^{t} = [\begin{matrix} 1 & 1 & 2 & 0 \\ 2 & 2 & 4 & 0 \\ 0 & 1 & - 1 & 1 \\ - 1 & 1 & - 4 & 2 \\ 0 & 0 & 1 & 1 \\ 3 & 2 & 11 & 3 \end{matrix}]$
Reduce the transpose independently
Perform a fresh reduction with no reference to the first. Three pivot columns emerge and three zero rows appear at the bottom, giving $\operatorname{rank}(A^{t}) = 3$ — the same value obtained from $A$ , by a completely separate computation.
$RREF (A^{t}) = [\begin{matrix} 1 & 0 & 0 & - 4 \\ 0 & 1 & 0 & 2 \\ 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{matrix}]$
Compare the two nullities
Apply the rank-nullity identity to each matrix using its own column count. The results differ, and the difference is exactly the difference in shape.
$nullity (A) = 6 - 3 = 3, nullity (A^{t}) = 4 - 3 = 1$
Tabulate the four subspace dimensions
One integer $r = 3$ , together with $m = 4$ and $n = 6$ , fixes every dimension. The column space and left null space live in $\mathbb{C}^4$ and their dimensions sum to $4$ ; the row space and null space live in $\mathbb{C}^6$ and their dimensions sum to $6$ .
$\dim (C (A)) = 3, \dim (L (A)) = 1, \dim (R (A)) = 3, \dim (N (A)) = 3$

Result

The rig has three independent influence directions, whether counted from the sensor side or the actuator side. Three of the six actuator combinations produce no sensor response at all, while only one sensor combination is redundant — the asymmetry between the nullities $3$ and $1$ reflects the shape of the rig, not any deficiency in the rank result. In commissioning terms, the actuator set is substantially over-provisioned and the sensor set is very nearly minimal.

Applications & Industry Use

Structural engineering

Static-kinematic duality

The equilibrium matrix relating member forces to nodal loads and the compatibility matrix relating nodal displacements to member extensions are transposes of one another. Rank invariance is what guarantees that the two analyses agree on the number of independent equations, and it is the algebraic root of the classical duality between statics and kinematics in framework analysis.

Electrical engineering

Loop and node formulations agree

Mesh analysis and nodal analysis of the same network are built from an incidence matrix and its transpose. Because rank is invariant, both formulations identify the same number of independent equations, so the choice between them is a matter of convenience and sparsity rather than of information content. The differing nullities are what predict the count of independent loops against independent node potentials.

Data science & machine learning

Orientation-independent rank of a data matrix

A data matrix with samples as rows and features as columns has the same rank as its transpose, so the number of independent directions is the same whether the data is viewed as a cloud of samples or a set of feature vectors. This is what allows a covariance analysis of a wide dataset to be computed from the far smaller Gram matrix of samples, with identical results and vastly reduced cost.

Signal processing

Low-rank approximation of transposed arrays

The rank of an image or a sensor snapshot matrix is unchanged by transposition, so a low-rank approximation is equally valid computed row-wise or column-wise. Implementations exploit this by always factoring the orientation with the smaller dimension, which reduces both the arithmetic and the memory footprint without altering the approximation.

Chemical & process engineering

Reactions and species balances

The stoichiometric matrix and its transpose describe the same network from the reaction side and the species side. Rank invariance means the count of independent reactions determined from one orientation equals the count of independent species balances from the other, while the differing nullities give the numbers of conserved moieties and of reaction cycles respectively.

High-performance computing

Storage format duality

Compressed sparse row storage of a matrix is bit-for-bit compressed sparse column storage of its transpose. Because rank does not depend on orientation, a sparse rank or nullspace computation can be performed in whichever format the data already occupies, eliminating an explicit transpose that would otherwise dominate the runtime for large sparse matrices.

Design Considerations

Never assume the nullities transfer

Rank is invariant under transposition; nullity is not. For a $10000 \times 20$ matrix of full rank, $\operatorname{nullity}(A) = 0$ while $\operatorname{nullity}(A^{t}) = 9980$ . Code that computes one and reports the other will not fail loudly — both are plausible non-negative integers — and the physical interpretations are entirely different.

Compute rank in the cheaper orientation

For a strongly rectangular matrix, factoring the orientation with the smaller trailing dimension saves substantial work and memory. Since the answer is identical either way, this is a free optimisation. Most library routines already choose internally, but hand-written reductions and streaming implementations often do not.

Use the adjoint in normal-equation arguments

Over the reals $A^{t}A$ has the same rank as $A$ , and the habit transfers incorrectly to complex matrices. Over $\mathbb{C}$ the guarantee attaches to $A^{*}A$ , because the argument relies on $\vec{x}^{*}A^{*}A\vec{x}$ being a squared norm. Forming $A^{t}A$ for a complex matrix can produce a rank-deficient product from a full-rank matrix.

Avoid materialising a transpose

An explicit transpose of a large dense matrix is a memory-bandwidth-bound operation with poor cache behaviour, and for a sparse matrix it may cost more than the factorisation that follows. Library interfaces accept transpose flags precisely so that the operation can be fused into the computation; use them rather than copying.

Use the two reductions as a mutual check

Because the two ranks must agree, computing both is a genuine verification of the arithmetic rather than a repetition of it. The two reductions share no intermediate quantities, so an error in either is very unlikely to produce matching counts. For hand computation on a small matrix this is the cheapest available confidence check.

In floating point, compare spectra rather than integers

The singular values of $A$ and $A^{t}$ are identical in exact arithmetic, but computed values differ slightly, so a tolerance sitting near a singular value can yield different integer ranks from the two orientations. Treat such a disagreement as evidence that the rank is not well determined at the available precision, not as an implementation defect.

Standards & Codes

Notation, interchange and numerical standards that govern how this material is written down, stored and computed in production systems.

Applicable standards, conventions and reference implementations
Reference	Title	Relevance to this topic
`ISO 80000-2`	Quantities and units — Part 2: Mathematics	Fixes the notation for the transpose and the conjugate transpose and distinguishes them typographically, a distinction that matters directly for the rank identity involving $A^{*}A$ .
`BLAS Level 3`	Basic Linear Algebra Subprograms, Level 3 specification	Defines the `TRANS` parameter that lets `xGEMM` and related routines operate on a transposed operand in place, so rank work can exploit orientation invariance without materialising the transpose.
`LAPACK / BLAS reference`	Linear Algebra PACKage reference implementation	Its factorisation routines internally select the cheaper orientation for strongly rectangular input, an optimisation justified precisely by the invariance of rank under transposition.
`IEEE 754-2019`	IEEE Standard for Floating-Point Arithmetic	Explains why computed singular values of $A$ and $A^{t}$ differ in the last digits, so that a rank tolerance sitting near a singular value can give different integer answers from the two orientations.
`ISO/IEC 40314`	Mathematical Markup Language (MathML) Version 3.0	Encodes the superscript transpose and adjoint notation semantically rather than as glyphs, preserving the distinction between $A^{t}$ and $A^{*}$ for search and assistive technology.

Material Selection

For a mathematical topic, "material" is the numeric representation: the scalar field, storage format and precision the computation is built from.

Representation and precision selection
Representation	Select when	Trade-off
Column-major dense storage	Interfacing with LAPACK, BLAS or Fortran-derived numerical libraries.	Native for the reference implementations and their transpose flags, but strided access when the algorithm naturally traverses rows, which costs cache efficiency.
Row-major dense storage	C, C++ and NumPy default layouts, and algorithms that stream over samples.	Natural for row-oriented traversal and for treating a data matrix sample by sample, but requires transpose flags or copies at library boundaries.
Compressed sparse row (CSR)	Sparse matrices consumed row by row, such as constraint or incidence matrices.	Fast row access and identical in memory to compressed sparse column storage of the transpose, so orientation can be reinterpreted at zero cost; column access is expensive.
Compressed sparse column (CSC)	Sparse factorisations and column-oriented elimination.	The dual of CSR with the same zero-cost reinterpretation, but the choice must match the algorithm or an explicit conversion is forced.
IEEE 754 binary64 with SVD	Rank of a measured rectangular matrix where the decision has engineering consequences.	Gives the same singular values from either orientation up to rounding and exposes the margin of the rank decision, at several times the cost of an elimination.
Exact rational arithmetic	Structural, incidence or stoichiometric matrices where the rank is a combinatorial fact and the transpose check is used as a verification.	Guarantees the two orientations agree exactly, making the cross-check meaningful, but is impractical at the sizes typical of discretised models.

Manufacturing Notes

Implementation notes — how the result is actually produced by hand, by algorithm and by library, including cost and numerical behaviour.

Cost of the two reductions

Reducing an $m \times n$ matrix costs $O(mn\min(m,n))$ operations, and the same figure applies to its transpose, so verifying the identity by computing both roughly doubles the work. For a strongly rectangular matrix the cost is dominated by the smaller dimension squared times the larger, which is why an SVD of a $10000 \times 50$ matrix is entirely practical while the shape alone might suggest otherwise.

Hand procedure and its verification value

Reduce $A$ , record $r$ and both bases, then transpose and reduce again from the original entries rather than from any intermediate. Because the two computations share nothing, agreement of the two counts is strong evidence that both are correct. Disagreement localises the error to one of the two reductions and is worth the extra effort on any hand calculation that matters.

Library behaviour

numpy.linalg.matrix_rank returns the same value for A and A.T up to tolerance effects, and A.T is a view rather than a copy, so the transposed call carries no data movement. LAPACK routines take a TRANS argument for the same reason. SciPy's sparse csr_matrix.T returns a CSC view of the same buffers. In every case, deliberately materialising the transpose is the wrong move.

Extracting all four subspaces from one reduction

Reducing the matrix augmented with an identity block yields the row space and column space bases together with the left null space in a single pass, avoiding a second reduction of the transpose. Where all four fundamental subspaces are required, this extended reduction is roughly half the work of computing the null space of $A$ and of $A^{t}$ separately.

Floating-point agreement between orientations

The singular values of $A$ and $A^{t}$ are mathematically identical, so a robust numerical rank agrees between orientations. When it does not, the tolerance is sitting inside the noise floor of the spectrum. Rather than choosing one orientation as authoritative, widen the reported result to an interval or state that the rank is not resolvable at the available precision.

Failure Modes & Common Mistakes

Failure modes, root causes and prevention
Failure mode / mistake	Impact	Root cause	Prevention & detection
Assuming nullity is invariant under transposition	high	Rank invariance is generalised to nullity, so $\operatorname{nullity}(A^{t})$ is reported as $\operatorname{nullity}(A)$ .	Apply the rank-nullity identity separately to each matrix using its own column count: $n - r$ for $A$ and $m - r$ for $A^{t}$ .
Confusing the null space with the left null space	high	The two are both called null spaces and have different ambient dimensions and different physical meanings — mechanisms against self-stress states, for example.	Name them distinctly, $\mathcal{N}(A)$ and $\mathcal{L}(A)$ , and check that the vector length matches the ambient space before interpreting a result.
Using $A^{t}A$ instead of $A^{*}A$ for complex data	high	A real-matrix identity is carried over to complex matrices, where the unconjugated product can lose rank.	Use the conjugate transpose in every Gram-matrix or normal-equations construction over $\mathbb{C}$ ; verify that the product is Hermitian as a sanity check.
Extracting a column space basis from the reduced form	medium	The pivot columns of the reduced matrix are used as basis vectors, but row operations change the column space.	Transfer only the pivot indices; take the basis vectors from the original matrix. The row space basis, by contrast, may be read directly from the reduced rows.
Materialising a transpose unnecessarily	medium	An explicit copy is created before a rank computation, dominating the runtime for large dense or sparse matrices.	Use transpose flags, views or the dual sparse format. In NumPy a transpose is a free view; in LAPACK it is a parameter.
Treating a rank disagreement between orientations as a bug	medium	Computed singular values differ in the final digits, so a tolerance near a singular value yields different integer ranks.	Compare the singular value spectra rather than the integers, and report the rank as unresolved when the gap at the tolerance is small.
Inferring that row space and column space are the same set	medium	Equality of dimension is read as equality of the subspaces, which for a rectangular matrix is not even type-correct.	Note the ambient spaces: $\mathcal{C}(A) \subseteq \mathbb{C}^m$ and $\mathcal{R}(A) \subseteq \mathbb{C}^n$ . Only the dimensions are shared.
Assuming full row rank and full column rank can hold together	low	The two notions are conflated under the single phrase full rank for a rectangular matrix.	Since rank is bounded by $\min(m,n)$ , both can hold only when $m = n$ . State which is meant whenever the matrix is not square.

FAQs

Why is it surprising that row rank equals column rank?

Because for a rectangular matrix the row space and the column space are subspaces of different ambient spaces. Their vectors have different lengths and cannot be compared at all, so no argument pairing individual vectors can work. The equality is a property of the reduction that produces both bases, not of the vectors themselves.

Does the row space equal the column space when the dimensions agree?

No, and for a rectangular matrix the question is not even well posed — the two are subspaces of $\mathbb{C}^n$ and $\mathbb{C}^m$ . Even for a square matrix they are generally different subspaces of the same space; equality holds for symmetric matrices but is exceptional otherwise.

Do a matrix and its transpose have the same null space?

Almost never. The null space of $A$ sits in $\mathbb{C}^n$ with dimension $n - r$ , while the null space of $A^{t}$ — the left null space of $A$ — sits in $\mathbb{C}^m$ with dimension $m - r$ . For a rectangular matrix they are not even the same size, and for a square matrix they generally differ as sets despite having equal dimension.

How does this result give the bound

\operatorname{rank}(A) \le \min(m,n)

The column space is spanned by $n$ columns, so the rank is at most $n$ . Applying the same reasoning to $A^{t}$ , which has $m$ columns, bounds $\operatorname{rank}(A^{t})$ by $m$ ; since the two ranks are equal, the rank of $A$ is bounded by $m$ as well. Combining the two gives the minimum.

Is the rank of

A^{t}A

always equal to the rank of

A

Over the real numbers yes, but over the complex numbers the correct statement uses the adjoint: $\operatorname{rank}(A^{*}A) = \operatorname{rank}(A)$ . The proof relies on $\vec{x}^{*}A^{*}A\vec{x}$ being a squared norm, which fails for the unconjugated product. Complex normal-equation formulations must use the conjugate transpose.

Can I save work by transposing before computing rank?

Yes, and it is free correctness-wise. Reducing whichever orientation has the smaller trailing dimension saves substantial arithmetic for strongly rectangular matrices, and the answer is identical. In practice use a transpose flag or a view rather than copying the data, since materialising the transpose can cost more than the computation.

Does the result hold over fields other than the complex numbers?

Yes. The proof uses only row reduction and the counting of pivot columns and non-zero rows, both of which are available over any field. Rank invariance under transposition therefore holds over the rationals, the reals, and finite fields used in coding theory and cryptography.

References

Beezer, R. A. A First Course in Linear Algebra, Version 0.70. University of Puget Sound, 2006. Section PD, subsection RT. Licensed under the GNU Free Documentation License v1.2.
ISO 80000-2:2019, Quantities and units — Part 2: Mathematics. International Organization for Standardization.
Golub, G. H. and Van Loan, C. F. Matrix Computations, 4th edition. Johns Hopkins University Press, 2013.
Strang, G. 'The fundamental theorem of linear algebra'. American Mathematical Monthly, 100(9), 1993.
Anderson, E. et al. LAPACK Users' Guide, 3rd edition. Society for Industrial and Applied Mathematics, 1999.
Dongarra, J. J. et al. 'A set of Level 3 Basic Linear Algebra Subprograms'. ACM Transactions on Mathematical Software, 16(1), 1990.

AI Suggested Questions

Construct a 3x7 matrix of rank 2 and verify that its transpose also has rank 2, listing bases for all four fundamental subspaces.
Give a complex matrix for which rank(A^t A) is strictly less than rank(A), and show why the adjoint version does not fail.
Explain the static-kinematic duality of a pin-jointed truss in terms of the equilibrium matrix and its transpose.
For a 20000x40 data matrix, compare the cost of computing rank directly against computing it from the 40x40 Gram matrix.
Show a matrix where a singular value tolerance produces different integer ranks for A and A transpose, and explain what to report.
Why does rank invariance under transposition hold over a finite field, and where would the argument fail if it did not?

Related Calculators

Matrix Rank & Nullity Calculator

Compute the rank of a matrix and of its transpose side by side, together with both nullities and the four subspace dimensions.

Row Space Basis Calculator

Return a canonical basis of $\mathcal{R}(A)$ from the non-zero rows of the reduced form, and a basis of original rows via the transpose.

Four Subspaces Calculator

Produce bases and dimensions for the column space, row space, null space and left null space from a single extended reduction.

Matrix Transpose Calculator

Transpose a matrix, optionally conjugating, and compare the ranks and singular value spectra of the two orientations.