Optimal Equivariant Matchings on the 6-Cube: With an Application to the King Wen Sequence

Abstract: We characterize perfect matchings on the Boolean hypercube {0,1}^n that are equivariant under the Klein four-group K_4 generated by bitwise complement and reversal. For n = 6, we prove there exists a unique K_4-equivariant matching minimizing total Hamming cost among matchings using only comp or rev pairings, achieving cost 120 versus 192 for the complement-only matching. The optimal matching is determined by a simple "reverse-priority rule": pair each element with its reversal unless it is a palindrome, in which case pair with its complement. We verify that the historically significant King Wen sequence of the I Ching is isomorphic to this optimal matching. Notably, allowing comp(rev) pairings yields lower cost (96), but the King Wen sequence follows the structurally simpler rule. All results are formally verified in Lean 4 with the Mathlib library.

• The paper establishes a unique, optimal matching on the Boolean 6-cube using the Klein four-group symmetry and formal verification in Lean 4.
• It introduces the reverse-priority rule that minimizes the total Hamming cost from 192 to 120 by strategically pairing hexagrams via reversal and complementation.
• The work uncovers an isomorphic relationship between the optimal matching and the King Wen sequence, bridging combinatorial optimization with historical mathematical structures.

Optimal Equivariant Matchings on the 6-Cube and the King Wen Sequence

Introduction

This work investigates the structure and optimality of perfect matchings on the Boolean 6-cube, $0,1^6$, that are equivariant under the Klein four-group $K_4$, generated by bitwise complement ($comp$) and bit reversal ($rev$). The motivation stems from both combinatorial optimization and its unexpected connection to the classical King Wen sequence of the I Ching, historically significant in both mathematics and cultural studies. The paper provides a rigorous characterization, proves uniqueness, establishes optimality criteria, and links these results to the King Wen sequence. All theorems and results are formally verified within Lean 4 using the Mathlib library, ensuring their correctness and reproducibility.

Mathematical Foundations

The Boolean hypercube $0,1^6$ admits a natural action by $K_4 = \{\mathrm{id}, comp, rev, comp \circ rev\}$, forming orbits of size either 2 or 4. Each hexagram (element of $0,1^6$) can be classified into generic, palindrome, or anti-symmetric types depending on its symmetry properties under reversal and complementation. The central optimization problem is defined as follows: among all $K_4$-equivariant perfect matchings that only pair elements via $comp$ or $rev$, identify those which minimize the total Hamming cost.

The Hamming cost of a perfect matching $M$ is quantified by:

$$\mathrm{Cost}(M) = \sum_{\{h_1, h_2\} \in M} d_H(h_1, h_2),$$

where $d_H$ denotes standard Hamming distance. Several key group-theoretic and combinatorial properties are established, among them that $d_H(h, comp(h)) = 6$ and $d_H(h, rev(h)) \leq 6$, with equality contingent upon specific anti-symmetry.

The Reverse-Priority Rule and Optimality

The unique optimal $K_4$-equivariant matching is precisely characterized: pair each hexagram with its reversal when possible, and with its complement only in the special case that the hexagram is a palindrome. This "reverse-priority rule" is shown to minimize total Hamming cost over all matchings restricted to $comp$ and $rev$ pairings. Explicitly, for $n=6$, this procedure yields a total Hamming cost of 120, a substantial improvement compared to the complement-only matching at 192.

The matching is proved to be both unique and canonical under these constraints. A crucial technical lemma is that whenever $d_H(h, rev(h)) = 6$, necessarily $rev(h) = comp(h)$, thus nullifying additional choices at points of maximal distance and cementing the uniqueness. Notably, if $comp \circ rev$ pairings are allowed, an even lower Hamming cost of 96 can be achieved, but this requires intricate per-orbit selections rather than a uniform rule.

Isomorphism with the King Wen Sequence

A significant application is demonstrated by proving that the traditional King Wen sequence, originally devised for the 64 hexagrams of the I Ching, encodes exactly the unique optimal $K_4$-equivariant matching attained using the reverse-priority rule. Rigorous analysis shows that every King Wen pair is of the form $\{h, rev(h)\}$ or $\{h, comp(h)\}$, with comprehensive computational and formal verification. The structural regularity of the King Wen sequence is thus reinterpreted as a manifestation of group-equivariant optimality, a fact hitherto unestablished in the literature.

Formal Verification Procedures

All combinatorial and group-theoretic claims, as well as optimality, uniqueness, and isomorphism results, are fully formalized in Lean 4. Key modeling involves encoding hexagrams, defining $K_4$ actions, calculating Hamming distances, and performing exhaustive orbit and pairing checks. The Lean environment utilizes Mathlib's algebraic, combinatorial, and computational capabilities, and all assertions are backed by constructive and computational proofs, including verification of involution properties of the reverse-priority function.

Orbit Structure and Matching Extension

The orbit partitioning induced by $K_4$ plays a key role in delimiting the class of admissible pairings: twelve size-4 orbits (generic hexagrams) and eight size-2 orbits (palindromes and anti-symmetric hexagrams). Within each orbit, distinct equivariant pairings arise from the non-identity involutions. The reverse-priority mechanism, however, selects partners to minimize cost, and alternatives (such as mixed $comp \circ rev$ strategies) can achieve a global minimum only by deviating from uniformity.

Generalization to higher dimensions ($n > 6$) is proposed, with the expectation that similar orbit structures and priority rules apply. The combinatorial complexity, however, grows, and offers a spectrum of possibilities for extremal matchings and potential applications to other algebraic or physical systems.

Implications and Future Directions

The results fuse classical group theory and modern combinatorial optimization with applications to mathematical history. The isomorphism with the King Wen sequence suggests latent mathematical regularities underlying ancient arrangements, and the formal verification framework sets a precedent for rigor in this domain.

Practically, the findings inform equivariant matching in coding theory, symmetric network design, and discrete mathematics. Theoretically, the work prompts further investigation into equivariant optimization across different automorphism groups and hypercube dimensions. The uniformity versus per-orbit optimality tradeoff is particularly relevant for algorithmic implementations where simplicity and computational tractability may outweigh marginal improvements in cost.

Future directions involve extending the analysis to more general group actions, exploring deeper algebraic structures, and integrating these findings into automated theorem provers and combinatorial software libraries.

Conclusion

This paper provides a comprehensive, formally verified solution to the optimal equivariant matching problem on the 6-cube under $K_4$ action and establishes a structural connection with the King Wen sequence of the I Ching. The reverse-priority rule yields a unique cost-minimizing matching, validated by both group-theoretic reasoning and computational verification. The interplay between algebraic symmetry, combinatorial optimization, and historical arrangements offers fertile ground for extension and interdisciplinary applications.