cs.CC — Computational Complexity
Thermodynamic saturation and prescribed window barriers for Kleinian-code graded spaces
We investigate prescribed graded-window dimensions for Kleinian-code characters, motivated by the four-leg construction of a subexponential 3-SAT algorithm, but without claiming new admissible algebraic operators. For every compact , we prove, uniformly for isotropic additive codes , $$ \rho_{\mathrm{win}}(V_S;h,\lambda)\geq \frac{1}{\sqrt{2}}+\eta_J-C_Jm^{-1/2}, $$ whenever and , where is specified by the proof but has not yet been evaluated as a certified numerical constant for any given compact interval. The fixed-density proof combines the central-window inequality, sectorwise thermodynamic estimates based on the isotropic local weight bound, finite-length concentration, and certified interval arithmetic (Arb, cross-checked with mpmath.iv) for specified sign inequalities. These numerical certificates do not formalize the complete proof. No concavity or convergence assumption on the code-weight spectrum is needed. For additive codes of 2-rank at most , we also prove that the maximally encoded prescribed-window cost converges uniformly to as , with two-sided explicit errors of order for admissible and . These are statements about window dimensions, not intrinsic matrix ranks or implementations within a SAT algorithm.