Related papers: De Finetti for mathematics undergraduates
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
The Steinitz exchange lemma is a basic theorem in linear algebra used, for example, to show that any two bases for a finite-dimensional vector space have the same number of elements. The result is named after the German mathematician Ernst…
The paper is devoted to a somewhat idiosyncratic account of the theorem of de Bruijn-Erd\"{o}s and Hanani from the combinatorics of finite geometries and its various proofs. Among the proofs discussed are the original proofs by de…
Let $\Om$ be a Borel subset of $S^\Bbb N$ where $S$ is countable. A measure is called exchangeable on $\Om$, if it is supported on $\Om$ and is invariant under every Borel automorphism of $\Om$ which permutes at most finitely many…
We show how G\"odel's first incompleteness theorem has an analog in quantum theory. G\"odel's theorem implies endless opportunities for appending axioms to arithmetic, implicitly showing a role for an agent, namely an agent that asserts an…
For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…
We establish a `mixed' version of a fundamental theorem of Khintchine within the field of simultaneous Diophantine approximation. Via the notion of ubiquity we are able to make significant progress towards the completion of the metric…
Quantum versions of de Finetti's theorem are powerful tools, yielding conceptually important insights into the security of key distribution protocols or tomography schemes and allowing to bound the error made by mean-field approaches. Such…
In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…
Dutch book arguments have been applied to beliefs about the outcomes of measurements of quantum systems, but not to beliefs about quantum objects prior to measurement. In this paper, we prove a quantum version of the probabilists' Dutch…
Arrow's Impossibility Theorem is a seminal result of Social Choice Theory that demonstrates the impossibility of ranked-choice decision-making processes to jointly satisfy a number of intuitive and seemingly desirable constraints. The…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…
It is well know that basic conditionals satisfy some desirable basic logical and probabilistic properties, such as the compound probability theorem, but checking the validity of these becomes trickier when we switch to compound and iterated…
Motivated by statistical practice, category theory terminology is used to introduce Borel data structures and study exchangeability in an abstract framework. A generalization of de Finetti's theorem is shown and natural transformations are…
Inspired by Lehner's results on exchangeability systems we define `weak conditional freeness' and `conditional freeness' for stationary processes in an operator algebraic framework of noncommutative probability. We show that these two…
The most versatile version of the classical divergence Borel-Cantelli lemma shows that for any divergent sequence of events $E_n$ in a probability space satisfying a quasi-independence condition, its corresponding limsup set $E_\infty$ has…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…
This thesis consists of three self-contained chapters. The first two concern quantum invariants of links and three manifolds and the third contains results on the word problem for link groups. In chapter 1 we relate the tree part of the…