Related papers: Formal Proof of the Weak Goodstein Theorem
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
Weak values inferred from weak measurements have been proposed as a tool to investigate trajectories of pre- and post-selected quantum systems. Are the inferences drawn from the weak values about the past of a quantum particle fully true?…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
The weak value approximation has been in use for thirty-five years, but it has not as of yet received a truly complete derivation, leaving its mathematical validity in a state of limbo. Herein, I fill this gap, deriving the weak value…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging…
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…
The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime'' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas…
In this study, we introduce graded pseudo weakly prime submodules of G-graded R-modules, which are an extension of graded weakly prime ideals over G-graded rings. On the graded spectrum of graded pseudo weakly prime submodules, we…
Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. In recent years, the advancement of deep learning, especially the emergence of large…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
Aharonov-Albert-Vaidman's weak values are investigated by a semiclassical method. Examples of the semiclassical calculation that reproduces "anomalous" weak values are shown. Furthermore, a complex extension of Ehrenfest's quantum-classical…
We show that the existence of a weakly compact cardinal over the Zermelo-Fraenkel's set theory is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.
The novel idea of weak Galerkin (WG) finite element methods is on the use of weak functions and their weak derivatives defined as distributions. Weak functions and weak derivatives can be approximated by polynomials with various degrees.…
Weak-to-strong generalization is a phenomenon in post-training whereby a strong student model, when finetuned solely with feedback from a weaker teacher, can not only surpass the teacher, but can improve upon its own capabilities. Recent…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
In this, partly pedagogical review, I attempt to give a self-contained overview of the basis of (non-relativistic) QM measurement theory expressed in density matrix formalism. The focus is on applications to the theory of weak measurement,…
Agentic theorem provers often introduce intermediate lemmas, proof sketches, or subgoal decompositions before returning to tactic-level search. This can look like an expensive detour: if proving lemmas is itself hard, why should a learned…