Related papers: Biba's trick, with applications

These are notes of my lectures at the summer school "Higher-dimensional geometry over finite fields" in Goettingen, June--July 2007. We present a proof of Tate's theorem on homomorphisms of abelian varieties over finite fields (including…

The aim of the present paper is on the one hand to produce examples supporting the conclusion of Y. Namikawa in Remark 2.8 of \cite{N} and improving considerations of Example 1.11 of the same paper. On the other hand, it is intended to give…

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

Let $\pi: X \to Y$ be a morphism of projective varieties and suppose that $\alpha$ is a pseudo-effective numerical cycle class satisfying $\pi_*\alpha = 0$. A conjecture of Debarre, Jiang, and Voisin predicts that $\alpha$ is a limit of…

Reinhardt's conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite…

Jakob Bernoulli, working in the late 17th century, identified a gap in contemporary probability theory. He cautioned that it was inadequate to specify force of proof (probability of provability) for some kinds of uncertain arguments. After…

Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…

This note outlines a constructive proof of a proposition in Mochizuki's paper "Arithmetic elliptic curves in general position," making a direct use of computable non-critical Belyi maps to effectively reduce the full $abc$-conjecture to a…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

We employ the pinching theorem, ensuring that some operators A admit any sequence of contractions as an operator diagonal of A, to deduce/improve two recent theorems of Kennedy-Skoufranis and Loreaux-Weiss for conditional expectations onto…

Lifted inference algorithms exploit symmetries in probabilistic models to speed up inference. They show impressive performance when calculating unconditional probabilities in relational models, but often resort to non-lifted inference when…

A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…

The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an…

This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

While large language models (LLMs) have shown progress in mathematical reasoning, they still face challenges in formalizing theorems that arise from instantiating abstract structures in concrete settings. With the goal of auto-formalizing…

Updated version of 2013 Arizona WInter School notes on modularity lifting theorems for for two-dimensional p-adic representations, using wherever possible arguments that go over to the n-dimensional (self-dual) case.

We discuss a conjecture of Wilson that under the proper forcing axiom, $\Theta_0$ of the derived model at $\kappa$ is below $\kappa^+$. We prove the conjecture holds for the old derived model. Assuming mouse capturing in the new derived…

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…