One-node branching conjecture for dyadic Walsh--Hadamard truncations

From papers

Let C\mathcal{C} be a set of columns of a dyadic-truncated Walsh--Hadamard matrix WΦW_\Phi with exactly one node, such that each branch is complete above the node. Let WΦ,CW_{\Phi,\mathcal{C}} be the submatrix consisting of the columns in C\mathcal{C}. Define Φ\Phi' by assigning to each column at or above the node its length on a selected primary branch, while retaining Φ\Phi for columns whose length is smaller than the nodal length. One-node branching conjecture.

WΦ,CWΦ,C.\|W_{\Phi',\mathcal{C}}\|\geq\|W_{\Phi,\mathcal{C}}\|.

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

Open

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 WΦ,CWΦ,C\|W_{\Phi',\mathcal C}\|\geq\|W_{\Phi,\mathcal C}\|. 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

Counterexample

A full-matrix counterexample to the one-node Walsh--Hadamard branching conjecture

Source and scope. Joseph D. Lakey, Towards direct L2L^2-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 1616.

1. A source-faithful full-matrix construction

Let N=4N=4 and let WH4WH_4 be the normalized 16×1616\times16 Walsh--Hadamard matrix in the source's Paley ordering. Its zeroth and fourth columns are

u=14(1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1)Tu=\frac14(1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1)^{\mathsf T}

and

w=14(1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1)T.w=\frac14(1,1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,-1)^{\mathsf T}.

Define the dyadic truncation map on every column by

Φ(0)=Φ(4)=16,Φ(j)=1for j{0,4}.(1)\Phi(0)=\Phi(4)=16, \qquad \Phi(j)=1 \quad \text{for }j\notin\{0,4\}. \tag{1}

Take C\mathcal C to consist of all 1616 columns. Since every Walsh column starts with 1/41/4, the other 1414 columns of WΦ,CW_{\Phi,\mathcal C} are all equal to

z=14e0.(2)z=\frac14e_0. \tag{2}

The two full-length columns agree in rows 00 and 11, differ in row 22, and are orthogonal. Therefore they form exactly one branching node, at level

L=1,2L=2.L=1, \qquad 2^L=2.

Each branch above this node consists of a single full-length column and is consequently complete. Every remaining column has length 1<2L1<2^L: 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

h=14(1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0)T.(3)h=\frac14(1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0)^{\mathsf T}. \tag{3}

The source explicitly requires every column of length strictly smaller than 2L2^L to remain unchanged. Thus all 1414 copies of zz remain fixed. The two possible node-reduced matrices are

[uhzz]and[hwzz].(4)[u\mid h\mid z\mid\cdots\mid z] \qquad\text{and}\qquad [h\mid w\mid z\mid\cdots\mid z]. \tag{4}

Their column Gram matrices coincide up to a permutation because

16u,h=16w,h=2,16u,z=16w,z=16h,z=1.(5)16\langle u,h\rangle =16\langle w,h\rangle =2, \qquad 16\langle u,z\rangle =16\langle w,z\rangle =16\langle h,z\rangle =1. \tag{5}

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 1616 to clear the Walsh normalization. The 1414 equal short columns contribute a 1313-dimensional kernel. On the orthogonal complement, their normalized collective direction has coefficient 14\sqrt{14}.

Before eliminating the node, the resulting symmetric 3×33\times3 matrix is

Mbefore=(1601401614141414).(6)M_{ \mathrm{before} } = \begin{pmatrix} 16&0&\sqrt{14} \\ 0&16&\sqrt{14} \\ \sqrt{14}&\sqrt{14}&14 \end{pmatrix}. \tag{6}

Its antisymmetric branch direction has eigenvalue 1616. The remaining two eigenvalues are

15±29.15\pm\sqrt{29}.

Consequently

WΦ,C222=15+2916>54,(7)\|W_{\Phi,\mathcal C}\|_{2\to2}^2 = \frac{15+\sqrt{29}}{16} > \frac54, \tag{7}

because 29>5\sqrt{29}>5.

For either choice of the primary branch, the node-reduced matrix has compressed Gram matrix

Mafter=(162142214141414).(8)M_{ \mathrm{after} } = \begin{pmatrix} 16&2&\sqrt{14} \\ 2&2&\sqrt{14} \\ \sqrt{14}&\sqrt{14}&14 \end{pmatrix}. \tag{8}

At the integer comparison point 2020, the three leading principal minors of 20IMafter20I-M_{\mathrm{after}} are

4,68,44.(9)4, \qquad 68, \qquad 44. \tag{9}

All are strictly positive. Sylvester's criterion therefore gives

20IMafter0,20I-M_{\mathrm{after}}\succ0,

and hence

WΦ,C222<2016=54.(10)\|W_{\Phi',\mathcal C}\|_{2\to2}^2 < \frac{20}{16} = \frac54. \tag{10}

Combining (7) and (10) proves the strict reversal

WΦ,C222<54<WΦ,C222.(11)\boxed{ \|W_{\Phi',\mathcal C}\|_{2\to2}^2 < \frac54 < \|W_{\Phi,\mathcal C}\|_{2\to2}^2. } \tag{11}

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

N4,n=2N,r=n2.N\ge4, \qquad n=2^N, \qquad r=n-2.

In the Paley-ordered n×nn\times n Walsh--Hadamard matrix, take

Φ(0)=Φ(2N2)=n,Φ(j)=1for all other j,C={0,1,,n1}.(12)\Phi(0)=\Phi(2^{N-2})=n, \qquad \Phi(j)=1 \quad \text{for all other }j, \qquad \mathcal C=\{0,1,\ldots,n-1\}. \tag{12}

The column with index 2N22^{N-2} has sign pattern

(1,1,1,1,1,1,1,1,).(1,1,-1,-1,1,1,-1,-1,\ldots).

Exactly as above, there is one node at level 11, both branches above it are complete singletons, and all rr remaining columns have length 1<21<2. 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 nn, their nonzero spectra are the spectra of

Mn=(n0r0nrrrr),Mn=(n2r22rrrr).(13)M_n = \begin{pmatrix} n&0&\sqrt r \\ 0&n&\sqrt r \\ \sqrt r&\sqrt r&r \end{pmatrix}, \qquad M_n' = \begin{pmatrix} n&2&\sqrt r \\ 2&2&\sqrt r \\ \sqrt r&\sqrt r&r \end{pmatrix}. \tag{13}

The largest eigenvalue before node reduction is

λ=n1+2n3.(14)\lambda = n-1+\sqrt{2n-3}. \tag{14}

The characteristic polynomial of MnM_n' is

fn(x)=x32nx2+(n24)xn2+4n4.(15)f_n(x) = x^3-2nx^2+(n^2-4)x-n^2+4n-4. \tag{15}

At the old top eigenvalue, direct substitution gives

fn(λ)=n28n+842n3.(16)f_n(\lambda) = n^2-8n+8-4\sqrt{2n-3}. \tag{16}

For n16n\ge16, the elementary inequality

2n3<n2\sqrt{2n-3}<\frac n2

holds because (n2)(n6)>0(n-2)(n-6)>0. Therefore

fn(λ)>n210n+8>0.(17)f_n(\lambda) > n^2-10n+8 >0. \tag{17}

The first two leading principal minors of λIMn\lambda I-M_n' are

λn=2n31>0\lambda-n = \sqrt{2n-3}-1 >0

and

(λn)(λ2)4>0.(18)(\lambda-n)(\lambda-2)-4 >0. \tag{18}

Indeed, 2n3>5\sqrt{2n-3}>5 and λ2>18\lambda-2>18 for n16n\ge16. The third leading principal minor is fn(λ)>0f_n(\lambda)>0 by (17). Another application of Sylvester's criterion gives

λIMn0,\lambda I-M_n'\succ0,

so

WΦ,C22<WΦ,C22for every N4.(19)\boxed{ \|W_{\Phi',\mathcal C}\|_{2\to2} < \|W_{\Phi,\mathcal C}\|_{2\to2} \qquad \text{for every }N\ge4. } \tag{19}

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.

0 endorsements
Shivam Patel ·