Several proofs of Fáry--Milnor theorem are presented.
problem Fáry--Milnor theorem
method Sketches several proofs
result Proofs of Fáry--Milnor theorem
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “proof”
The Kropholler Conjecturemath.GR
Corrects a flawed proof of the Kropholler Conjecture.
problem Kropholler Conjecture in relative group theory.
method Explains the flaws and proposes possible ways to correct the proof.
result Provides a clearer understanding of the conjecture's proof difficulties.
Simplified proof of gluing formula for analytic torsion forms.
problem Proving the gluing formula for analytic torsion forms.
method Extending prior work to the family case, presenting a new proof.
result Simplified proof of the gluing formula.
A simplified proof of the Alexander-Conway polynomial exists.
problem Existence of the Alexander-Conway polynomial for links in 3D space.
method Presented an accurate detailed exposition of the proof.
result Existence of the Alexander-Conway polynomial proved.
We give a direct proof that the Freed-Lott differential analytic index is well defined and a condensed proof of the differential Grothendieck-Riemann-Roch theorem. As a byproduct we also obtain a direct proof that the R/Z analytic index is well defined and a condensed proof of the R/Z Grothendieck-Riemann-Roch theorem.
Simplified proof for a theorem about graphs.
problem Proving a generalized Conway--Gordon--Sachs theorem for complete graphs.
method Provided a shorter proof over integers.
result A simpler proof of the generalized theorem.
Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of semi-algebraic proof systems that manipulate polynomial inequalities via elementary inferen…
We offer a simplified proof for Expected Shortfall's dual representation.
problem The dual representation of Expected Shortfall.
method Basic properties of quantile functions.
result New proof of Expected Shortfall's subadditivity.
Proof given for SGD convergence in a concise manner.
problem Convergence of Stochastic Gradient Descent (SGD)
method Self-contained proof
result SGD convergence proven
The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof. In this paper we give a new and improved proof of the Goldman-Parker Conjecture.…
We give a new proof of the isoperimetric inequality in the plane, based on Steiner's formula for the area of a convex neighborhood. This proof establishes the isoperimetric inequality directly, without requiring that we separately establish the existence of an optimal domain. In doing so, this proof bypasses the main d…
Transformers improve logical reasoning on longer proofs but struggle with length.
problem Understanding systematic generalization in neural proof generation.
method Soft theorem-proving using Transformer models, evaluating logical consistency and inference accuracy.
result Transformers improve generalization with longer proofs but have difficulty with length.
Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by en…
Paper provides a rigorous proof of the index theorem for economists.
problem Lack of a rigorous proof in textbooks for economists.
method Constructs a readable proof of the index theorem under specific assumptions.
result Provides a gap-free proof of the index theorem.
Simplified proof of Gaussian concentration inequality using covariance.
problem Gaussian concentration inequality proof
method Covariance representation based on characteristic functions
result Elementary proof of Gaussian concentration inequality
Simple proof for special surface classification.
problem Classifying surfaces with specific curvature properties.
method Elementary proof for parallel mean curvature surfaces.
result A lemma is proven for surfaces in complex space forms.
Mostow Rigidity Made Easiermath.GT
Simplified proof of a famous geometry result for students.
problem Mostow Rigidity in geometry and topology
method Self-contained, accessible proof for grad students
result Clean and analytically light proof accessible to students
We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.
We will give a new proof for the Gromov's theorem on almost flat manifolds, which is an inductive proof on dimension.
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of classifier. Though such a proof appears simple on paper, analytic and measure-theoret…
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and …
First geometric proof of the flyping theorem.
problem Proving Tait's flyping conjecture.
method Geometric proof using Greene's characterization, Menasco's crossing ball structures, and isotopy/re-plumbing moves.
result First entirely geometric proof of Menasco-Thistlethwaite's flyping theorem.
Two proofs show that removing a loop from a plane circuit splits the plane.
problem Proving the Weak Jordan Theorem about plane circuits.
method Detailed presentation of Thomassen's and Filippov's proofs.
result The complement of any loop in a plane circuit is disconnected.
Notes a flaw in a proof about embedding graphs.
problem A flaw in proving Sachs' conjecture about graph embeddings.
method Analyzing Stanfield's proof for gaps.
result Identifies a significant error in the proof.
Combinatorial proof of grid homology properties.
problem Properties of double-point enhanced grid homology.
method Purely combinatorial proof, extended to coefficients.
result Skein exact sequence obeyed by grid homology.
Proves Thurston's bounded image theorem for Haken manifolds.
problem Proving Thurston's bounded image theorem for Haken manifolds.
method Using recent developments in Kleinian group theory.
result A proof of Thurston's original bounded image theorem.
New proof for higher rank subvarieties in genus three.
problem Classifying higher rank invariant subvarieties in genus three.
method Uses recent techniques developed by Apisa and Wright.
result Short and simplified proof of classification.
A simplified proof for satellite knot signatures.
problem Proving Litherland's formula for satellite knots.
method Uses linear algebra and basic knot theory.
result A new, elementary proof of the signature formula.
Recently, Andrews and Clutterbuck [AC13] gave a new proof of the optimal lower eigenvalue bound on manifolds via modulus of continuity for solutions of the heat equation. In this short note, we give an alternative proof of Theorem 2 in [AC13]. More precisely, following Ni's method ([Ni13, Section 6]) we give an ellipti…
After surveying existing proofs that every closed, orientable 3-manifold is parallelizable, we give three proofs using minimal background. In particular, our proofs use neither spin structures nor the theory of Stiefel-Whitney classes.
Proof of Gromov's conjecture in 3D simplifies existing methods.
problem Gromov's dihedral rigidity conjecture on scalar curvature in 3D.
method Self-contained proof avoiding technical complications, shorter and more accessible than general case.
result Simplified proof of Gromov's conjecture in 3D.
Simplified proof classifies surfaces using normal curves.
problem Classifying surfaces using algebraic topology invariants.
method Using normal curves and analogy to 3-manifolds classification.
result Simple proof without using algebraic topology invariants.
Corollary 2.3 in our paper "A geometric proof of the Karpelevich-Mostow theorem", Bull. Lond. Math. Soc. 41 (2009), no. 4, 634-638, is false. Here we give a counterexample and show how to avoid the use of this corollary to give a simpler proof of Karpelevich-Mostow theorem. We also include a short discussion of the ori…
Simplified proof for Cheeger's isoperimetric constant.
problem Cheeger's isoperimetric constant
method Simplified proof of Buser's result
result Simplified proof for Cheeger's isoperimetric constant
New model shows hierarchical proof structure helps theorem provers.
problem How to efficiently learn proofs from teacher traces.
method Model proof search as MDP, analyze imitation learning from traces.
result Hierarchical proof structure leads to more efficient learning.
This note (originally from 2015) provides a proof of a 1985 conjecture of Montiel and Ros concerning the conformal volume of tori. This updated version adds a proof of the claim made in Remark 5 about the value of the conformal volume of tori in the cases not covered by the conjecture of Montiel and Ros. Originally, I …
Abstract: Unknown status of Jacobian Conjecture, proof has a gap.
problem Status of Jacobian Conjecture
method Analysis of proof of theorem 2.1
result Proof of theorem 2.1 contains a gap
New proof of Willmore inequality using geometric divergence inequality.
problem Proving the Willmore inequality for bounded domains.
method Using a parametric geometric inequality derived from a divergence form geometric differential inequality.
result New proofs of quantitative Willmore-type and weighted Minkowski inequalities.
New proof shows maximal arithmetic groups are finite.
problem Finiteness of maximal arithmetic reflection groups.
method Arithmetic Margulis lemma without automorphic forms.
result Finiteness of maximal arithmetic reflection groups proven.
We give a short proof of the systolic inequality for the n-dimensional torus. The proof uses minimal hypersurfaces. It is based on the Schoen-Yau proof that an n-dimensional torus admits no metric of positive scalar curvature.
New geometric proof of convex function differentiability and approximation.
problem Second-order differentiability of convex functions and their approximations.
method Elementary geometric approach to prove classical and recent results.
result New proofs of Lusin approximation of convex functions and bodies by functions.
Simplified proof for Frank and Lieb's inequality on Heisenberg group.
problem Proving the sharp Frank-Lieb inequality on the Heisenberg group.
method Simpler proof based on 2nd variation of subcritical functionals.
result A simpler proof of the inequality without the need for minimizer existence.
Explain Arnold's proof of the Morse index theorem using Maslov index.
problem Proving the Morse index theorem in Riemannian geometry.
method Using symplectic arguments and the Maslov index.
result Self-contained exposition of Arnold's proof.
It is known that planar disks and small spherical caps are the only constant mean curvature graphs whose boundary is a round circle. Usually, the proof invokes the Maximum Principle for elliptic equations. This paper presents a new proof of this result motivated by an article due to Reilly. Our proof utilizes a flux fo…
We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.
Patterns and Tracksmath.GT
New proof for sphere recognition algorithm.
problem Sphere recognition algorithm proof.
method New proof of a lemma in Abigail Thompson's algorithm.
result New proof of a lemma in Abigail Thompson's proof of the Recognition Algorithm for 3-spheres.
Transformed geometry into algebra to prove Pick's theorem efficiently.
problem Translating geometric Pick's theorem into formal algebraic proof.
method Formalized geometric Pick's theorem into algebraic proof using Lean.
result Efficient formal proof of Pick's theorem.
Simplified proof of K3 surface period map surjectivity.
problem Surjectivity of period map on K3 surfaces.
method Utilizes hyperkähler geometry and collapsing techniques.
result Simple proof of Todorov's result on K3 surfaces.