For every $m\ge4$ and $s\ge2$, we construct a strictly positive rational antiferromagnetic target of rank two on at most ten states whose partition polynomial for $C_m[K_s]$ is not Lorentzian. The state bound is independent of both parameters; seven states suffice when $s\ge9$, and six suffice for even $m$. The new case is an odd cycle, whose edges are critical for its independence number and hence fall outside the earlier independence-stable blowup theorem. We classify the minimum-induced-edge occupations and compress their leading Hessian kernel to an initial block of at most eight profiles. For $s\ge20$, a five-profile block has inertia $(2,3,0)$, proved by six exact coefficient certificates in the cycle length, clique size and central binomial coefficient. Eighteen bounded clique sizes are covered by polynomial certificates for infinite cycle-length tails and 42 explicit integer exceptions. We retain failures of smaller blocks and give a positive seven-state witness for $C_5[K_9]$. The target may depend on $m,s$; neither optimality nor the general connected-source characterization is claimed.
Working paper. Citable, but not yet screened for the AIRR collection.
We prove dimension-independent additive bounds on two-way entanglement distillation. For every conjugate local diagonal unitary invariant state, distillable entanglement, secret key and relative entropy of entanglement lie in an explicitly computable interval of width at most log2(5) bits per copy. For the broader class invariant under local diagonal signs, the diagonal-relative-entropy reference exceeds distillable entanglement by at most log2(9). The proof uses established partial breeding with a stopped classification whose entropy is bounded independently of dimension; a reduction-based seed pays for all initial assistance. The resulting recovery bound also implies at most log2(6) ebits of irreversibility for any mixture of a pure state and separable noise, without a marginal constraint, and controls mixtures with a mixed maximally correlated component. For an identity component mixed with arbitrary channel noise, we give six capacity guarantees and reduce their simultaneous worst cases to depolarizing channels. An explicit isotropic interval has absolute width tending to 2(1-f) at fixed entangled fraction f, refining the known relative large-dimension approximation. For general discrete Hamiltonians with a finite partition sum at some temperature, we identify the exact spectral boundary of absolute entanglement-assisted recovery: for each fixed reset state, the loss vanishes precisely when the partition sum diverges at its critical inverse temperature. In that regime all six capacities attain their erasure benchmarks with absolute o(1) loss. In the complementary regime every fixed reset has a strictly positive limiting assisted deficit, given by a critical-Gibbs variational formula. An explicit integer spectrum has an exact constant-loss plateau. The reset may have infinite energy or entropy. Oscillator consequences include reversible distributed states and a vanishing classical arbitrary-partner additivity defect. Optimal constants, efficient implementations and general exact finite-energy capacities remain unresolved.
Working paper. Citable, but not yet screened for the AIRR collection.
Let F be a finite connected simple graph with at least one edge such that deleting any edge leaves its independence number unchanged. For every integer s at least two, we prove that the clique blowup F[K_s] admits a strictly positive rational rank-two antiferromagnetic target on six states whose graph partition polynomial is not Lorentzian. The proof classifies minimum-induced-edge subsets using equality in Turan's theorem, identifies an exact four-profile block of inertia (2,2,0), and compresses all higher profiles by a scaled generalized Vandermonde matrix. This yields obstructions for connected biregular bipartite bases other than K2 and for connected bases with a unique maximum independent set and at least one edge. Exact computations check 994 base graphs, 720 stable blowups and four positive rational six-state Hessian witnesses. Six is an upper bound; optimality, uniform target parameters and the general connected-source characterization remain open.
Working paper. Citable, but not yet screened for the AIRR collection.
We give rank-two antiferromagnetic obstructions to the Lorentzian property of graph partition functions. A connected noncomplete source of maximum degree Delta has a strictly positive rational obstruction on Delta+1 spins whenever no two maximum-degree vertices have equal closed neighbourhoods. This covers graphs without true twins, unique maximum-degree vertices and connected noncomplete edge-regular graphs. Conditioned-set Hessian kernels also yield a neighbourhood-independence-gap criterion. One fixed nonnegative four-spin target characterizes cliques among connected diamond-free and complete multipartite sources; a fixed five-spin target does so for joins of a nonempty clique with disjoint nonempty cliques. Positive perturbations may depend on the source. Exact certificates cover all 989 connected noncliques of orders three through seven. An explicit ten-vertex graph shows that the small-parameter criterion is incomplete. The connected-source conjecture and completeness of the full hierarchy remain open.
Working paper. Citable, but not yet screened for the AIRR collection.
We give a computable reduction from the halting problem to approximating a normalized determinant optimized over matrix coefficients of unrestricted auxiliary dimension. The coefficient matrices are real rational, orthonormal for normalized Hilbert--Schmidt inner product, and have covariance-optimized operator capacity exactly one. Nevertheless, approximating the determinant optimum to one fixed additive precision is undecidable. The proof combines the synchronous linear-game hardness theorem of Taller and Vidick with a homogeneous multiplication block, weighted rational normalization, and two quantitative rounding arguments. A positional-question normalization handles repeated queries without identifying distinct answer positions. No total recursive uniform bound on auxiliary witness dimension exists even at one fixed precision. The source hardness is inherited; the contribution is its determinant reduction. The gap constant is very small, and global priority is not certified.
Working paper. Citable, but not yet screened for the AIRR collection.
We construct real rational matrix tuples whose covariance-optimized operator capacity is explicitly known, but whose amplified determinant witnesses have large or undecidable dimension requirements. A rational multiplication block converts signed unitary relations into a linear matrix pencil. Its unequal coefficients keep every unitary-labelled block uniformly invertible, allowing quantitative control of the logarithmic determinant. Balancing gives both a doubly stochastic coefficient map and a scalar Gram matrix. Applied to finite Clifford relations and established stability bounds, the construction yields a polynomial-size family with an exact finite optimizer for which inverse-polynomial relative accuracy requires exponentially large auxiliary dimension. Applied to known results on linear-system games, it makes both finite exact saturation and asymptotic saturation undecidable, and produces nonattainment at every finite auxiliary size. The undecidability and Clifford dimension theorems are inherited inputs; the contribution is their balanced determinant reduction. No constant-gap approximation hardness or noncomputability of numerical approximation is asserted.
Working paper. Citable, but not yet screened for the AIRR collection.
We characterize continuous strictly increasing scalar qubit entropies for which support-radial minimax duality holds on every multiqubit orbit closure: universal validity is equivalent to concavity, and the four-qubit W state is a complete test. Four qubits are minimal even within the Renyi family: order three satisfies the identity for every two- and three-qubit tensor but fails on W4, whereas order four already fails on W3. The sharp universal binary Renyi range is 0<alpha<=2. At min-entropy, W3 contradicts the first identity of Theorem 60 in the specified arXiv and journal versions of Christandl-Lysikov-Zuiddam. We give weighted W-state formulas, a convexification repair that retains the reverse identity, and a typical-projector explanation of regularization. Known scalar curvature, polytope, minimax and unweighted asymptotic facts are credited. Priority remains open.
Working paper. Citable, but not yet screened for the AIRR collection.
We study forward-query tests of an arbitrary fixed unitary channel against memoryless noise with unknown fixed input and output rotations. A Schur-Weyl reduction gives a family of optimal candidate tests, but leaves a channel-dependent minimization over partitions. We remove that minimization: the balanced partition is optimal simultaneously for every channel, every query number and every compact alternative family, even against adaptive and more general positive physical testers. A Gaussian Kraus-matrix identity and classical majorization yield the universal optimizer, exact determinant error exponents, polynomial finite-query bounds, and a sharp rank threshold for perfect detection. For qubits, the spin-flip spectrum determines all even-query errors. Using classical noncommutative-rank theory, we characterize stability of perfect detection under every tensor partner by a shrunk-subspace condition. A completely depolarizing partner of dimension d-1 destroys perfect detection whenever this condition fails. For the qutrit Werner-Holevo channel we compute exact exponents after adjoining the smallest possible partner, a depolarizing qubit, and for its tensor square. The independent unknown rotations, memoryless calls, unrestricted retained reference and enlarged global-unitary null in the tensor examples are essential.
Working paper. Citable, but not yet screened for the AIRR collection.
We consider repeated forward access to an unknown quantum channel. The null hypothesis is an arbitrary fixed unitary channel; the alternative is a memoryless channel whose input and output rotations are unknown but fixed across all uses. We prove a complete-class theorem: every physical positive tester is dominated, in orbit-averaged alternative acceptance and worst-case null acceptance, by a classical randomization of explicitly realizable parallel tests. The tests are indexed by partitions of the query number, prepare a maximally mixed representation register, entangle the multiplicity register with a reference, and measure return to that entanglement. Consequently, for any compact family of noise channels, the exact finite-query minimax problem reduces to a classical optimization over partitions. For one specified noise channel the complete error tradeoff is a minimum of explicit Choi-polynomial invariants. Adaptation and any larger positive-tester class containing parallel protocols give the same optimum. We derive the channel-independent optimal two-query test and its failure probability in terms of Choi purity and nonunitality. For complete depolarization we obtain the exact error at every dimension, query number and parallel reference dimension, recovering the known exponential benefit of multiplicity entanglement. We also give an error exponent for orthogonal random-unitary noise. The result requires both unknown rotations and memoryless uses; it does not establish parallel optimality for calibrated noise or arbitrary channel discrimination.
Working paper. Citable, but not yet screened for the AIRR collection.
Can interventions distinguish an unknown phase that is frozen throughout an experiment from phase noise renewed at every use? We study ordinary forward queries, arbitrary quantum memory, and exactly zero false positives for every frozen diagonal unitary. For any Schur channel with correlation matrix C, the optimal parallel failure probability is min over occupation vectors m of per(C[m])/n!. The same formula is the exact optimum over all causal strategies when the renewed channel has an unknown common phase carrier and failure is evaluated in the worst case over that carrier. Calibration changes this conclusion: for qubit dephasing we give a rational five-query certificate that beats every parallel strategy for 0.5331424052... < eta < 1. At eta=0.7, failure decreases from 0.46603 to 0.4602957928558. We prove physical realizability of the certificate, obtain exact causal limits at complete dephasing, and show that adaptation cannot improve the asymptotic failure exponent. The separation concerns finite-query performance under a calibrated statistical promise; it neither quantifies the hardware cost of a phase reference nor certifies a quantum environment.
Working paper. Citable, but not yet screened for the AIRR collection.
Whether a dephasing experiment can exclude static Hamiltonian disorder depends on the arithmetic of its measurement times. At every finite set of rationally independent positive times, we prove that a real dephasing semigroup with strictly positive off-diagonal rates has an exact finite static diagonal-Hamiltonian alias, using at most 1+k d(d-1) atoms for k times and d levels. An explicit bounded-energy ensemble also matches the semigroup on every point of a sufficiently coarse uniform grid. Conversely, every rate matrix outside the cut cone has a separating certificate on finitely many odd harmonics, valid against arbitrary static Hermitian ensembles without an energy bound. A certified qutrit design uses 20 times and 40,500 total shots for each error probability below 5%. We prove finite-menu timing fragility, a spectral-width stability bound, and an inverse-error lower bound on alias bandwidth. Fresh bounded continuous time randomization provides an alternative: independent bounded additive timing error can be tolerated without an energy prior, with a 53,000-shot qutrit certificate. The results concern memoryless single-use channel experiments; they do not certify a quantum environment. General proofs, exact rational numerical certificates, and reproducibility material accompany the manuscript.
Working paper. Citable, but not yet screened for the AIRR collection.
Can stationary states at a few reset rates distinguish fluctuating dephasing from an arbitrary distribution of static Hamiltonians? For a qubit, every finite list of stationary states of a real dephasing semigroup has a finite static alias. We exhibit a sharp obstruction for a qutrit. If c_jk(nu) is the real, normalized stationary coherence under Poisson resets and A(nu)=[c_12(nu)+c_23(nu)]/2, every static diagonal Hamiltonian ensemble, without support or moment restrictions, satisfies A(a)+9A(4a)-5c_13(4a) <= 5 for a>0. The completely positive semigroup with generator -gamma[D,[D,·]], D=diag(0,1,2), gives 16/3 at a=2gamma. We prove the inequality by an explicit polynomial certificate, determine all its finite equality points, and show that the exact infimum of the uniform error in the three selected statistics is 1/45. The infimum is approached by seven-point static ensembles but is attained by no probability measure on R^2. A single reset rate cannot exclude static disorder for this semigroup. We also give a deterministic error rule, a finite-shot implementation, and a spectral coupling that extends the exclusion to arbitrary static qutrit Hamiltonian ensembles with noisy population calibration. If all three population leakages at rate a are at most delta, the bound becomes W_a <= 5+30 sqrt(2delta)+30delta. This is a witness against static disorder, not against classical time-dependent noise or a proof of a quantum environment.
Working paper. Citable, but not yet screened for the AIRR collection.
Four orthonormal bases define a quantum measurement channel by averaging their nonselective rank-one projective measurements. We determine the exact Hilbert–Schmidt relaxation rate of the Poisson semigroup generated by this channel minus the identity, for the one-parameter subfamily introduced by Raynal, Lü and Englert in their study of approximately mutually unbiased bases in dimension six. A block decomposition gives the complete spectrum as explicit quadratic polynomials in the parameter. The largest relaxation rate within this subfamily, with equal measurement probabilities and unit total event rate, is exactly 73/100, attained uniquely at u=7/10. This parameter does not maximize the mean squared chordal distance between the bases. An exact rational comparison exhibits a larger mean distance with a smaller relaxation rate. We also prove the 2/3 ceiling for arbitrary mixtures of product-vector measurement bases on C² ⊗ C³, which the construction exceeds. The optimality statement is restricted to the specified subfamily; no global four-basis optimality or new mutually unbiased basis construction is claimed.
Working paper. Citable, but not yet screened for the AIRR collection.
Inside a Lean 4 formalization programme for four-dimensional SU(Nc) lattice Yang–Mills, this paper studies the operator-theoretic criterion between exponential decay of a connected correlator and a spectral gap. Let T be a bounded self-adjoint operator on a Hilbert space, let Ω be a fixed unit vector, and set S = T − |Ω⟩⟨Ω|. The dense-family criterion states that if the vectors whose S-orbits decay at one common exponential rate r form a dense set, then ‖S‖ ≤ r, even when each vector has its own arbitrary finite prefactor. The decay domain is a linear subspace, so a densely spanning observable family suffices. The corrected manuscript supplies an elementary dyadic proof alongside the historical Lean functional-calculus formalization. The underlying criterion is classical; the contribution is its mechanization and packaging for observable families. The paper constructs no gauge-theory Hilbert space, proves no reflection positivity of the Wilson measure, and identifies no physical correlator with an operator matrix element. It makes no continuum-limit or Clay-problem claim. The release preserves historical formal evidence and distinguishes it from the paper-level additions; no fresh complete Lean build is certified.
For the one-parameter family B(x) = x/(nu+c+sqrt((nu+c)^2+x^2)) of Amos-type expressions, whose member c = 1/2 is the classical Amos-type upper bound for the modified Bessel ratio I_{nu+1}/I_nu, we formalize in Lean 4, at every real order nu >= 0 over the Gamma-power series, the classification of the parameter: B is a uniform upper bound for the ratio exactly when c <= 1/2, and a uniform lower bound for every c >= 1, with explicit rational counterexample witnesses (the classification itself is known mathematics, due to Ruiz-Antolin and Segura; we claim only the machine-checking). The contribution is the regime between the ends: for every nu >= 0 and c strictly between 1/2 and 1 we prove that the fixed family member crosses the ratio exactly once on (0, infinity) -- a transversal crossing in an explicit finite window, strictly above an explicit threshold, with globally determined sign on both sides and a two-sided scale law; degenerate contact is excluded by an exact second-derivative identity. The chain carries the axiom oracle [propext, Classical.choice, Quot.sound] and no analytic hypothesis beyond nu >= 0, x > 0; a pre-registered certified interval-arithmetic companion verifies the crossing phenomenon independently of the crossing theorems at 30 parameter pairs spanning the hard regimes, all passing at 128 bits.
The Amos-type upper bound for the modified Bessel function ratio, rho_nu(x) = I_{nu+1}(x)/I_nu(x) < x/(nu + 1/2 + sqrt((nu+1/2)^2 + x^2)), is classical, and its derivation through the qualitative theory of the associated Riccati equation is an established technique. A companion paper formalized the bound at integer order over a factorial power series. This paper extends the formalization to every real order nu >= 0: the function I_nu is defined by its Gamma-power series (real exponents via rpow), and the complete chain — convergence, positivity, the three-term recurrence, termwise differentiation with a dominated-derivative argument that must treat the leading term separately (its exponent nu-1 is negative for nu < 1), the Riccati equation, a small-argument zone bound uniform in nu, and a first-crossing barrier — is machine-checked in Lean 4 with axiom oracle [propext, Classical.choice, Quot.sound] and no analytic hypothesis beyond nu >= 0, x > 0. Two structural locks tie the result to the integer development: an identification theorem proves that at nu = n the Gamma-series object coincides with the factorial-series object, so the integer-order theorem of the companion development is recovered as a corollary in three rewrites; and a genuinely non-integer instance at nu = 1/2 witnesses that the endpoint lives outside the natural-number embedding. The theorem is proved for the in-core Gamma-series definition; no identification with an external special-functions library object is claimed.
How many internal state coordinates in a specified rational realization are required to transmit prescribed quantum noise channels without loss while suppressing all signal directions elsewhere? This paper synthesizes classical degree and phase-volume mechanisms in a protected signal/loss formulation for finite rational inner networks. For a rational inner scattering matrix of McMillan degree n, exact lossless calibration subspaces at distinct regular boundary frequencies have nodewise total dimension at most n if the signal block is a strict contraction at another boundary frequency. Local nullity forces multiplicity in a nonzero complementary loss minor; exterior powers of minimal Blaschke-Potapov factors bound its zeros by n. The same factorization identifies degree with integrated Wigner-Smith trace delay in the unit-circle/sample-delay coordinate; an explicit rotated Cayley map supplies a continuous-frequency convention and chain-rule delay conversion; a physical oscillator count is conditional on a minimal annihilation-only passive realization. An explicit finite inner family attains the bound. The Rouche extension preserves complex zero counts in disjoint pole-free closed regions for rational inner perturbed transfers holomorphic there and satisfying a strict contour margin for the same loss minor. Sampled approximate calibration alone cannot imply a degree bound. A previously constructed irreducible six-port reservoir filter has 3S exact calibration zeros and degree 3S+6, within six states of the optimum among finite rational inner completions with the same exact calibration data and a strict stop. Its exact integrated trace delay is 3S+6 and its peak grows exponentially. Under a specified stationary weak-coupling Markov model, the rate interpretation counts nodewise preserved input dimensions at distinct frequencies. Numerical degree entries are analytic formula values, not computed minimal realizations; quadrature and root audits test the explicit family. Sources, corrections and dated executions remain distinguished.
For a traceless Hermitian matrix F, this paper minimizes the product of the unnormalized Hilbert--Schmidt norms of Hermitian H and K satisfying -i[H,K]=F. On the complete one-spike spectral cone with nonzero spectrum (P,-b_1,...,-b_n), it proves the exact formula kappa_d(F)=sum_j j b_j, fixes the nonzero singular spectrum and rank of every balanced optimum, derives sharp trace-distance stability and strict Schur concavity, and remains invariant under ambient zero padding. For every finite-dimensional traceless Hermitian target, it also proves exact balanced-loop laws A_3(F)=12 sqrt(3) kappa_d(F) and A_4(F)=16 kappa_d(F), giving a universal 23.02 percent fourth-kick reduction. The work does not give a closed formula when both sign multiplicities exceed one, classify all optimizing matrices, or claim exhaustive bibliographic priority.
For a nonzero traceless Hermitian matrix F, this paper studies the least product of unnormalized Hilbert--Schmidt norms of Hermitian H and K satisfying -i[H,K]=F. Writing rho=rank(F) and P(F)=||F||_1/2, it proves the sharp dimension-free bounds P(F)<=kappa_d(F)<=rho P(F)/2. Both equality loci are classified: the lower endpoint is attained exactly by centrally paired nonzero spectra, while the upper endpoint is attained exactly, up to positive scale and sign, by the one-spike spectrum (rho-1,-1,...,-1), with arbitrary zero padding. An exact sign-cut leakage identity identifies the full tax above the trace-norm floor. The upper bound uses an exact weighted-shift permutation average, and rho-1 explicit Horn--Littlewood--Richardson inequalities certify upper-endpoint sharpness. The work does not claim a closed formula for general interior spectra or an upper-endpoint stability modulus.
A quantum list measurement succeeds when its output contains the prepared label. Building on the known equivalence between learning width and Gram-matrix factor width, this paper closes an exact realization-sensitive branch. Every full-spark ensemble of N pure-state rays spanning C^r that admits strictly positive tight representatives has minimum zero-error list size N-r+1. Weighted Hodge duals of all (r-1)-fold frame wedges give an explicit attaining POVM, and a physical-space annihilator-cone formulation gives constructive compression to at most r^2 outcomes. A smallest-eigenvalue functional supplies a positive and perturbatively stable Bayes-error floor below threshold. For a flat consecutive-support Schmidt-rank-r probe of the complete d-dimensional Weyl-channel ensemble, the fixed-probe threshold is d-r+1. When r divides d, an arithmetic-support construction and dimension converse close the optimization over all pure Schmidt-rank-r probes at d/r. For the consecutive rank-two probe, the complete one-shot Bayes list curve is determined exactly. The nondivisible probe optimum, adaptive or multiuse testers, asymptotic capacity, arbitrary mixed states, and non-scalable full-spark ensembles remain outside scope.
Let G be a compact connected Lie group with a bi-invariant metric. For the two-dimensional heat-kernel Yang--Mills model, this paper gives an explicit finite chain from a boundary-conditioned edge integral on an arbitrary regular annular cellulation to the gauge-invariant class-function transfer kernel. Conditional Haar coordinates make the boundary constraints and boundary-edge subdivision precise. Edge and face subdivision invariance, an explicit PL radial-cut construction, and a primal-tree/dual-cotree disk-elimination schedule yield a cellulation-independent orbital heat-kernel integral. Peter--Weyl theory then diagonalizes the transfer operator with multipliers exp(-t c_lambda). The exact mean-zero norm is exp(-t c_*(G)), the gap of I-T_t is 1-exp(-t c_*(G)), and the equality sector consists of all irreducible characters with minimum positive Casimir. In the stated SU(2) normalization the sharp exponent is 3/4, while the induced SO(3) quotient removes the fundamental channel and raises it to 2. The work assembles and audits classical two-dimensional Yang--Mills ingredients; it does not claim a new character solution, four-dimensional mass gap, continuum reconstruction, or clustering for arbitrary bulk observables.
In quantum list discrimination a measurement returns at most ell candidate labels and succeeds when the true hypothesis belongs to the returned list. We associate a Rado independent-transversal matroid to the support subspaces of a mixed quantum ensemble and prove that every true-label inclusion vector lies in the independence polytope of the ell-fold matroid union. This yields all-subset Bayesian bounds for arbitrary priors, soft rewards, an integer congestion deficit, equality audits, and canonical compression to quantum-process testers. Exact attainment and insufficiency examples separate support combinatorics from quantum geometry. We then solve two input-dependent process families. For binary laminar dephase-prepare channels with M=2^h, list size ell=2^s, and q uses, arbitrary entangled parallel probes and adaptive quantum memories obey P_parallel=min(1,ell(q+1)/M) and P_adaptive=min(1,ell 2^q/M). For complete unitary-error ensembles we translate the known approximate dense-coding spectrum law into a list cap, derive an exact serial/parallel/Bell multitime trichotomy, and give a fixed-probe example where the coarse list-rank cap is not attained. The matroid theorem is a support obstruction rather than a general POVM feasibility characterization; the laminar separation is a classical feedback tradeoff embedded quantumly, and no indefinite-causal-order advantage is claimed.
Let P be a Haar-distributed complex Grassmann projector and consider the matrix--Bingham normalizer Z_A(s)=E exp{s tr(AP)} on the trace-zero, Frobenius-unit external sphere. We prove exact complementary results for its canonical two-level branch geometry. On every half Grassmannian Gr_C(r,2r), the balanced rank-r field strictly maximizes the normalized two-block moments of degrees 4, 6, 8, and 10. Exact endpoint analysis gives balanced dominance at small and large field, while a finite certification theorem reduces coefficientwise all-field order at each fixed rank to a terminating block of rational Hankel signs plus an analytic tail. At Gr_C(3,6), a closed all-degree argument proves strict balanced order for every field. At Gr_C(4,8), exact rational arithmetic through degree 268 and the analytic tail give a second all-field theorem. On Gr_C(2,5), compact overlap densities, Sturm arithmetic over Q(sqrt(6)), and strict total positivity prove a unique simple exchange in the complete oriented two-level family. The results do not classify arbitrary multi-level external spectra and do not claim an unrestricted all-distortion rate--distortion function.
Let a compact group act orthogonally on a sphere and let mu be the invariant law of a proper antipodal orbit. We study the exponential orbital potential. At a point of the source orbit, every spherical-harmonic coefficient of the orbit average is a squared norm, giving an exact negative spherical-Laplacian identity at every nonzero field. Provided the source orbit is critical--automatically so when the normal isotropy representation has no fixed vector--irreducibility, or a transitive symmetry of its irreducible normal blocks, upgrades this trace identity to strict Morse--Bott maximality for every field. An explicit torus-orbit counterexample shows why criticality cannot be omitted. Applied to centered projector embeddings of the real, complex, and quaternionic half-Grassmannians, the theorem proves all-field local rigidity of the balanced matrix--Bingham branch and excludes a radial spinodal. In the complex case, exact Jacobi-generator identities yield constrained-Hessian operators for every two-block external spectrum and a sharp weak-field metastability threshold at k=2r/3. A Stein inequality closes every sufficiently high Taylor degree at each fixed multiplicity. The results constrain unresolved intermediate phases but do not claim global spectral optimality, a complete finite-field phase diagram, or an all-distortion rate--distortion function.
We give a finite-sample test for whether one joint Gaussian sketch covariance is compatible with a positive-semidefinite matrix-valued measure supported on a prescribed interval. The observed vector contains several exponent blocks, so its population covariance is one block-Hankel Gram matrix rather than a list of unrelated moment estimates. The classical truncated matricial Hausdorff theorem supplies the exact parity-dependent null. A single Gaussian singular-value event gives a simultaneous Loewner band for the whole covariance; intersecting that band with the structured moment cone yields a nonasymptotic level-alpha semidefinite test without sample splitting. The full joint Gram is strictly more informative than the integer-time localizer used in the preceding finite-sample method: an explicit two-atom family satisfies the old population condition but violates the half-time condition. We prove opposing finite-sample power guarantees above an explicit threshold on the same acquisition. At regular boundary points, the constrained likelihood ratio converges to squared Gaussian distance from an explicit spectrahedral tangent cone, giving pointwise local power and a matching root-n separation boundary. We also give auditable dual semantics and an exact rational certificate for the strict fixture. Classical moment, concentration, and constrained-likelihood ingredients are attributed explicitly; the contribution is their structured joint-sketch integration and strict same-data separation.
Minimum-error discrimination of quantum processes is normally optimized over testers whose normalization may encode parallel, sequential, or indefinite-order access. For a fixed physical deterministic normalization, Moore-Penrose compression maps the tester exactly to a POVM on normalized effective states and preserves every conditional probability. We associate to the support subspaces of arbitrary positive process operators a Rado matroid on the hypothesis labels and prove that every correct-label probability vector lies in its independence polytope. Consequently the Bayes success probability is at most the prior weight of a maximum-weight independent transversal. A robust extension replaces exact supports by arbitrary positive low-rank cores and charges only the prior-weighted worst-case discarded tester mass; valid full-rank process admixture of weight eta degrades the certificate by at most eta. We give an explicit reduction to linear matroid intersection, an equality audit at strict prior drops, a deterministic Gram criterion for perfect rank-one discrimination, and exactly solved qubit phase-gate families. In a five-channel instance the exact general-tester optimum is 0.80 while the total-dimension relaxation is 0.90. The result is a support-based upper bound and is not claimed to determine every mixed-process optimum.
Fix a nonzero dominant weight lambda and let the highest weight grow along the ray N lambda. We study the exact classical Shannon rate-distortion function of the invariant phase-lifted coherent orbit in V_{N lambda} under squared ambient Hilbert-space loss. The finite-N scalar formula is known; the new problem is the coupled large-weight and distortion limit. If d_N is the dimension of V_{N lambda}, ell_N=log d_N, and a=dim_C(G_C/P_lambda)+1/2, we prove that the unique global origin-tangent contact, for all sufficiently large N, obeys t_c=2 ell_N+2a log ell_N+log(4 pi)-a+o(1), while the contact distortion is a/ell_N+o(ell_N^{-1}) and its time-sharing slope is ell_N+a log ell_N+log(2 sqrt(pi))+o(1). All root-system and Weyl leading constants cancel in these dimension variables. For fixed 0<D<=1, the exact unrestricted RDF satisfies R_N(D)/ell_N -> 1-D. On the noncommuting boundary scale D=x/ell_N, the centered rate converges locally uniformly to an explicit two-branch profile, with a curved high-fidelity branch tangent to a linear coexistence face at x=a. We also identify the soft-activation window and an exact fixed-radius Legendre expansion. The result is classical rate-distortion for an embedded coherent-amplitude source, not quantum rate-distortion or a derivation of Born's rule.
The standard k-query dimension bound for an unknown d-dimensional unitary uses the entire degree-k symmetric tensor space and scales as k^(d^2-1). We refine that bound to the degree-k Hilbert function of the projective oracle variety and compute the resulting support exactly in two physically structured families. For a fixed-angle qubit rotation with unknown axis, the repeated-query span has dimension (k+1)^2 on the generic branch, binomial(k+2,2) on the traceless branch, and one on the central branch. A compact-orbit leverage argument inserts this exact support into the general-tester bound, applying to the parallel, sequential, and mathematically admissible indefinite-order strategies covered by the standard tester model. The associated spherical and planar-axis frames admit closed harmonic spectra, purity formulae, endpoint cascades, and a complete tightness classification. For d-level selective-phase oracles, the projective closure is a Segre variety and the exact support is binomial(k+d-1,d-1)^2, reducing the ambient exponent from d^2-1 to 2d-2. These results quantify geometry-dependent query support rather than physical memory or an achievable discrimination probability in every finite ensemble. The work excludes inverse-oracle access, controlled bypasses, noise, finite-sample estimation, and tester models beyond those explicitly stated.
Let V_lambda be a finite-dimensional irreducible unitary representation of a compact connected semisimple group, and let X be uniform on the phase-lifted orbit of a highest-weight vector. We determine the classical Shannon rate–distortion function under squared ambient loss for arbitrary standard-Borel descriptions and decoders unrestricted to the orbit. Sugita's known integer-moment coherent-state extremum, combined with positive phase–Bessel resummation, yields an all-field fixed-radius Laplace order and exact equality classification. The vector problem reduces to an exact scalar radial envelope. Covariant tilted channels attain exposed points and revealed binary flags attain nonexposed chords. A representation-dimensional criterion forces discontinuous directional-information onset, while Weyl dimensions give a sharp root-system high-fidelity constant. For exterior powers, the source is a phased fermionic Slater determinant: the normalizer is hypergeometric, squared Pluecker overlap is a beta product, and every interior family with n at least 6 has discontinuous first activation. A distinct projective corollary treats intrinsic Pluecker distortion with reproduction restricted to the coherent orbit. The results concern classical phase-sensitive amplitude reconstruction, not quantum rate–distortion, click-only Born statistics, or particle dynamics.
Four balanced Pauli kicks along the vertices of a regular tetrahedron, followed by their reverse echo, generate 24 order-labelled qubit unitary channels. The words share a trace and form two 12-element orbits of the proper tetrahedral group. One query sees only their common trace. At two queries, orbit-dependent quadratic energies yield closed formulas for the Bell-square and globally optimized parallel strategies. At the algebraic point q=1/2, every causally ordered two-query protocol has success at most 9/24 because the fixed trace removes one dimension from the universal quadratic query space. An explicit rational two-comb normalization, a six-Kraus realization, and an exact weighted-frame identity attain the cap, giving P_causal=3/8 and P_parallel=(5+sqrt(15))/24. A uniform Lipschitz estimate proves that the same causal tester remains strictly better on an explicit open pulse interval. The result is an analytic adaptive advantage for a concrete non-group ensemble. It does not address indefinite causal order, noise, finite statistics, or arbitrary qubit ensembles. The central causal certificate is replayed exactly in quotient-ring arithmetic; the supplied word/collision and representation scripts are mixed symbolic-numerical corroborating audits.
Let W = x wedge y be the signed unit Pluecker coordinate of a Haar oriented two-plane in R^n, and let reproduction range over the full posterior-mean body under squared ambient loss. An all-field extremum theorem reduces its unrestricted Shannon rate--distortion function to phi_lambda(b) = K_q(2 lambda b) - lambda b^2, where q = n-2 and K_q = log(q! sum_{j>=0} kappa^(2j)/(q+2j)!). We solve the remaining global phase problem in every dimension. For J_q = L_q L_q' - kappa L_q L_q'' + kappa(L_q')^2, its coefficient of kappa^(2r-1) is a positive factor times r - E[d^2], where d follows a central parity-truncated binomial law. Likelihood-ratio ordering and an exact tail estimate prove one coefficient sign change for every q >= 4. Consequently the stationary curve has exactly one fold, the zero and positive phases have exactly one coexistence contact, and no later exchange or radial reentrance is possible. The RDF is therefore an explicit linear face followed by one covariant parametric branch for every n >= 6; together with the continuous cases n = 3, 4, 5, this completes the all-dimensional phase diagram. The unique contact has an exact large-dimension limit and an explicit logarithmic finite-size displacement. We additionally prove that the same RDF is the minimum worst-source channel capacity, that arbitrary joint classical memory costs exactly N R_n(D) on blocks of length N, and that transitivity makes the tilted information constant, giving a zero-dispersion strong converse. The results concern signed Pluecker-coordinate compression, not quantum rate--distortion or Born-probability prediction.
At distinct boundary frequencies, let a square rational-inner multiport route one fixed input ray to prescribed output rays. We prove that the minimum McMillan degree equals the least degree of a base-point-free projective curve through the ordered target rays, independently of ambient port count. For orthogonal target bands we solve line-to-subspace incidence constraints by full-support Lagrange kernels and derive a closed generic codimension law. Exact memory is the maximum shifted band cost, whereas border memory is the minimum and may be arbitrarily smaller. An intrinsic incidence matrix gives a calibrated singular-value error floor, a determinantal zero-error closure, and an all-data base-point deletion law with an incremental exact certificate. Finally, every zero-error sequence below exact memory has divergent peak dimensionless Wigner-Smith delay; any finite delay cap restores compactness, a positive attained error, and a three-phase operational classification. Explicit planar strata and exact rational certificates audit the results.
Suzuki's localized Weil form is represented by a lower-bounded self-adjoint operator A_a on L2(-a,a); nonnegativity for every a > 0 is equivalent to the Riemann hypothesis, while positivity at one fixed support is an unconditional and strictly weaker problem. We give a source-level interval certificate proving A_0.72 >= 5.890 x 10^-17 I > 0. Nested-core monotonicity gives the same scalar lower bound for every 0 < a <= 0.72. The proof decomposes the exact prime-power translation graph through n = 4 into thirteen intervals and bounds its infinite complement by a mode-sensitive Schur estimate. It isolates degrees 12 through 23 before controlling [24,176) and [176,infinity); both parity Schur matrices have 78 certified positive directions and no unresolved direction at 512-bit Arb precision. We also prove an exact Gauss-Stieltjes hierarchy for the logarithmic boundary potential, complete for strict positivity at every fixed support, and a multiband Loewner majorant requiring only O_epsilon(log log M) bands through degree M. The revised manuscript prints a formula-level source-to-Gram specification. A separately written program importing neither project modules nor python-flint reconstructs the prime-power graph and parity maps and independently reassembles the exported Schur balls with positive Weyl margins in both sectors. This is a bounded-support theorem, not a proof of the Riemann hypothesis.
We solve a finite-dimensional external-spectrum optimization problem for the complex matrix–Bingham law and use it to determine an unrestricted Shannon rate–distortion function. If P is Haar on Gr_C(2,4) and A is traceless Hermitian with fixed Frobenius norm, then E exp[s tr(AP)] is, for every s>0, uniquely maximized, up to unitary conjugacy, by the balanced spectrum (R/2,R/2,-R/2,-R/2). The exceptional model Gr_C(2,4)=Gr_2^+(R^6) turns the orbital integral into a positive series whose coefficients share one simplex-vertex maximizer. For the Haar rank-two state source rho_P=P/2, conditional least squares places arbitrary reports in the full body {sigma: 0<=sigma<=I/2, tr sigma=1}. We obtain its exact classical rate–distortion function for every 0<=D<=1/4. Beyond a scalar dual representation, we prove the complete radial phase diagram: one fold, one positive coexistence contact, no reentrance, and an exact two-piece frontier consisting of one time-sharing segment and one matrix–Bingham branch. The proof reduces the fold derivative to a power series with exactly one negative coefficient followed by strictly positive coefficients. Covariant channels attain the frontier, and the same value is the source-universal worst-state capacity; arbitrary joint n-block memories cost exactly n times the one-letter frontier. The result concerns classical memory for calibrated Born-probability prediction, not quantum rate–distortion, click simulation, or a derivation of Born's rule.
Finite Euclidean correlation matrices are routinely converted into spectral gaps by generalized eigenvalue, Prony, or Lanczos procedures. We determine a finite-sample boundary for what such data can falsify and what they cannot certify by non-rejection. Block Hankel pencils give monotone lower bounds on the visible transfer edge, while exact rank stabilization recovers the complete visible spectrum. An atom of weight w at any x*=exp(-g) changes every moment by at most w while forcing gap at most g; arbitrarily small strictly positive gaps therefore remain hidden even when an extra zero mode is forbidden. For a fixed nonsingular Gaussian experiment we compute the exact hidden-atom likelihood and derive its LAN information, sharp local power envelope, and powerless/local/consistent phase at the w sqrt(n) scale. Under a disclosed visibility floor, a fourth-kind Chebyshev filter solves the weighted localizer minimax exactly; a two-atom measure attains the bound, making the uniform sign threshold necessary and sufficient in the declared polynomial class. This margin feeds an exact-level two-coordinate Wishart test and a closed depth–sample resource law. A distribution-free companion uses paired differences and the exact quadratic range to handle bounded iid readouts with unknown mean and same-sample selection over a finite filter bank. A dependence-robust extension treats one stationary bounded beta-mixing trajectory: sparse pairing, Berbee coupling, and an explicit lag-covariance correction give finite-sample level, power, and total chain-horizon bounds under an externally certified mixing envelope. An interacting ANNNI-chain experiment through 2^16 states demonstrates exact symmetry blindness and multichannel recovery. Rejection falsifies an overstated gap; non-rejection alone is not a positive gap certificate.
We give a single exact state-counting theory for finite passive spectral routing tables. Fix distinct boundary frequencies, one input k-plane, and a word whose symbol a requests a target k-plane Y_a exactly n_a times. If the used targets are in direct-sum position—they need not be orthogonal and may have arbitrarily small principal angles—then the minimum McMillan degree among square finite rational-inner interpolants is k(L - min_a n_a). Thus the rarest target fixes generic passive memory, independently of node spacing and word order. The lower bound uses block-dual detectors: direct-sum geometry supplies a constant compression that is invertible on one target and annihilates every other target. Its determinant has k forced zeros at every wrong node, while a Blaschke–Potapov minor has no more zeros than the network has states. The upper bound is a matrix spectral compiler. Target-weighted node polynomials form a full-rank polynomial column; matrix Fejér–Riesz factorization normalizes it to a rational-inner column of degree at most the lower bound, and a degree-preserving lossless completion closes the network. Beyond the direct-sum locus we prove a detector-rank hierarchy, a maximum weighted hyperplane-occupancy bound for lines, and the complete three-line phase diagram. We also give a span sandwich, open-dense genericity, fail-closed noisy certification, an exact collision discontinuity, and the optimal integrated Wigner–Smith delay. Producer and independent verifiers audit nonorthogonal scalar and block tables, collision openings, and singular-incidence fixtures.
We give a unified exact rate–distortion theory for retaining the complete rank-one Born-probability field of a Haar-random pure state in complex projective space. A constrained root count, a sharp centered power-sum theorem, and Newton's expansion prove an all-degree spectral result: at fixed traceless Frobenius norm the projective Laplace transform is maximized by a one-positive-spike spectrum. This reduces the unrestricted Shannon rate–distortion function to an exact scalar complex-Bingham envelope in every dimension, with covariant channels and independently flagged coexistence mixtures attaining every distortion. For dimension at least three, directional information turns on discontinuously; the qubit curve and the all-dimensional high-fidelity constant are explicit. We then solve the full fixed-normalized-distortion limit. If y_* > 2 solves y_* - 1 = 2 log y_*, the limiting free energy has a unique coexistence point, and the information cost per dimension is a closed two-piece function with a nontrivial linear face. The finite-dimensional onset multiplier equals alpha_* d minus [alpha_*/(2 log y_*)] log d up to an O(1) remainder. Finally, a pointwise Hilbert projection converts every measurable scalar reporter into a physical density-matrix reporter without increasing risk for any pure input. Hence the exact worst-state channel capacity equals the Haar rate–distortion function, arbitrary joint n-state memories cost exactly n times the one-state frontier, and transitivity forces zero rate dispersion with an exponential finite-blocklength strong converse. These results concern reusable calibrated probability fields, not click-only simulation, state update, or intrinsic randomness.
Let P be Haar on the complex Grassmannian Gr(r,d) and set rho_P=P/r. We solve two coupled finite-dimensional problems. First, on the sphere of traceless Hermitian external fields with fixed Frobenius norm, we determine incompatible weak- and strong-field optimizers of the matrix-Bingham free energy log E exp{s tr(AP)}. For 1<r<d/2, an exact cubic Haar moment and a uniform C2 perturbation theorem make the positive one-spike spectrum uniquely optimal at weak field. A parameter-uniform differentiated Grassmann Laplace expansion upgrades the strong-field Ky Fan limit to exact eventual uniqueness of the rank-r two-block spectrum. The globally optimized free energy must therefore fail to be real analytic at a finite field; at its first exit from the one-spike branch there is either nonconjugate coexistence or transverse-Hessian degeneracy. The balanced case r=d/2 is selected by a negative quartic coefficient instead. Second, we determine the unrestricted classical Shannon rate–distortion function for squared-Frobenius reconstruction of rho_P on a nonempty open interval adjacent to zero distortion. Arbitrary standard-Borel classical memories and arbitrary reports reduce by conditional least squares to the full posterior-density body, not merely to the source Grassmannian. Exact eventual two-block optimality and radial localization reduce the complete Shannon dual to one variable. The frontier is attained by a covariant matrix-Bingham channel whose posterior mean is a depolarized rank-r projector. A Jacobi–Selberg calculation gives the exact high-rate constant, and complementation transfers the result to every nontrivial rank. The complete intermediate-phase classification and the full all-distortion rank-r curve remain open.
At L boundary frequencies, a passive lossless network must route one fixed k-dimensional input channel to prescribed output k-planes. For targets with joint span dimension r, every square finite rational-inner interpolant satisfies the sharp universal sandwich r-k <= d_min <= k(L-1). Direct-sum targets therefore have exact minimum McMillan degree k(L-1); when N >= Lk this maximal-memory locus is open and dense. The paper gives an explicit positive Pick completion, a realization- and inertia-based lower bound, a family of targets that collide while retaining maximal exact degree for every nonzero opening, an exact quadratic certification margin, and a fail-closed noisy projector test. For three scalar target lines it also proves the complete phase diagram: degree zero for one common line, degree one exactly for three distinct coplanar lines, and degree two otherwise. Deterministic certificates and an independent implementation accompany the proofs.
A passive lossless network may route the same k-dimensional input channel to different output subspaces at different frequencies. Every two-frequency restriction can be cheap while the joint task is not. For L distinct boundary frequencies and mutually orthogonal prescribed output k-planes, we prove that the minimum McMillan degree among square finite rational-inner transfer matrices regular at the interpolation nodes is exactly k(L-1). Each pair alone requires degree k, so the largest two-node minimum underestimates the global memory by the unbounded factor L-1. The result is independent of node spacing. Necessity follows both from a zero budget for an analytic minor and from a Pick-Stein displacement identity whose negative inertia cannot exceed realization rank. Sufficiency follows from an explicit positive Pick completion. Beyond exact orthogonality, we derive a general cross-frequency inertia certificate, a gauge-independent span bound, an open robust region preserving the integer memory count, and a fail-closed noisy-eigenvalue certificate. Deterministic code tests arbitrary nodes, synthesizes minimal conservative realizations, and independently verifies the stated identities.
Under an explicit noncontextual homogeneous-response ansatz for rank-one quantum effects, we study normalization on every unitary rotation of a fixed finite POVM. The orbit-normalization operator diagonalizes on the projective harmonics of complex projective space. We derive its weighted all-degree singular spectrum and show that the smallest non-Born spectral value is the sharp condition number controlling distance from the affine space of trace-one Hermitian quadratic responses. For dimensions at least three, the high-degree spectrum of a finite seed converges to the sum of squared aggregate ray weights; for an outcome-simple equal-trace seed with N outcomes, the limit is d squared divided by N. Combining this ceiling with the forced geometry of the two smallest tight frames solves the global equal-trace design problem in every dimension d at least five. An orthonormal-basis seed uniquely maximizes the all-degree Born-rigidity gap, with value d minus 6 divided by d plus 1, up to unitary equivalence and outcome relabeling. Every distinct-outcome overcomplete seed in the stated class is strictly worse. By contrast, every weighted complex projective 2-design has a degree-two nullspace and therefore zero rigidity gap. Thus measurements optimal for state tomography can be maximally non-rigid for this covariant normalization objective. The result concerns one-step response fields and does not derive state update, intrinsic randomness, or microscopic particle dynamics.
For a prescribed traceless Hermitian five-level target F, we determine exactly the least product of Hilbert-Schmidt norms of Hermitian A,B satisfying -i[A,B]=F. If g_i=lambda_i-lambda_{i+1} are the ordered spectral gaps, the answer is the maximum of six explicit rational linear forms and their reversals. Exact Littlewood-Richardson enumeration gives 142 Horn inequalities. Twelve sparse dual identities prove the lower facets, and twelve rational singular-spectrum maps attain them; exact cone certificates prove completeness without sampling. In contrast with the two qutrit facets and four four-level facets, dimension five has twelve exposed facets and open chambers that force rank four. For every nonzero target, the least rank of an optimal factor is max(n_+(F),n_-(F)). We also prove the sharp tax 1 <= kappa_5/(||F||_1/2) <= 5/2 with complete equality loci, and the exact balanced triangular perimeter S_2^2=12 sqrt(3) kappa_5. Two rational certificates and an independent deterministic LP campaign accompany the paper.
A passive lossless network pays two different costs when it rotates a signal subspace over a frequency arc: a continuous Wigner—Smith action and an integer McMillan memory. Known Grassmannian length bounds and rational-inner degree identities constrain these resources separately. For the stated finite rational-inner class, we determine their joint attainable region exactly. Let two rank-k subspaces have principal angles βj, put B = Σj βj and let r be the number of nonzero angles. For a square finite rational inner transfer matrix of degree at most d, define the arc action A = ∫I tr Q(θ)dθ, where Q = −iS*∂θS is positive semidefinite. If B > 0, the exact feasible set is d ≥ r and 2B ≤ A ≤ 2πd − 2B. Both faces are attained. Equivalently, dmin(A) = max{r, ⌈(A + 2B)/(2π)⌉}. The upper face is a return cost: the complementary arc must rotate the subspace back, while the full-circle trace action is exactly 2π times the degree. We prove sufficiency by an explicit compiler of normalized rank-one Blaschke—Potapov gates; it realizes every interior point and both faces, including rank-deficient and orthogonal cases. When the endpoint subspaces coincide, the region changes discontinuously to A ∈ [0, 2πd), with the upper endpoint open. We derive fail-closed noisy degree certificates and give a multi-frequency warning using classical boundary Nevanlinna—Pick theory: three pairwise degree-one routing tasks can require degree two jointly. For orthogonal-line data the obstruction is a frame-independent cycle phase, exhibited by an exact positive semidefinite Pick completion with spectrum (2,1,0). Deterministic code compiles random points of the diamond, constructs the degree-two colligation, and is replayed by an independent verifier.
For the spatial Z_2 (Ising-slice) system inside the Dobrushin window 2 tanh|beta| + 2 tanh|gamma| <= alpha < 1, we machine-check in Lean 4 an end-to-end chain from the Gibbs measure to the spectrum of the reconstructed transfer operator. (i) The Osterwalder-Schrader (site-form) reconstruction of the transfer operator is unitarily conjugate, by the explicit sqrt(w) boundary dressing, to the symmetrised Dobrushin kernel. (ii) The unnormalised Gibbs sums themselves are exact matrix elements of that operator's powers: gibbsPathSum(w,beta,N,A,B) = lambda^N , with the partition function the same shape at the dressed constant. These are identities, not bounds, and they hold at every real beta and every positive weight. (iii) There is one mass m > 0 such that for every spatial extent L the projected operator norm is at most e^{-m} and every mixed connected correlator obeys | - | <= ||u|| ||v|| (e^{-m})^n, the zero-time case included. (iv) The connecte two-point function of the normalised Gibbs measure decays at that same rate with a constant independent of the time depth; dividing by the partition function is licensed by a denominator floor uniform in N, which the positive cone supplies and the spectrum does not, since the spectral route controls only the even powers. (v) The N -> infinity limit state exists, is the vacuum state of the reconstructed operator, and does not depend on the strictly positive observable terminating the chain. (vi) The reconstructed operator is a reversible Markov chain -- stochastic and in detailed balance for pi = Omega^2, both proved -- and in that stationary state the connected correlator of bounded observables obeys |E_pi[f P^N g] - E_pi[f] E_pi[g]| <= K_f K_g (e^{-m})^N, with quantifier order "there exists m, for all L": no factor depending on the spatial extent. Summing over time separations gives a susceptibility bound K_f K_g / (1 - e^{-m}), independent of the cut-off and of the extent. The window is non-empty at an interacting point (beta = gamma = 1/10, alpha = 1/2), machine-checked, so none of these conditionals is vacuous. The analytic input is inherited: the mass is the one the Dobrushin corollary already produced, and the window is not widened. What the reconstruction contributes is the identification, the exact identities, and the normalisation in which both the rate and the constant lose their dependence on the volume.
We determine when rapid exact maintenance of a rank-deficient quantum target produces logarithmically divergent free-energy restoration power in algebraic quantum field theory. On every sigma-finite properly infinite factor we construct a bounded quantum Markov semigroup, a nonfaithful normal target and a faithful invariant reference state for which Araki relative entropy reduces exactly to a binary divergence. We derive the semigroup first from localized thermal fermionic probe collisions and then from one autonomous finite-bandwidth Dirac KMS reservoir with fixed smooth coupling. Exact memory equations yield an explicit finite-coupling Davies bound on finite van Hove windows. For a displayed compactly supported massless Dirac form factor, Araki—Wyss regularity, threshold behaviour and Fermi-golden-rule positivity give a completely bounded Davies approximation uniformly for all times with error of order (O(|lambda|)); the sharper (O(lambda^2)) result is isolated under additional reduced-resonance hypotheses. We construct a background-covariant two-Dirac-field completion using Green operators, Møller maps and relative Cauchy scattering, proving naturality, causal factorization and exact spacelike triviality. A locality obstruction shows why a strictly local multiplier cannot coincide exactly with the solvable rank-one reservoir coupling, while a Feshbach reduction quantifies the correction. Finally, we prove that no fixed faithful vacuum or KMS restriction can exhibit the rank-boundary mechanism, but faithful families with a vanishing spectral floor recover its complete coefficient. The results separate algebra type, target faithfulness, microscopic realizability and regulator uniformity, and provide reproducible numerical audits of the finite-dimensional identities and explicit Dirac form factor.
We present a Lean 4 formalization of a thermodynamic-limit construction for the anisotropic nearest-neighbour Ising model on the two-dimensional integer lattice. A telescoping comparison argument and the classical Dobrushin resolvent produce a volume-uniform expectation bound. Exact restriction and reindexing maps between finite Gibbs measures yield convergence of the complete free-boundary sequence, independence of auxiliary envelopes and cofinal samplings, stability under receding boundary perturbations, and equality of free and periodic limits.Finite-support cylinder presentations are quotiented by equality of their represented functions on the full spin space. The resulting local algebra carries a genuine lattice-translation action, and the limiting functional is positive, normalized, real-linear, and invariant under every integer translation. We equip this algebra with its intrinsic uniform norm, construct its complex star-algebra representation, take the corresponding commutative C*-closure, and extend the limiting functional to a positive complex-linear functional of norm one. We also formalize normalized Gibbs conditional kernels for arbitrary finite conditioning sets and prove positivity, exterior locality, idempotence, and the exact finite-volume Gibbs tower identity.All results remain within the classical anisotropic Dobrushin region. The infinite-volume DLR fixed-point equation for the completed state is not claimed.
We study whether a flat lattice-gauge Hodge form supplemented by a penalty depending only on a line-integral block variable can control the full fine one-cochain norm uniformly in the block side. The constant-field sector selects the exponent (d-2)/2 only under exact scale neutrality, but this scaling test does not address the kernel of the block map. We construct transverse, divergence-free, block-periodic Fourier cochains that are annihilated exactly by the block map. Their first-mode Hodge Rayleigh quotient is 4 sin²(pi/L), forcing every admissible full-space Poincaré constant to grow at least quadratically with L. The obstruction applies to every scale-dependent scalar functional factored through the block variable and satisfying only that it vanishes at the coarse zero field; no linearity, continuity, positivity, or growth condition is required. For linear postconditioners, higher Fourier frequencies yield an orthogonal real subspace of dimension 2R and a min—max bound on the 2R-th eigenvalue, establishing a growing low-energy spectral cluster. We also derive an exact repair identity and a necessary witness-channel budget for modified block measurements and additional fine-space terms. The kernel construction, Hodge energy, factorized no-go theorem, repair identity, and necessary repair budget are formalized in Lean 4. The result concerns a finite periodic flat full-domain form and makes no claim about interacting coercivity, gauge quotients, continuum limits, or the Yang—Mills mass gap.
For beta > 0 let I_m = I_m(beta) denote the modified Bessel functionof the first kind and define a_m = I_m^2 ((m-1) I_(m-1)^2 + (m+1) I_(m+1)^2), b_m = m I_m^4,with sine series F_A(t) = sum_(m>=1) a_m sin(mt) andF_B(t) = sum_(m>=1) b_m sin(mt). The associated Wronskian is negativeexactly when F_A/F_B is decreasing. We isolate what can and cannot beproved from two natural inputs: the Neumann convolution kernelI_0(2 beta sin(phi/2)) and the small-coupling anchor whose normalizedlimit is 4 sin^3(t).First, the convolution does prove F_B(t) > 0 for 0 < t < pi. Second,the endpoint is governed by two alternating quantities, c_3 and B_pi,through an exact cubic law. We prove B_pi > 0, derive integralrepresentations, and establish that the cancellation lost by replacingthe alternating quantities with positive-term majorants has exponentialrate 8 - 4 sqrt(2). Finally, we prove a smooth one-parameter perturbationtheorem: one may keep F_B and its kernel unchanged, preserve positivityand strict coefficient-ratio ordering, and preserve every jet at beta = 0,while choosing either sign of the endpoint cubic coefficient.Consequently those structural data, even taken together, do not implyglobal Wronskian negativity. This is a no-go theorem for a proofarchitecture, not a counterexample to the original Bessel conjecture.A short high-precision kill-test accompanies the paper; nocomputer-assisted inequality is used in the proofs.
A formal Lean 4 development revisits a two-dimensional spatial transfer kernel whose earlier uniform spectral argument relied on constant row sums. We show that the loss of row-sum constancy obstructs that method, not the conclusion. With no sorry and no project axiom, we prove twelve machine-checked theorems.The chain establishes the sharp field-uniform one-bond influence envelope tanh J; assembles these bounds into a finite-volume Dobrushin matrix; proves a volume-independent resolvent estimate under row-sum bounds alpha < 1 without assuming constant rows; mechanises Dobrushin's comparison inequality with the attained 1/4 covariance constant; constructs Gibbs measures, heat-bath kernels and intrinsic influence matrices from arbitrary strictly positive finite weights; and specialises to anisotropic Ising interactions. For L x T rectangles with free boundary, the condition 2 tanh|beta| + 2 tanh|gamma| <= alpha < 1 yields exponential decay of correlations with beta, gamma, alpha and the prefactor fixed before the volume quantifiers.The transport into the operator formulation is closed: an exact finite band identity relating endpoint covariances to matrix elements; an abstract theorem showing that a common exponential decay rate for band covariances - a hypothesis on finite path measures, carrying no operator, norm or spectrum - implies a uniform positive gap for a family of projected transfer operators; a Perron-boundary tilt identity that preserves the decay rate while absorbing boundary costs into extent-dependent constants; an exact currying identification of the free strip measure with the rectangle Ising measure; and the resulting corollary: inside the window there is one m > 0 bounding the projected transfer operator of the coupled kernel's normalised Perron data by exp(-m) at every extent, with m = -log alpha.Numerical measurements at L <= 12 provide counterevidence to attributing spectral degeneracy solely to nonzero spatial coupling. No infinite-volume state, thermodynamic limit or boundary-condition independence is constructed; the window is sufficient, not sharp. The underlying Dobrushin mathematics is classical; the contribution is a non-vacuous, reproducible mechanisation and composition of the full chain, ending at a volume-uniform operator gap. No consequence for Yang-Mills theory is claimed.
Let a fine periodic lattice have side LN' and let Q_L be the L^{-d}-normalized block average of length-L line integrals. In four dimensions, the rescaling Q_L -> LQ_L repairs the elementary constant-field scaling obstruction to a Poincare estimate. We prove that it cannot yield coercivity on the full one-cochain space with a constant uniform in the block side.For every L >= 2, every fixed N' >= 1, and N_c >= 2, we embed the first within-block Fourier phase zeta_L = exp(2 pi i/L) in a real two-plane of the internal coordinate space and construct a transverse one-cochain A_L. It satisfies Q_L A_L = 0 and div A_L = 0. For every dimension d >= 2,||A_L||^2 = (LN')^d, = (LN')^d lambda_L,where lambda_L = 4 sin^2(pi/L) <= 4 pi^2/L^2.Thus the Rayleigh quotient of K_0 + (s_L Q_L)^*(s_L Q_L) is exactly lambda_L for every scalar rescaling s_L. Every admissible full-space Poincare constant obeys C_P(L) >= 1/lambda_L >= L^2/(4 pi^2), so no constant chosen before L can work. Here "volume-uniform" means uniform while the block/fine side L varies at an arbitrary fixed positive coarse side N'; it is not a claim about N' -> infinity at fixed L.The construction, kernel identities, exact Hodge energy, Rayleigh identity, and quantified no-go theorem are formalized in Lean 4. The focused axiom audit reports only propext, Classical.choice, and Quot.sound. The theorem concerns the stated flat full-domain form; it does not contradict gauge-restricted propagator constructions and makes no infinite-volume, continuum, or Yang-Mills mass-gap claim.
