Related papers: A simple proof of Renner's exponential de Finetti …
We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.
We review old and recent finite de Finetti theorems in total variation distance and in relative entropy, and we highlight their connections with bounds on the difference between sampling with and without replacement. We also establish two…
In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
Urysohn's Lemma is a crucial property of normal spaces that deals with separation of closed sets by continuous functions. It is also a fundamental ingredient in proving the Tietze Extension Theorem, another property of normal spaces that…
We develop a framework for the operationalization of models and parameters by combining de Finetti's representation theorem with a conditional form of Sanov's theorem. This synthesis, the tilted de Finetti theorem, shows that conditioning…
We present a novel proof of de Finetti's Theorem characterizing permutation-invariant probability measures of infinite sequences of variables, so-called exchangeable measures. The proof is phrased in the language of Markov categories, which…
This paper presents a novel direct elementary proof for Fermat's Last Theorem. We use algebra, modular math, and binomial series to develop inherent mathematical relationships hidden within Fermat's Last Theorem. With these derived…
With the aid of utilising tensor products, we give a simplified proof to the fundamental theorem of Benedetto and Fickus about the existence and characterisation of finite, normalised tight frames. We also establish unit-norm tensor…
Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…
The classical de Finetti Theorem classifies the $\mathrm{Sym}(\mathbb N)$-invariant probability measures on $[0,1]^{\mathbb N}$. More precisely it states that those invariant measures are combinations of measures of the form…
De Finetti's betting argument is used to justify finitely additive probabilities when only finitely many bets are considered. Under what circumstances can countably many bets be used to justify countable additivity? In this framework, one…
A method to generalize results from Riemannian Geometry to Finsler geometry is presented. We use the method to generalize several results that involve only metric conditions. Between them we show that the topology induced by the Finsler…
A consequence of de Finetti's representation theorem is that for every infinite sequence of exchangeable 0-1 random variables $(X_k)_{k\geq1}$, there exists a probability measure $\mu$ on the Borel sets of $[0,1]$ such that $\bar X_n =…
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
Motivated by recent interests in predictive inference under distribution shift, we study the problem of approximating finite weighted exchangeable sequences by a mixture of finite sequences with independent terms. Various bounds are derived…
We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.
This paper presents a simple proof of Dekel (1986)'s representation theorem for betweenness preferences. The proof is based on the separation theorem.
Exchangeability is a fundamental concept in probability theory and statistics. It allows to model situations where the order of observations does not matter. The classical de Finetti's theorem provides a representation of infinitely…
We give a purely combinatorial proof of the density Hales--Jewett Theorem that is modeled after Polymath's proof but is significantly simpler. In particular, we avoid the use of the equal-slices measure and work exclusively with the uniform…