Conditional construction. Let be any finite abelian group with a subgroup of size and quotient of order four. Suppose four sign-valued functions on have combined periodic autocorrelation on the nonzero elements of and off . They yield a Hadamard matrix of order . For order 2396 the outstanding task in this construction is to find the four functions at .
The bordered array and its three matrix conditions are Theorem 7 of Egan, Kotsireas, London and Ó Catháin. Kumar gives a border construction for compressions having one exceptional coset per nonconstant row and discusses how symmetry can enforce that form. We show directly that for either group of order four the autocorrelation equations alone force this form up to independent row translations and sign changes. Our border data adapt Kumar's explicit order-2636 certificate. Theorem 7 · Kumar, search notes §102 · Source certificate
Normalization of the coset sums
Write for the sum of row over coset . Summing the original autocorrelations within cosets shows that the combined periodic autocorrelation of these four compressed rows is at zero and at each other shift. Let be the parity of and put . All these entries are integers. At each nonzero shift ,
Summing over the three shifts counts each unordered pair of distinct cosets twice. Hence the four nonnegative integers
sum to nine. Each is zero or three modulo four. Exactly three are three modulo four, so those three are each three and the remaining one is zero. Four integers with pairwise squared differences summing to three have three equal entries and a fourth differing by one. Indeed any difference of magnitude two already contributes four, and a two-against-two split contributes four.
The zero row variance gives a constant compression. Independently translate each exceptional coset to zero and negate the corresponding row if necessary. Such translations lift to and the changes preserve every autocorrelation. After a row permutation the compressions consequently have the form
At the trivial character the combined squared row sums equal , giving
At the four baselines are odd. Negate the constant row to make and sort the other three baselines. Exactly 14 possibilities remain. The verifier enumerates every admissible baseline and prints the list. Each possibility still requires binary rows on all 596 group elements.
Border certificate
Use the Goethals–Seidel signs in Theorem 3 of the cited survey. On vectors constant on cosets, its core acts by the quotient array of the . Within each of the four quotient blocks restrict to vectors whose four entries sum to zero. A constant compression acts by zero there and a compression acts by . The constant row is the diagonal generator and vanishes on this subspace. Every off-diagonal generator in the array includes the same reflection . Hence the induced core there is , where
Let be the sign matrices in the companion certificate and let be the all-ones matrix. The finite certificate satisfies
Take the left border factor to be . Reflection permutes sign entries and preserves the Gram identity for . Multiplying the last certificate identity on the left by gives the required cross term. The balanced columns of therefore satisfy the cross-term equation of Theorem 7 after replication on cosets. All its hypotheses hold for the normalized core. This proves the conditional construction, including for nonsplit extensions.
The certificate uses Kumar's as and his as with the second and third four-column blocks negated. We computed . The verifier checks every identity in integer arithmetic and assembles two whole matrices at order 60, one for each quotient group, as controls. Border data · Executable check
Symmetries available at order 2396
Here since the two factor orders are coprime. Suppose all four rows are fixed by a common group of group automorphisms in the chosen origins. Then .
First, a prime-order symmetry acting only on must act as an involution or a three-cycle. In the only possibility is inversion, and in the Klein four group the action permutes the three nonzero points. In every case there is an element of order two such that one pair belongs to the same nontrivial orbit, while a fixed point must lie in the other pair. For an involution take its swapped pair. For a three-cycle pick any two nonzero points, whose difference is the third. Thus in every row the two length-149 strings on the first pair are identical. For the other pair let be the number of positions where its two signs agree. The combined correlation at is . The absolute sum of the two coset sums in the other pair is at most . A row with a unique exceptional coset must have that coset fixed, so the other pair contains the exceptional position. Row negations preserve both the agreement counts and the absolute sums. Using the baselines above gives
None of the 14 candidate patterns satisfies this. Consequently injects into , which is cyclic of order 148.
If 37 divides , an element of order 37 acts trivially on and has four length-37 orbits and one singleton on each fiber. A fiber sum must then be congruent to or modulo 37. Every candidate fiber sum has magnitude less than 36, so every one must be or . That would require and , contrary to the squared-row-sum equation. Thus divides four.
Even the largest permitted common multiplier group leaves at least 151 sign orbits per generator. The 592 positions with nonzero coordinate contribute at least 148. On the four remaining positions a cyclic group of order dividing four has image of order at most two on , with at least three orbits. This count concerns fixed common multipliers. Other forms of symmetry may impose different constraints.
Lean verification
The symmetry theorem in the preceding section is fully formalized, including arbitrary finite abelian domains and every common multiplier subgroup. The 12-module closure passed strict source checks, a 216-theorem standard-axiom audit, and independent replay by the unchanged pinned Lean kernel checker. Receipt · Exact checked scope. The earlier normalization and matrix border construction remain separate formalization obligations.
The formal proof uses the raw correlations and does not require the fourteen normalized baseline patterns. Write for the 16 fiber sums. Summing over fiber shifts gives
Thus . A nontrivial quotient automorphism preserving all rows has a moved pair , with of order two and . The actual correlation at and the compressed correlation at imply
The absolute value of the latter sum is at most , a contradiction. This proves injectivity of the actual multiplier projection. An element of order 37 would force each fiber sum to be congruent to or modulo 37. The same magnitude bound then makes all 16 fiber sums signs, contradicting energy 608. The unit group is cyclic of order 148, so the common multiplier group is cyclic of order dividing four.
For the orbit bound, the origin has a singleton orbit. A nonzero point in the characteristic four-torsion subgroup has an orbit of size at most two. Every orbit has size at most four. If there are actual orbits, these two deficits give , hence .
For an original group and subgroup , the formalization constructs the product coordinates from the actual quotient map and the retraction onto . Conjugation identifies the full row-preserving subgroup and its orbit quotient with those in product coordinates. No splitting or prescribed coordinate action is an extra hypothesis.
The certificate's transport to an arbitrary quotient is formalized in HadamardFixedBorderTransport.lean and HadamardFixedBorderFin16.lean. Given the explicit finite certificate fields and a quotient of cardinality four, the theorem constructs the actual relabeled E and reflected F, preserves sign-valuedness, and proves all five transported identities. The two-module closure passed strict source checks, a 66-theorem axiom audit, and unchanged independent kernel replay. Receipt.
The step from compression shapes to actual normalized rows is also formalized. Given one constant compressed row and three compressed rows with exceptional jumps of 2 or -2, the theorem constructs the row permutation, sign changes, and lifted translations on the original group. It proves the exact four normalized compressions, sign-valuedness, and preservation of every combined periodic autocorrelation. No split extension or positive constant baseline is assumed. The two-module closure passed strict source checks, a 14-theorem axiom audit, and independent pinned-kernel replay. Receipt.
The variance argument producing the compression shapes, the literal finite certificate, and final bordered matrix assembly remain separate obligations under issue 17.