An AI-Assisted Solution to the Signed BAR Conjecture: Uniqueness in the Harrison--Reiman Class and a Completely-$\mathcal{S}$ Class Obstruction

• URL: http://arxiv.org/abs/2607.03639v1
• Date: Fri, 03 Jul 2026 23:34:23 GMT
• Title: An AI-Assisted Solution to the Signed BAR Conjecture: Uniqueness in the Harrison--Reiman Class and a Completely-$\mathcal{S}$ Class Obstruction
• Abstract summary: We resolve the finite-signed uniqueness problem for stable Harrison--Reiman data with a nonsingular $M$matrix reflection matrix.<n>The proof uses pathwise differentiability of the reflected diffusion implies feasible directional differentiability of the probabilistic resolvent.<n>We also show that the nonsingular $M$-matrix assumption is structural.
• Score: 3.540245474029962
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For a multidimensional reflected diffusion, determining whether the associated basic adjoint relationship (BAR) uniquely characterizes the stationary distribution is a basic uniqueness problem in the BAR approach. The problem has remained unresolved for more than 35 years since the introduction of the BAR approach. In this paper, we resolve the finite-signed uniqueness problem for stable Harrison--Reiman data with a nonsingular $M$-matrix reflection matrix. The proof uses pathwise differentiability of the reflected diffusion implies feasible directional differentiability of the probabilistic resolvent to show that, at boundary points, its one-sided initial-state derivative factors through the tangent projection and vanishes along active reflection directions. An interior one-sided convolution then yields smooth test functions whose oblique derivatives are uniformly bounded and converge pointwise to zero on each closed face. The interior signed measure is consequently invariant for the reflected semigroup. The proof was discovered with the assistance of ChatGPT 5.5 Pro and subsequently verified by the authors. We also show that the nonsingular $M$-matrix assumption is structural. In the larger completely-$\mathcal{S}$ class, a nonsingular reflection matrix with a singular proper principal block admits boundary gauges supported on lower-dimensional strata. Under standard exponential ergodicity and a mild one-step regulator bound, these gauges produce nonzero zero-mass signed BAR tuples; indeed the zero-mass interior BAR coordinates contain an infinite-dimensional subspace. A four-parameter three-dimensional family, including an explicit rational example, verifies the obstruction. Thus the finite signed version of the Dai--Dieker question has a positive answer in the Harrison--Reiman $M$-matrix class and a negative answer in a natural completely-$\mathcal{S}$ extension.

Related papers

• Fixed-ray escort representations of sandwiched and $α$--$z$ Rényi divergences on von Neumann algebras [0.0]
  We represent sandwiched and $$-$z$ Rényi divergences as averages of ordinary relative entropy.<n>The representation yields a monotone escort profile and a convex order potential.
  arXiv  Detail & Related papers  (2026-08-21T15:24:29Z)
• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Finite-Probe Total-Variation Certificates for Finite-Basis Drifting Models [1.2072720711193232]
  We describe a frozen measurement system for integrable antisymmetric interactions and absolutely continuous laws in a declared finite density basis.<n>For Gaussian-RBF interactions, a global envelope supports distribution-free and empirical-Bernstein radii without truncation.<n>We characterize random-probe observability by a population Gram matrix, identify rank and symmetry degenera, and prove large-bandwidth collapse toward mean matching.
  arXiv  Detail & Related papers  (2026-08-03T00:00:40Z)
• The Quantum Correction to Gaussian Information Geometry is the Killing Form of the Symplectic Algebra [0.0]
  We show that the exact difference between the dual quantum Bures metric and the dual Fisher--Rao metric is independent of the covariance matrix.<n>The signature of this form on the Cartan decomposition reproduces the anisotropic stiffening of the quantum metric at the pure-state boundary.
  arXiv  Detail & Related papers  (2026-07-17T15:35:42Z)
