English
Related papers

Related papers: A simple proof of the representation theorem for b…

200 papers

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.

Functional Analysis · Mathematics 2014-04-08 Tamás Titkos

I provide simplified proofs for each of the following fundamental theorems regarding selection principles: 1. The Quasinormal Convergence Theorem, due to the author and Zdomskyy, asserting that a certain, important property of the space of…

General Topology · Mathematics 2024-06-05 Boaz Tsaban

An analogue of Serre's theorem is established for finite dimensional simple Lie superalgebras, which describes presentations in terms of Chevalley generators and Serre type relations relative to all possible choices of Borel subalgebras.…

Representation Theory · Mathematics 2011-01-18 R. B. Zhang

In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…

Logic · Mathematics 2009-06-18 Moran Cohen , Saharon Shelah

We present another proof for the well-known {\em small model property} of two-variable logic. As far as we know, existing proofs of this property rely heavily on model theoretic concepts. In contrast, ours is purely combinatorial and uses…

Logic in Computer Science · Computer Science 2020-06-03 Yanger Ma , Tony Tan

The aim of this paper is to give new representation theorems for extended contact algebras. These representation theorems are based on equivalence relations.

Logic in Computer Science · Computer Science 2020-09-22 Philippe Balbiani , Tatyana Ivanova

In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…

Number Theory · Mathematics 2021-01-05 Symon Serbenyuk

Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Dmitry Golubenko

A very simple but useful almost sure convergence theorem of probability is given.

General Mathematics · Mathematics 2011-12-19 Masumi Nakajima

A finite form of de Finetti's representation theorem is established using elementary information-theoretic tools: The distribution of the first $k$ random variables in an exchangeable binary vector of length $n\geq k$ is close to a mixture…

Information Theory · Computer Science 2021-06-28 Lampros Gavalakis , Ioannis Kontoyiannis

A representation theorem relates different mathematical structures by providing an isomorphism between them: that is, a one-to-one correspondence preserving their original properties. Establishing that the two structures substantially…

Logic in Computer Science · Computer Science 2023-06-02 Marco B. Caminati , Juliana K. F. Bowles

In Pure Inductive Logic, the principle of Strong Predicate Exchangeability is a rational principle based on symmetry that sits in between the principles of Predicate Exchangeability and Atom Exchangeability. We will show a de Finetti -…

Logic · Mathematics 2015-07-02 Malte S. Kließ

We obtain a representation theorem for the generators of BSDEs driven by G-Brownian motions, and then we use the representation theorem to get a converse comparison theorem for G-BSDEs and some equivalent results for nonlinear expectations…

Probability · Mathematics 2013-06-11 Kun Heand , Mingshang Hu

We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…

Representation Theory · Mathematics 2024-06-05 Jan-Paul Lerch

A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)

Logic · Mathematics 2009-09-25 Thomas Jech

This is just a short proof of Kruskal's theorem regarding uniqueness of expressions for tensors, phrased in geometric language.

Algebraic Geometry · Mathematics 2009-02-04 J. M. Landsberg

In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…

Artificial Intelligence · Computer Science 2019-07-01 Daniel Huang

It is discussed that Zeeman's theorem can be directly obtained from Liouville's theorem if we assume sufficient differentiability.

Mathematical Physics · Physics 2013-11-12 Do-Hyung Kim

In quantum process tomography, it is possible to express the experimenter's prior information as a sequence of quantum operations, i.e., trace-preserving completely positive maps. In analogy to de Finetti's concept of exchangeability for…

Quantum Physics · Physics 2009-11-10 Christopher A. Fuchs , Ruediger Schack , Petra F. Scudo