Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I assume the following Lemma is either well known or, more probably, a Corollary of a much stronger well known Theorem, and I would be grateful for a reference:

For all $\delta\in (0,1)$ and all $\ell\in \mathbb N$ there are $M$ and $\varepsilon>0 $ such that: Whenever we have a probability space $\Omega$ and a family $(A_i:i\lt M)$ of sets of measure $\ge \delta$, we can find a subfamily of $\ell$ many sets whose intersection has measure at least $\varepsilon$.

PS: An (easy) proof is a nice but straightforward application of Ramsey's theorem.

PS2: Only finite additivity of the measure is required/relevant.

share|improve this question
3  
Welcome to mathoverflow! What a coincidence, I was just thinking about this very question :-) –  Goldstern Sep 28 '12 at 22:13
2  
Welcome, Jakob. –  Andres Caicedo Sep 28 '12 at 22:28
1  
Analyse the sum of the characteristic functions of the sets, which has integral at least $|M| \delta$ and sup norm at most |M|$. –  Bill Johnson Sep 28 '12 at 23:22
    
@bill johnson: I think this only gives you a large set of points that are in at least $\ell$ sets, but Jakob wants that they are all in the same $\ell$ sets. –  Goldstern Sep 28 '12 at 23:28
1  
Sure, but then some collection of $\ell$ sets contains many points (not that this gives a very good estimate). –  Bill Johnson Sep 29 '12 at 0:13

2 Answers 2

As Bill Johnson pointed out in his comment, the Lemma that I stated is trivial: simple counting is enough. Therefore, a reference is not required and would not make sense. So Bill Johnson answered my question (thanks!).

I would like to add a remark (unfortunately, a comment does not provide enough space, so I have to abuse an "answer" entry):

Originally we though of the following, slightly stronger variant of the Lemma (for which we used Ramsey's Theorem, but which might have a counting proof as well, who knows):

For all $\delta\in (0,1)$ and all $k\in \mathbb N$ there is an $\varepsilon(\delta,k)>0 $, and for all $\ell$ (bigger than $5/\delta$, say) there is a $M(\ell)$ such that: Whenever we have a probability space $\Omega$ and a family $\mathcal A=(A_i:i\lt N)$ of sets of measure $\ge \delta$, then we can find a subfamily $\mathcal B$ of size $\ell$ such that every subfamily $\mathcal C$ of $\mathcal B$ of size $k$ has an intersection of measure at least $\varepsilon$.

(So here $\varepsilon$ does not depend on $\ell$, but on $\delta$ and $k$ only. For $k=\ell$ we get the Lemma of the original question.)

share|improve this answer

This can be considered one version of the Poincare recurrence theorem. Vitaly Bergelson's paper "The multifarious Poincare recurrence theorem" might discuss something along these lines. See also the proof of Theorem 3.1 in Bergelson-Downarowicz's paper "Large sets of integers and hierarchy of mixing properties of measure-preserving systems" and p. 49 of Bergelson's "Ergodic Ramsey Theory - an Update" where a similar argument is used to prove Khintchine's recurrence Theorem.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.