Searcharxiv⌕ Search

arXiv · 2610.22612

Proof Perplexity: A Probabilistic Approach to Measuring non-triviality in Machine Generated Proofs

Abstract

In this article, we propose a benchmark to quantify the non-triviality and novelty of machine-generated mathematical proofs compared to existing literature. Our core methodology uses a probabilistic measure to evaluate the non-triviality of the underlying mathematical arguments in comparison to the current \texttt{MATHLIB} library. Finally, we apply this benchmark to the recent proof generated by Claude on the complex zeros of the Riemann zeta function to test for non-trivial steps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Madhuparna Das, Soumya Banerjee. 2026-10-15. Proof Perplexity: A Probabilistic Approach to Measuring non-triviality in Machine Generated Proofs. https://searcharxiv.com/abs/2610.22612

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