Main Theorem
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Cubic graphs, $S$-minors and conformal minors
arXiv:2606.04173v1 Announce Type: cross Abstract: It is well-known that any class of simple graphs, that is characterized by finitely many forbidden minors, also admits a characterization by finitely many forbidden topological minors; furthermore, the list of forbidden topological minors may be derived from the list of forbidden minors. We prove a similar result in Matching Theory. Our Main Theorem states that any class of matching covered graphs, that is characterized by finitely many...
Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement
Announce Type: new Abstract: We introduce Goedel-Architect, an agentic framework for formal theorem proving in Lean 4 centered on blueprint generation and refinement. A blueprint is a dependency graph of definitions and lemmas that builds up to the main theorem. First, Goedel-Architect generates a blueprint of formally stated definitions and lemmas, along with declared dependencies.
Practical Aspects on Solving Differential Equations Using Deep Learning: A Primer
arXiv:2408.11266v5 Announce Type: replace Abstract: Deep learning is now common across many scientific fields, including the study of partial differential equations. This article provides a brief, accessible introduction to core deep learning concepts, including neural networks, backpropagation, and the universal approximation theorem. It mainly covers how to use deep learning in solving differential equations.
TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics
arXiv:2606.09450v1 Announce Type: new Abstract: LLMs have recently achieved strong results on formal proving benchmarks. However, existing evaluations remain heavily concentrated on competition-style problems and often fail to capture how models behave on longer, more dependency-rich mathematical developments. We introduce TheoremBench, a Lean4 benchmark designed to evaluate theorem provers beyond contest settings.
Structural properties of the implicit function defined by an integral self-consistency equation
arXiv:2606.04243v1 Announce Type: new Abstract: We study the integral equation $\int_0^m \eta\rho(\eta)/(C-\eta)\,d\eta = 1$ with $C>m$, where $\rho$ is a $C^1$ probability density on $[0,M]$ vanishing polynomially at $\eta=M$. Setting $\mathcal{I}^+(m) := \lim_{C \downarrow m}\int_0^m \eta\rho(\eta)/(C-\eta)\,d\eta$ and $\Omega := \{m \in (0,M) : \mathcal{I}^+(m) > 1\}$, the equation determines $C$ implicitly as a function of $m$ on $\Omega$, and our object of study is the dimensionless...
Conditional Random Ordered Transport Spaces
arXiv:2606.08113v1 Announce Type: new Abstract: A small Wasserstein distance does not certify that a transformation is admissible. In evidence-constrained, semantic, causal, physical, monotone, or risk-sensitive learning, one must ask not only how far two probability laws are, but whether mass has moved in a direction allowed by available information. We introduce conditional random ordered transport spaces (CROTS), a class of \(L^0\)-valued spaces of random probability measures equipped...
Boundary-compatible interacting approximations of quasilinear PDEs on bounded domains
arXiv:2606.04049v1 Announce Type: new Abstract: We develop a general operator-theoretic route that turns Kato-type quasilinear evolution systems on a Banach scale $(Z,X)$ into finite-dimensional interacting approximations. The construction proceeds in two steps. First, one introduces a regularized family $(A_\varepsilon,f_\varepsilon)$ indexed by a scale parameter $\varepsilon>0$, for which the drift $A_\varepsilon[t,z]z+f_\varepsilon[t,z]$ takes values in an output space $Y$ suitable for...
Capability and Robustness Cannot Both Be Free: An Information-Theoretic Bound for Vision-Language-Action Models
arXiv:2605.25889v4 Announce Type: replace Abstract: Vision-Language-Action (VLA) models reach high success rates on clean inputs but collapse under small adversarial perturbations: a $16/255$ PGD attack drops OpenVLA-7B's LIBERO success from $95\%$ to under $5\%$. Whether this trade-off has a theoretical floor was open. We prove that it does. For any VLA policy, capability $I(\Astar;\Api)$ and robustness $I(\Api;\Atildepi)-I(\Api;\delta)$ sum to at most $H(\Astar)+I(X;\Xtilde)$, the task...
The Preisach Extremum Stack is a Shannon-Minimal Sufficient Statistic for Rate-Independent Functionals
Announce Type: new Abstract: Let R denote the class of all computable, causal functionals that are rate-independent in the classical sense (invariant under monotone time reparametrizations), and let Pi_n be the Preisach extremum stack of an input sequence u_{0:n}. We prove a characterization theorem establishing that every F in R satisfies Fu = f(Pi_n) for a computable f, and derive two information-theoretic results. First, under any probability measure on u_{0:n}, the equality I(u_{0:n};...
Lean 4 Machine-Verified Proof of P = NP via the Pedigree Polytope Membership Problem
arXiv:2606.03194v1 Announce Type: new Abstract: The Membership Problem for Pedigree Polytope (M3P) asks, given $X\in\mathbb{Q}^{\binom{n}{3}}$, whether $X\in\mathrm{conv}(P_n)$, where $P_n$ is the set of all pedigrees. A pedigree is a structured encoding of a Hamiltonian cycle construction in $K_n$. We establish that M3P is solvable in strongly polynomial time via a recursively constructed layered network $(N_k, R_k, \mu)$ and a multicommodity flow problem MCF$(k)$. The necessary and...