• Aucun résultat trouvé

A constructive and elementary proof of Reny's theorem

N/A
N/A
Protected

Academic year: 2021

Partager "A constructive and elementary proof of Reny's theorem"

Copied!
9
0
0

Texte intégral

Loading

Références

Documents relatifs

Rather than using a probabilistic proof, we use an adaptive argument, and work at small relative scales to use the fact that there is a lot of space in R N ; the difficult part (for

An important property of finite semigroups is that they admit factorization forests of finite height.. This fact is called the Factorization

(See BOREL-TITS [2], Proposition 10.3 and Theorem 2.14 a; note that according to Theorem 11.10 of [I], g is contained in a maximal torus ofG.) Since any absolutely

Assume tha,t a concrete ca.tegory (A, U) is a small-based category with enough implicit operations. This is a consequence of the fact that the class of 7~-algebras

Recall that a space is realcompact provided that each maximal centered family of zerosets with the countable intersection property has nonempty intersection. If X is

In this paper, we present a new proof of the celebrated theorem of Kellerer, stating that every integrable process, which increases in the convex order, has the same

According to a theorem of Valdivia (see [18]) for locally con- vex spaces, who refers to Bourgain and Diestel (see [2]) for Banach spaces, themselves referring

— Using a Hironaka resolution, the proof of Proposition 2.1 can be reduced to the case when every f i is a monomial, and then the proof becomes much easier.. We proceed however