Quantum Algebra · Cross-listed from gr-qc
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 7 April
We provide a relatively self-contained introduction to the application of quantum spacetime and quantum Riemannian geometry to theoretical physics. Recent successes include calculation of the vacuum energy of spacetime curvature fluctuations in a single-plaquette model of quantum gravity, derivation of the Kaluza-Klein ansatz as a consequence of quantum spacetime, exactly conserved Noether charges from variational calculus on a lattice, and a new theory of classical and quantum geodesics. The latter leads to a theory of generally covariant quantum mechanics applicable in General Relativity with intriguing first results for the case of a black-hole. We discuss several open problems past and present, and how they might be addressed going forward. New results include a phase transition for Euclidean quantum gravity on a 4-pointed star.
Dynamical Systems
On Coexistence of Conservative Replicator Dynamics with Four Strategies
In this paper, we study four-strategy conservative replicator dynamics induced by constant payoff matrices. We establish necessary and sufficient conditions for coexistence to occur by associating the payoff matrix with its digraph, revealing exactly five distinct digraph classes governing the global behavior. We further show that, whenever the dynamics is coexistent, every non-equilibrium trajectory in the relative interior of the simplex is a Lyapunov-stable periodic orbit. Together with the classification of the boundary phase portraits, these results provide a complete characterization of the global dynamics in the four-strategy case with coexistence.
Read the full abstract
Numerical Analysis
A Neural-Enhanced Weak Galerkin Method for Second-Order Elliptic Problems with Low-Regularity Solutions
We propose a neural-enhanced weak Galerkin (WG) finite element method for second-order elliptic problems with low-regularity solutions. The method augments the classical WG approximation space with neural network functions constructed via a residual-driven Galerkin enrichment procedure. This approach preserves the variational structure, symmetry, and stability of the WG formulation while enhancing its ability to approximate non-smooth and singular solution components. We establish a quasi-optimal error estimate in a discrete WG energy norm, incorporating both projection and consistency errors. In particular, the method retains optimal convergence rates for smooth solutions. For problems admitting a regular–singular decomposition, we further show that the neural enrichment effectively captures the singular component, yielding improved accuracy over standard WG methods.
Read the full abstract
History and Overview of Mathematics · Cross-listed from cs.AI
Artificial Intelligence and the Structure of Mathematics
Recent progress in artificial intelligence (AI) is unlocking transformative capabilities for mathematics. There is great hope that AI will help solve major open problems and autonomously discover new mathematical concepts. In this essay, we further consider how AI may open a grand perspective on mathematics by forging a new route, complementary to mathematical logic, to understanding the global structure of formal proofs. We begin by providing a sketch of the formal structure of mathematics in terms of universal proof and structural hypergraphs and discuss questions this raises about the foundational structure of mathematics. We then outline the main ingredients and provide a set of criteria to be satisfied for AI models capable of automated mathematical discovery. As we send AI agents to traverse Platonic mathematical worlds, we expect they will teach us about the nature of mathematics: both as a whole, and the small ribbons conducive to human understanding. Perhaps they will shed light on the old question: "Is mathematics discovered or invented?" Can we grok the terrain of these Platonic worlds?
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Coalitional Zero-Sum Games for ${H_{\infty}}$ Leader-Following Consensus Control
This paper investigates the leader-following consensus problem for a class of multi-agent systems subject to adversarial attack-like external inputs. To address this, we formulate the robust leader-following control problem as a global coalitional min-max zero-sum game using differential game theory. Specifically, the agents' control inputs form a coalition to minimize a global cost function, while the attacks form an opposing coalition to maximize it. Notably, when these external adversarial attacks manifest as disturbances, the designed game-theoretic control policy systematically yields a robust $H_\infty$ control law. Addressing this problem inherently requires solving a high-dimensional generalized algebraic Riccati equation (GARE), which poses significant challenges for distributed computation and controller implementation. To overcome these challenges, we propose a two-fold approach. First, a decentralized computational strategy is devised to decompose the high-dimensional GARE into multiple uniform, lower-dimensional GAREs. Second, a dynamic average consensus-based decoupling algorithm is developed to resolve the inherent coupling structure of the robust control law, thereby facilitating its distributed implementation. Finally, numerical simulations on the formation control of multi-vehicle systems with feedback-linearized dynamics are conducted to validate the effectiveness of the proposed algorithms.
Read the full abstract
Representation Theory
Relative Serre duality for Coxeter groups
It was conjectured by Gorsky, Hogancamp, Mellit, and Nakagane that the left and right adjoints of the parabolic induction functor between homotopy categories of Soergel bimodules associated to a finite Coxeter group are related by the relative full twist. Several cases of this conjecture are known including for symmetric groups, crystallographic Coxeter groups, and dihedral groups. We prove this conjecture in complete generality using the theory of Abe-Bott-Samelson bimodules and the Achar-Riche-Vay mixed derived category.
Read the full abstract
Dynamical Systems · Cross-listed from cs.LG
A machine learning framework for uncovering stochastic nonlinear dynamics from noisy data
Modeling real-world systems requires accounting for noise - whether it arises from unpredictable fluctuations in financial markets, irregular rhythms in biological systems, or environmental variability in ecosystems. While the behavior of such systems can often be described by stochastic differential equations, a central challenge is understanding how noise influences the inference of system parameters and dynamics from data. Traditional symbolic regression methods can uncover governing equations but typically ignore uncertainty. Conversely, Gaussian processes provide principled uncertainty quantification but offer little insight into the underlying dynamics. In this work, we bridge this gap with a hybrid symbolic regression-probabilistic machine learning framework that recovers the symbolic form of the governing equations while simultaneously inferring uncertainty in the system parameters. The framework combines deep symbolic regression with Gaussian process-based maximum likelihood estimation to separately model the deterministic dynamics and the noise structure, without requiring prior assumptions about their functional forms. We verify the approach on numerical benchmarks, including harmonic, Duffing, and van der Pol oscillators, and validate it on an experimental system of coupled biological oscillators exhibiting synchronization, where the algorithm successfully identifies both the symbolic and stochastic components. The framework is data-efficient, requiring as few as 100-1000 data points, and robust to noise - demonstrating its broad potential in domains where uncertainty is intrinsic and both the structure and variability of dynamical systems must be understood.
Read the full abstract
Optimization and Control
A proximal approach to the Schrödinger bridge problem with incomplete information and application to contamination tracking in water networks
In this work, we study a discrete Schrödinger bridge problem with partial marginal observations. A main difficulty compared to the classical Schrödinger bridge formulation is that our problem is not strictly convex and standard Sinkhorn-type methods cannot be directly applied. To address this issue, we propose a scalable computational method based on an entropic proximal scheme. Furthermore, we develop a framework for this problem that includes duality results, characterization of the optimal solutions, and an observability condition that determines when the optimal solution is unique. We validate the method on the problem of estimating contamination in a water distribution network, where the partial marginals correspond to measured pollutant concentrations at the sensor locations. The experiments were conducted on a laboratory-scale water distribution network.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Simulating Thermal Properties of Bose-Hubbard Models on a Quantum Computer
While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce the first general rigorous Gibbs sampling framework for bosonic many-body systems, showing that physically relevant bosonic models admit gapped dissipative generators, enabling efficient preparation of thermal states, provided that the spectral gap scales favourably with the number of modes. Although our results hold for broad classes of models, we illustrate them using Bose-Hubbard Hamiltonians, both within and beyond the mean-field regime. In both cases, we show that the associated dissipative generators maintain a positive spectral gap, thereby implying exponential convergence to the thermal state. For the Gibbs sampler corresponding to the full Bose-Hubbard model, we obtain a spectral-gap lower bound $Ce^{-cn}$, where $n$ is the number of modes. We apply our results to provide a Gibbs-state preparation algorithm on qubit hardware, with runtime polynomial in the number of modes and the inverse spectral gap, and thereby obtain a quantum algorithm to compute thermal properties of the model. This provides the first mathematically controlled route to Gibbs sampling in infinite-dimensional systems, with implications for quantum simulation, thermalization, and many-body complexity, where quantum advantages may arise.
Read the full abstract
Quantum Algebra
A multigraph approach to confusability in quantum channels
We introduce a new approach to confusability in a quantum channel, namely quantum confusability multigraph, which incorporates the output information into the graphical structure. By“counting" the edges between two vertices of this confusability multigraph, one recovers the traditional confusability “single-edged" graph of the channel. With this physical motivation, we therefore develop a theory of quantum multigraphs from Weaver's quantum relations point of view and explore its quantum graph theoretic properties. Finally, we provide a necessary and sufficient condition characterizing those quantum multigraphs that arise as quantum confusability multigraphs.
Read the full abstract
Statistics Theory
Lipschitz regularity in Flow Matching and Diffusion Models: sharp sampling rates and functional inequalities
Under general assumptions on the target distribution $p^\star$, we establish a sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores, with optimal dependence on time and dimension. As applications, we obtain Wasserstein discretization bounds for Euler-type samplers in dimension $d$: with $N$ discretization steps, the error achieves the optimal rate $\sqrt{d}/N$ up to logarithmic factors. Moreover, the constants do not deteriorate exponentially with the spatial extent of $p^\star$. We also show that the one-sided Lipschitz control yields a globally Lipschitz transport map from the standard Gaussian to $p^\star$, which implies Poincaré and log-Sobolev inequalities for a broad class of probability measures.
Read the full abstract
Differential Geometry
The moduli space of conically singular instantons over an SU(3)-manifold
In this article we study the moduli space of conically singular instantons (or Hermitian Yang–Mills connections) with prescribed tangent connections over a 6-manifold equipped with an $\mathrm{SU}(3)$-structure. That is, we develop a Fredholm deformation theory for such $\mathrm{SU}(3)$-instantons in which we fix the tangent connection but allow the underlying principal bundle (and, in particular, the singular set) to vary. This leads to the existence of a Kuranishi structure for this moduli space. Moreover, we investigate the cokernel of the instanton deformation operator and give under certain assumptions a formula for its dimension. Ultimately, we apply our results to conically singular instantons with structure group $\mathbb{P}\mathrm{U}(n)$ and give a formula for the virtual dimension of their moduli space in terms of sheaf cohomology of certain vector bundles over $\mathbb{P}^2$.
Read the full abstract
Information Theory
Singular Relative Entropy Coding with Bits-Back Rejection Sampling
A relative entropy code for a source $X \sim P_X$ is a stochastic code that encodes random samples from a prescribed $P_{Y \mid X}$ using as few bits as possible. A generalisation of entropy coding, it is a standard result that the minimum number of bits required to achieve this is at least the mutual information $I[X\,\Vert\,Y]$. However, a particularly fascinating feature of relative entropy coding compared to entropy coding is that, in general, this lower bound is only achievable to within an additional logarithmic factor. As such, an important research direction is to identify channels where we can reduce this gap. Sriramu and Wagner achieved such success by exhibiting a relative entropy code for so-called singular channels with sub-logarithmic asymptotic redundancy. However, their code is quite involved and, sadly, cannot be implemented in practice. In this paper, we construct the bits-back rejection sampler (BBRS), a relative entropy code that combines ideas from bits-back coding and (greedy) rejection sampling. Our analysis of BBRS reveals that the algorithm achieves the same asymptotic efficiency as Sriramu and Wagner's sampler, but with much simpler analysis and better constants. Moreover, BBRS can be implemented using standard relative entropy coding methods.
Read the full abstract
Number Theory
Theta Cycles of Modular Forms Modulo $p^2$
The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k < p$ modular form modulo $p^2$ on the initial segment of length $p$ and we prove exact values or nontrivial bounds for the weight filtrations on $p-2$ further segments of length $p - k + 1$. In particular, asymptotically as $p \to \infty$ we establish 50% of the theta cycle exactly, and we provide nontrivial bounds for 100% of it. We determine the first two low points exactly and $\left\lfloor \frac{p - k + 1}{2} \right\rfloor$ further low points at regular positions. Moreover, we detect low points at exceptional positions which solve a quadratic equation modulo $p$, and which disturb the otherwise regular structure in the segments that we exhibit.
Read the full abstract
Optimization and Control
The Separation Principle and the Dual-Certainty Equivalence Gap in Model Predictive Control
Dual control addresses the trade-off between exploitation and exploration, where control inputs both regulate the system and generate informative data for estimation and identification. For certain problem classes, control and estimation can be designed independently without loss of optimality, a property known as the separation principle. However, in stochastic control problems with model uncertainty and constraints, this principle generally breaks down, and introduces the need for dual control. In this paper, we propose an information-weighted dual model predictive control (MPC) formulation and introduce metrics that quantify the dependence of the MPC policy on the uncertainty. We focus on parametric uncertainty in linear systems with Gaussian noise, though the metrics can be applied more broadly. Numerical results show that the dependence of the MPC policy on the posterior covariance is largest under high uncertainty and vanishes as the posterior covariance contracts, providing empirical evidence of the dual effect in closed loop. Moreover, the dual controller improves regulation performance and model accuracy compared to certainty-equivalent MPC.
Read the full abstract
Combinatorics
Further results on the lower bound on reduced Zagreb index of trees
For a graph $G$, the general reduced second Zagreb index is defined as $$GRM_\lambda (G) = \sum_{uv \in E} (deg(u) + \lambda) (deg(v) + \lambda),$$ where $\lambda$ is an arbitrary real number and $deg (v)$ is the degree of the vertex $v$. In this paper, we extend and correct the equality results from [N. Dehgardia, S. Klav\v zar, Improved lower bounds on the general reduced second Zagreb index of trees, preprint (2023)] regarding the minimal value of $GRM_\lambda$ for $\lambda \geq -1$ among trees with $n$ vertices and a maximal degree $\Delta$. Furthermore, we complement these results with two distinct approaches to determine the minimum value of the general reduced second Zagreb index for molecular trees with $\Delta = 3$ and $\Delta = 4$ in $\lambda = -2$, and characterize the extremal trees.
Read the full abstract
Information Theory
Covering-radius and Collinearity- Minimizing Pilots for Channel Estimation in TDD Systems
This letter studies pilot design for orthogonal frequency-division multiplexing-based time-division duplex (TDD) systems under a sliding-window latest-slot recovery framework that jointly exploits delay-Doppler sparsity across recent slots. Under contiguous-subband and fairness constraints, this viewpoint naturally leads to a geometry-aware time-frequency joint pilot assignment. We show that effective patterns should balance grid coverage and redundant-collinearity suppression, with an additional symmetry-avoidance refinement when complete collinearity elimination is infeasible. Based on these principles, we formulate a mixed-integer construction method compatible with practical TDD allocation. Numerical results show that minimum-coverage-radius and collinearity-control (MCC) pattern improves both surrogate geometry metrics and latest-slot recovery performance.
Read the full abstract
Optimization and Control
Value Mirror Descent for Reinforcement Learning
Value iteration-type methods have been extensively studied for computing a nearly optimal value function in reinforcement learning (RL). Under a generative sampling model, these methods can achieve sharper sample complexity than policy optimization approaches, particularly in their dependence on the discount factor. In practice, they are often employed for offline training. In this paper, we consider discounted Markov decision processes with state space S, action space A, discount factor $\gamma\in(0,1)$ and costs in $[0,1]$. We introduce a novel value optimization method, termed value mirror descent (VMD), which integrates mirror descent from convex optimization into the classical value iteration framework. In the deterministic setting with known transition kernels, we show that VMD converges linearly. For the stochastic setting with a generative model, we develop a stochastic variant, SVMD, which incorporates variance reduction commonly used in stochastic value iteration-type methods. For RL problems with general convex regularizers, SVMD attains a near-optimal sample complexity of $\tilde{O}(|S||A|(1-\gamma)^{-3}\epsilon^{-2})$. Moreover, we establish that the Bregman divergence between the generated and optimal policies remains bounded throughout the iterations, even under the presence of model misspecification. This property is absent in existing stochastic value iteration-type methods but is important for enabling effective online (continual) learning following offline training. Under a strongly convex regularizer, SVMD achieves sample complexity of $\tilde{O}(|S||A|(1-\gamma)^{-5}\epsilon^{-1})$, improving performance in the high-accuracy regime. Furthermore, we prove convergence of the generated policy to the optimal policy. Overall, the proposed method, its analysis, and the resulting guarantees, constitute new contributions to the RL and optimization literature.
Read the full abstract
Combinatorics
On maximal ladders
Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$ and asked whether this bound is sharp, i.e., whether for each $n$ there is an $n$-ladder of cardinality $\aleph_{n-1}$. We isolate the notion of maximal $n$-ladder and use it to study Ditor's problem and related questions. We show that $\text{Add}(\omega, \omega_\omega)$ forces every maximal $n$-ladder to have cardinality $\aleph_{n-1}$, and hence forces a positive answer to Ditor's question for every $n$. In particular, it is consistent that there are no maximal $3$-ladders of cardinality $\aleph_1$. However, we show that the existence of such a ladder follows from $\mathfrak{d}=\aleph_1$. Under $\clubsuit$, we construct a maximal $3$-ladder of breadth $2$. Finally, we prove that, consistently (under $\diamondsuit$), there exists a maximal $3$-ladder that is destructible by forcing with a Suslin tree.
Read the full abstract
Analysis of PDEs
C^{1,\alpha} regularity for a class of singular/degenerate fully nonlinear elliptic equations with oblique boundary conditions
In this paper, we establish global $C^{1, \alpha}$ regularity for viscosity solutions to a class of singular and degenerate fully nonlinear elliptic equations subject to oblique boundary conditions. Our work extends the findings in \cite{BKO25} to a broader class of equations, notably encompassing the singular case.
Read the full abstract
Analysis of PDEs
Gauge Symmetry Breaking in the Asymptotic Analysis of Self Dual Yang-Mills-Higgs $SU(2)$ Monopoles
We consider the $SU(2)$ Self-Dual Yang Mills Higgs Lagrangian in 3 dimension. By adding a ”Gauge Mass” term to this YMH Lagrangian in the form of $L^2$ norm of the connection we break the gauge invariance and critical points are automatically fulfilling globally the Coulomb condition. We study the so called “large mass asymptotic”, which has the effect of ”squeezing” the monopoles. For any unit Higgs field data at the boundary we prove that minimizers of this Coulomb-Yang-Mills-Higgs Functional converge to harmonic maps into ${\mathbb S}^2$ extending this data. This asymptotic moreover is subject to concentration conpactness phenomena and the convergence is strong away from a 1 dimensional rectifiable closed concentration set. Then we prove that, having chosen a large enough coupling constant, the limiting minimal energy is converging towards the minimal Brezis-Coron-Lieb relaxed harmonic map energy for this boundary data. In the second part of the paper we examine a different asymptotic regime characterised by overloading monopoles. In this regime we prove that asymptotically, the magnetic field becomes exclusively longitudinal with a $U(1)$ abelian component along the Higgs Field while the Higgs field itself converges to a smooth absolute minimizer of a relaxation of the Faddeev-Skyrme functional of maps from ${\mathbb B}^3$ into ${\mathbb S}^2$. In the third part of the paper we study the behaviour of these configurations when the parameter in front of the Fadeev-Skyrme component respectively goes to zero and $+\infty$. In the first case one recovers the Brezis Coron Lieb relaxed energy at the limit while in the second case the minimal limiting energy is converging towards the minimal Dirichlet energy of maps into ${\mathbb S}^3$ whose projection by the Hopf fibration is equal to the fixed boundary data.
Read the full abstract
Algebraic Geometry
Rationality and symmetry of stable pairs generating series of Fano 3-folds
The generating series of descendent invariants of stable pairs on 3-folds is conjectured to be rational and to satisfy a $q\leftrightarrow q^{-1}$ symmetry. We prove this conjecture for Fano 3-folds. We utilize the same path of stability conditions that Toda used in his proof of the Calabi–Yau version of the conjecture, relating stable pairs and $L$ invariants, and work of the two authors that allows an extension of Joyce's descendent wall-crossing formula to non-standard hearts of $D^b(X)$. We use Ehrhart theory to deal with the combinatorics coming out of the wall-crossing formula. Furthermore, we specialize the wall-crossing formula to primary insertions and prove a strong rationality result predicted by the Pandharipande–Thomas/Gopakumar–Vafa correspondence.
Read the full abstract
Combinatorics
A general switching method for constructing E-cospectral hypergraphs
Spectral hypergraph theory studies the structural properties of a hypergraph that can be inferred from the eigenvalues and the eigenvectors of either matrices or tensors associated with it. In this paper we study the spectral indistinguishability in the hypergraph setting. We present a general switching method to construct uniform $E$-cospectral hypergraphs (hypergraphs with the same $E$-spectrum), and discuss some of its multiple applications. Our method not only provides a framework to unify the existing methods for obtaining $E$-cospectral hypergraphs via switching, but also generalizes most of the existing switching tools, yielding multiple new constructions. Finally, we compare common methods of computing $E$-characteristic polynomials, and in particular show that one standard method, while useful for generic tensors, is uninformative for almost all hypergraphs.
Read the full abstract
Probability
Large fringe trees for random trees with given vertex degrees
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case where the target tree grows with the size of the random tree. We consider three primary subtree counts: the number of fringe trees isomorphic to a specific growing tree, the number of fringe trees sharing a given growing degree statistic, and the number of fringe trees of a specific growing size. To establish our results, we employ and compare four distinct probabilistic frameworks: the method of moments with the Gao-Wormald theorem, Stein's method with coupling (to provide explicit error bounds in total variation distance), the Cai-Devroye method, and Stein's method with exchangeable pairs. Our findings provide conditions for Poisson and normal convergence for these subtree counts. Additionally, we provide a local limit theorem for sums of values obtained via sampling without replacement that may be of independent interest. Finally, our results and methods are also applied to conditioned critical Galton-Watson trees.
Read the full abstract
Mathematical Physics
Analyticity, asymptotics and natural boundary for a one-point function of the finite-volume critical Ising chain
This note reports the following observation: the finite-volume expectation value of the spin operator (the one-point function) between the $\mathbb{Z}_2$-even and odd ground states in the critical periodic Ising chain, when continued as a complex-analytic function of the system length $N$ through the Borel resummation of its large-$N$ expansion, has a natural boundary of analyticity along the negative real axis. The singular behavior near the negative real axis, after an exponential map, is the same as that of a Lambert-type series for the odd-divisor-squared sum near the unit circle $|z|=1$. The same divisor sum also governs the strengths of the Borel discontinuities of the one-point function's factorially-divergent large-$N$ asymptotics. We also report the all-order large-$N$ asymptotics of the leg function for the finite-volume spin-operator form factor, and the similarities to certain known quantities in the literature.
Read the full abstract
Algebraic Geometry
Existence of holomorphic Lie algebroid connections in higher dimensions
Let $(V, \phi)$ be a holomorphic Lie algebroid over an irreducible smooth complex projective variety $X$ of dimension at least three, and let $E$ be a holomorphic vector bundle on $X$. We establish a necessary and sufficient condition for the existence of a holomorphic $(V, \phi)$–connection on $E$.
Read the full abstract
Probability
Branching Process in a Varying Environment: How to Grow Like the Product of Means
Consider a branching process $\{Z_n\}$ in a varying environment. Let $\{W_n\}$ be the natural martingale $Z_n/{\bf E}Z_n$. It converges to some random variable $W$ as $n\to\infty$. An important problem is to show that ${\bf P}(W>0)$ equals the survival probability, so that $Z_n$ is either $0$ or of the order ${\bf E}Z_n$. We find a new kind of sufficient conditions, applicable to branching processes in a random environment. An important property of our estimates is that we don't necessary assume that ${\bf E}X_{i,1}^2$ are finite for every $i$.
Read the full abstract
Analysis of PDEs
Formalization of De Giorgi–Nash–Moser Theory in Lean
We present a formalization in Lean of the core interior De Giorgi–Nash–Moser theory for uniformly elliptic divergence-form equations with bounded measurable coefficients. The formalized results include local boundedness of weak subsolutions, the weak Harnack inequality for positive weak supersolutions, Moser's Harnack inequality for positive weak solutions, and interior Hölder regularity. This is, to our knowledge, the first machine-checked formalization of a major theorem in modern PDE theory. The development also required substantial new infrastructure for Sobolev spaces on bounded domains, weak solutions of elliptic equations, and quantitative regularity estimates. More broadly, it suggests that large-scale autoformalization of hard analysis in Lean is now within reach.
Read the full abstract
Differential Geometry
Uniform weak RC-positivity and rational connectedness
In this paper, we show that if the holomorphic tangent bundle $TX$ of a compact Kähler manifold $X$ is uniformly weakly RC-positive, then $X$ is projective and rationally connected. This result is previously established by Xiaokui Yang under the stronger assumption that $TX$ is uniformly RC-positive. The result we obtain is, in fact, more general. If a holomorphic vector bundle $E$ is uniformly weakly RC-positive, then $E$ admits a Hermitian metric whose mean curvature is positive. A quasi-positive version is also proved in this paper.
Read the full abstract
Optimization and Control
Adaptive Incentive Design with Regret Minimization
Incentive design constitutes a foundational paradigm for influencing the behavior of strategic agents, wherein a system planner (principal) publicly commits to an incentive mechanism designed to align individual objectives with collective social welfare. This paper introduces the Regret-Minimizing Adaptive Incentive Design (RAID) problem, which aims to synthesize incentive laws under information asymmetry and achieve asymptotically minimal regret compared to an oracle with full information. To this end, we develop the RAID algorithm, which employs a switching policy alternating between probing (exploration) and estimate-based incentivization (exploitation). The associated type estimator relies only on a weaker excitation condition required for strong consistency in least squares estimation, substantially relaxing the persistence-of-excitation assumptions previously used in adaptive incentive design. In addition, we establish the strong consistency of the proposed type estimator and prove that the incentive obtained asymptotically minimizes the planner's average regret almost surely. Numerical experiments illustrate the convergence rate of the proposed methodology.