• Near-Optimal Mode Scaling for Finite-Dimensional Boson Sampling via Lie-Algebraic Leakage Bounds [0.8594140167290097]
  Boson sampling on matter-based platforms requires encoding the bosonic modes in finite-dimensional local Hilbert spaces.<n>We develop a unified framework for non-interacting sampling on the irreducible representations of compact Lie groups.<n>We prove, in a Gaussian model of the transition matrix, that its spectral norm concentrates at $tildeO(stn)$ rather than the $O(n)$ worst-case of prior spin-based emulations.
  arXiv  Detail & Related papers  (2026-07-13T15:36:29Z)
• Anisotropic Template Ansätze for Robust Positive Invariance under State-Dependent Uncertainty [1.2234742322758416]
  We map a fixed ellipsoidal template through a GP-derived positive-definite matrix field.<n>The resulting LMI conditions couple the learned field to Schur-stable dynamics.<n> Quadrotor simulations show a $195times$ reduction in 3D velocity-tube volume.
  arXiv  Detail & Related papers  (2026-06-14T23:52:29Z)
• Odds Law: The Decomposition Algebra On How Intelligence Organizes Itself to Solve Difficult Problems Reliably [0.5414847001704247]
  We show that reliability is bought with independent information arranged by composition, and bounded by the verifier.<n>In short, reliability is neither free nor magical: it is bought with independent information, arranged by composition, and bounded by the verifier.
  arXiv  Detail & Related papers  (2026-06-14T09:53:11Z)
• Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression [65.82017723631897]
  We show that scale-invariant upper bounds on self-normalized martingales are possible.<n>We derive a self-normalized concentration inequality free of the usual regularization penalties.
  arXiv  Detail & Related papers  (2026-05-02T22:39:00Z)
• Identifying Intervenable and Interpretable Features via Orthogonality Regularization [48.938969291033665]
  We disentangle the decoder matrix into almost orthogonal features.<n>This reduces interference and superposition between the features, while keeping performance on the target dataset essentially unchanged.<n>Our code is available under $texttthttps://github.com/mrtzmllr/sae-icm$.
  arXiv  Detail & Related papers  (2026-02-04T16:29:14Z)
• An approach to Fisher-Rao metric for infinite dimensional non-parametric information geometry [0.6138671548064355]
  Being infinite dimensional, non-parametric information geometry has long faced an "intractability barrier"<n>This paper introduces a novel framework to resolve the intractability with an Orthogonal Decomposition of the Tangent Space.<n>By defining the Information Capture Ratio, we provide a rigorous method for estimating intrinsic dimensionality in high-dimensional data.
  arXiv  Detail & Related papers  (2025-12-25T00:18:41Z)
• Fault-tolerant mixed boundary punctures on the toric code [2.3966396835567925]
  Defects on the toric code, a well-known exactly solvable Abelian anyon model, can exhibit non-Abelian statistical properties.<n>We introduce a mixed boundary puncture model that integrates the advantages of both punctures and twists.
  arXiv  Detail & Related papers  (2025-08-15T05:35:03Z)
• Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias [55.72269695392027]
  This paper focuses on applying entropic mirror descent to solve linear systems.<n>The main challenge for the convergence analysis stems from the unboundedness of the domain.<n>To overcome this without imposing restrictive assumptions, we introduce a variant of Polyak-type stepsizes.
  arXiv  Detail & Related papers  (2025-05-05T12:33:18Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Hypothesis testing on invariant subspaces of non-diagonalizable matrices with applications to network statistics [0.0]
  Wald tests for invariant vectors and $t$-tests for their individual coefficients perform well in simulations.<n>We find that statisticians only need control over the first-order Davis-Kahan bound to control convergence rates of invariant subspace estimators to higher-orders.
  arXiv  Detail & Related papers  (2023-03-31T17:48:20Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Feature Cross Search via Submodular Optimization [58.15569071608769]
  We study feature cross search as a fundamental primitive in feature engineering. We show that there exists a simple greedy $(1-1/e)$-approximation algorithm for this problem.
  arXiv  Detail & Related papers  (2021-07-05T16:58:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.