One-node branching conjecture for dyadic Walsh--Hadamard truncations
One-node branching conjecture for dyadic Walsh--Hadamard truncations
Let be a set of columns of a dyadic-truncated Walsh--Hadamard matrix with exactly one node, such that each branch is complete above the node. Let be the submatrix consisting of the columns in . Define by assigning to each column at or above the node its length on a selected primary branch, while retaining for columns whose length is smaller than the nodal length. One-node branching conjecture.
This asserts that replacing the branching above a single node by a primary-branch truncation cannot decrease the norm. It is intended as the key reduction toward the optimality of the standard truncation, but the extract gives no resolution.
Progress summary
The conjecture remains unproved: its source explicitly gives no proof, and no verified counterexample or solution was found.
The conjecture says that replacing branching above one node by truncation along a selected branch cannot reduce the operator norm, expressed by . Joseph D. Lakey presents it as Conjecture 6 in work on dyadic Walsh--Fourier partial sums.
Lakey's formulation (2026)
Lakey states that Conjecture 6 is part of a proposed reduction toward optimality of the standard truncation, but explicitly says that no actual proof is provided. The source reports numerical and heuristic support for a related conjecture, not an established proof of this one.
Current status (as of August 2026): The one-node branching conjecture remains open; its proposed reduction is recorded, but no proof, verified counterexample, or corroborating resolution was found.
Sources
Sources & referencesView supporting material
Primary source
Joseph D. Lakey, “Towards direct L^2-bounds for maximal partial sums of Walsh–Fourier series: The case of dyadic partial sums”, arXiv:2602.17627 (2026).
Solutions 1
Sign in to submit a solution.
A full-matrix counterexample to the one-node Walsh--Hadamard branching conjecture
Source and scope. Joseph D. Lakey, Towards direct -bounds for maximal partial sums of Walsh--Fourier series: The case of dyadic partial sums, arXiv:2602.17627v1, Definitions 4--5 and Conjecture 6. The related published paper by J. A. Hogan and J. D. Lakey, Mathematics 14 (2026), Article 829, studies approximate eigenvectors of the standard truncation and explicitly leaves optimal-truncation results to forthcoming work.
Conjecture 6 asserts that eliminating the unique branching node cannot decrease the spectral norm. We exhibit a dyadic truncation with exactly one node for which eliminating that node strictly decreases the norm, regardless of which branch is selected as primary. The counterexample uses the entire Walsh--Hadamard matrix, and all columns outside the two branches are strictly below the node, so their lengths are expressly required to remain unchanged. The construction extends to every dyadic dimension at least .
1. A source-faithful full-matrix construction
Let and let be the normalized Walsh--Hadamard matrix in the source's Paley ordering. Its zeroth and fourth columns are
and
Define the dyadic truncation map on every column by
Take to consist of all columns. Since every Walsh column starts with , the other columns of are all equal to
The two full-length columns agree in rows and , differ in row , and are orthogonal. Therefore they form exactly one branching node, at level
Each branch above this node consists of a single full-length column and is consequently complete. Every remaining column has length : these columns are strictly below the node, not at the node.
Select either branch as primary. The other full-length column must then be shortened to its maximal prefix compatible with the primary branch, namely the common length-two prefix
The source explicitly requires every column of length strictly smaller than to remain unchanged. Thus all copies of remain fixed. The two possible node-reduced matrices are
Their column Gram matrices coincide up to a permutation because
The failure therefore does not depend on a favorable interpretation of the primary-branch choice.
2. Exact spectral separation
Multiply the column Gram matrices by to clear the Walsh normalization. The equal short columns contribute a -dimensional kernel. On the orthogonal complement, their normalized collective direction has coefficient .
Before eliminating the node, the resulting symmetric matrix is
Its antisymmetric branch direction has eigenvalue . The remaining two eigenvalues are
Consequently
because .
For either choice of the primary branch, the node-reduced matrix has compressed Gram matrix
At the integer comparison point , the three leading principal minors of are
All are strictly positive. Sylvester's criterion therefore gives
and hence
Combining (7) and (10) proves the strict reversal
This contradicts the asserted inequality in Conjecture 6 for both permissible choices of primary branch.
3. Counterexamples in every dyadic dimension at least sixteen
More generally, let
In the Paley-ordered Walsh--Hadamard matrix, take
The column with index has sign pattern
Exactly as above, there is one node at level , both branches above it are complete singletons, and all remaining columns have length . Under either permitted primary-branch choice the other long column becomes its length-two prefix, while every short column remains fixed.
After multiplying the Gram matrices by , their nonzero spectra are the spectra of
The largest eigenvalue before node reduction is
The characteristic polynomial of is
At the old top eigenvalue, direct substitution gives
For , the elementary inequality
holds because . Therefore
The first two leading principal minors of are
and
Indeed, and for . The third leading principal minor is by (17). Another application of Sylvester's criterion gives
so
Thus the one-node conjecture fails in infinitely many dimensions even for the full column set, genuinely below-node fixed columns, two complete above-node branches, and either choice of primary branch. This does not contradict the distinct Conjecture 8 about the more restricted standard two-branch matrices.