Skip to content

Weighing matrix

A square 0, +1 and −1 matrix whose rows have equal weight and are mutually orthogonal.

Version
v1 · 2026-10-31 · History
Domain-specific #
14597
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Combinatorial Matrix Theory → Mathematics

Core Idea

A weighing matrix \(W(n,w)\) is a real square \(n\times n\) matrix with entries \(0,+1,-1\) satisfying \(WW^{\mathsf T}=wI_n\). Here \(n\) is a positive integer and \(0\leq w\leq n\) is an integer. Each row has exactly \(w\) nonzero entries, and different rows have inner product zero. The name comes from signed arrangements for weighing objects, although membership does not require a physical experiment.[1]

If \(w>0\), the matrix is invertible, with \(W^{-1}=W^{\mathsf T}/w\). At \(w=0\), the zero matrix satisfies the definition but is singular.[1]

How would you explain it like I'm…

Plus-Minus Balance Grid

Picture a square grid filled with plus signs, minus signs, and empty spots. Every row has the same number of filled spots. And if you line up any two different rows, the spots where both have signs come out exactly even: as many matching as not matching.

Rows That Cancel Out

A Weighing matrix is a square grid of numbers where every entry is 0, +1 or −1. Each row has exactly the same number of nonzero entries, called the weight w. Also, if you take any two different rows, multiply them spot by spot and add up, you get zero; mathematicians call that being 'orthogonal.' The name comes from using plus and minus patterns to weigh several objects together, but the grid doesn't need an actual scale to count. When w is more than zero, you can use the grid to undo the mix and recover the original values.

Signed Orthogonal-Row Matrix

A Weighing matrix W(n, w) is an n×n matrix with entries 0, +1 and −1 satisfying W Wᵀ = wI, where I is the identity matrix and w is an integer from 0 to n. The diagonal of this product says each row has exactly w nonzero entries, and the zeros off the diagonal say distinct rows are orthogonal (their dot product is zero). The name comes from signed arrangements for weighing objects together, but the definition doesn't require any actual weighing. When w > 0, the inverse is Wᵀ/w, so you can recover a measured vector, and the columns are orthogonal as well. When w = 0, the zero matrix fits the equation but has no inverse, so recovery is an application only for positive weight.

 

A weighing matrix W(n, w) is a real n×n matrix with entries in {0, +1, −1} satisfying WWᵀ = wI_n, where n is a positive integer and w is an integer with 0 ≤ w ≤ n, called the weight. The diagonal entries of WWᵀ force each row to contain exactly w nonzero entries, and the off-diagonal zeros force distinct rows to be orthogonal. The name derives from designs for weighing objects in signed combinations on a balance, but membership in the class requires no such experiment. For w > 0, the identity implies W⁻¹ = Wᵀ/w, so WᵀW = wI_n as well and the columns satisfy the same orthogonality condition. For w = 0 the zero matrix satisfies the defining equation but is not invertible, so recovering a vector from weighed combinations is an application available only for positive weight.

Scope of Application

The definition describes a mathematical class, not an existence guarantee for every order and weight. Hadamard matrices are the full-weight case; real conference matrices in the zero-diagonal convention are a particular weight-\(n-1\) case. Weighing matrices can also be used in constructions involving codes and lattices.[1][2]

Clarity

Matrix weight counts the nonzero entries in each row; it is distinct from the masses of objects in a weighing application. To check a proposed matrix, multiply it by its transpose and compare the result with \(wI_n\). A signed array with a nonzero inner product between distinct rows fails the test.

Manages Complexity

The single product records both conditions: its diagonal gives the row norms and its off-diagonal entries give the pairwise inner products. A candidate can therefore be checked in one calculation, even though finding a matrix with specified parameters may be a separate problem.

Abstract Reasoning

For \(w>0\), suppose observations follow \(y=Wx+\varepsilon\). Reconstruction by \(\hat{x}=W^{\mathsf T}y/w\) yields \(x+W^{\mathsf T}\varepsilon/w\). If errors have mean zero and covariance \(\sigma^2I_n\), the estimate has covariance \(\sigma^2I_n/w\). This variance result depends on those assumptions; correlated or unequal-variance errors require their own analysis.[1]

Knowledge Transfer

The same square shape, restricted entries and orthogonality can organize different problems. A balance design interprets the signs as placements in opposite pans; a code construction reduces integer rows modulo three. The applications share a matrix structure, not necessarily a physical interpretation or noise model.[1][2]

Examples

A four-object theoretical balance design uses

\[ H=\begin{pmatrix}1&1&1&1\\1&-1&1&-1\\1&1&-1&-1\\1&-1&-1&1\end{pmatrix},\quad HH^{\mathsf T}=4I_4. \]

Each row is a weighing and each column an object. Under independent, equal-variance errors of variance \(\sigma^2\), reconstruction gives each estimated mass variance \(\sigma^2/4\). This is a model calculation, not a reported experiment.[1]

Chandrasekaran, Gandikota and Grigorescu use

\[ M=\begin{pmatrix}1&1&1&0\\1&-1&0&1\\1&0&-1&-1\\0&1&-1&1\end{pmatrix},\quad MM^{\mathsf T}=3I_4. \]

This is \(W(4,3)\). Its rows reduced modulo three generate a ternary code of length four and rank two; its integer rows generate an orthogonal lattice. The paper's characterization concerns its specified ternary Construction-A setting, not arbitrary moduli or every weighing matrix.[2]

Neighborhood in Abstraction Space

Weighing matrix sits in a sparse region of the domain-specific corpus (79th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2835 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-31

Not to Be Confused With

A general real orthogonal matrix need not use only \(0,+1,-1\). A Hadamard matrix is a weighing matrix with no zero entries; a weighing matrix may contain zeros. A physical weighing design may use such a matrix, but the matrix alone does not establish an experiment or a practical accuracy gain.

References

[1] Thomas Pender, Balanced Group Matrices: Theory and Applications, University of Lethbridge, 2020, Chapter 2, printed pp. 16–17. The balance example is a model with stated independent equal-variance errors. registry ↩a ↩b ↩c ↩d ↩e ↩f

[2] Karthekeyan Chandrasekaran, Venkata Gandikota and Elena Grigorescu, “Deciding Orthogonality in Construction-A Lattices”, SIAM Journal on Discrete Mathematics 31 (2017), 1244–1262, DOI 10.1137/15M1054766. Matrix and Theorem 1.3, p. 1246; Lemma 2.6, p. 1249; proof, pp. 1255–1258. registry ↩a ↩b ↩c