A Differentiable Measure of Algebraic Complexity: Provably Exact Discovery of Group Structures

Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of associativity violation replaces linear rank as the intrinsic measure of complexity. We provide a rigorous landscape analysis of HyperCube, an operator-valued tensor factorization, on the fully observed target table δ, proving that its global infimum Hinf(δ) := infTheta ∈ Fδ H(Theta) implicitly defines an exact differentiable measure for this complexity. We show that HyperCube's native objective H(Theta) decomposes into two components: geometric alignment (collinearity) and an inverse ℓ2 penalty. We establish that these continuous variational pressures induce core discrete properties: collinearity enforces associativity (Collinearity--Associativity Equivalence), and the inverse ℓ2 penalty reduces to an exact inverse rank penalty within the collinear manifold, driving the parameters toward full-rank unitarity. Consequently, we derive an absolute lower bound H(Theta) ≥ Hinf(δ) ≥ 3 , |δ|, where |δ| is the target table size. We prove this absolute floor is attained if and only if the target is isotopic to a group, and characterize the global minimizer as the regular representation of the underlying group (up to unitary gauge), resolving the central open conjecture of Huh (2025). This work serves as an existence proof that certain discrete algebraic structures can be exactly characterized by differentiable measures, enabling gradient-based discovery without the need for combinatorial search. All theoretical results are mechanically verified in Lean 4 and confirmed via small-scale experiments.