Infinitely often and almost always: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 9: Line 9:
| unions and intersections || <math>\omega \in \bigcap_{N=1}^\infty \bigcup_{n=N}^\infty A_n</math> || <math>\omega \in \bigcup_{N=1}^\infty \bigcap_{n=N}^\infty A_n</math>
| unions and intersections || <math>\omega \in \bigcap_{N=1}^\infty \bigcup_{n=N}^\infty A_n</math> || <math>\omega \in \bigcup_{N=1}^\infty \bigcap_{n=N}^\infty A_n</math>
|-
|-
| first-order quantifiers || <math>\forall N\geq 1\ \exists n \geq N\colon \omega \in A_n</math> || <math>\exists N \leq 1\ \forall n \geq N\colon \omega \in A_n</math>
| first-order quantifiers || <math>\forall N\geq 1\ \exists n \geq N\colon \omega \in A_n</math> || <math>\exists N \geq 1\ \forall n \geq N\colon \omega \in A_n</math>
|-
|-
| verbal expression || <math>\omega \in A_n</math> for infinitely many <math>n\geq 1</math> || <math>\omega \in A_n</math> for almost all <math>n\geq 1</math>, i.e. <math>\omega \in A_n</math> for all but finitely many <math>n \geq 1</math>, i.e. <math>\omega \notin A_n</math> for finitely many <math>n \geq 1</math>
| verbal expression || <math>\omega \in A_n</math> for infinitely many <math>n\geq 1</math> || <math>\omega \in A_n</math> for almost all <math>n\geq 1</math>, i.e. <math>\omega \in A_n</math> for all but finitely many <math>n \geq 1</math>, i.e. <math>\omega \notin A_n</math> for finitely many <math>n \geq 1</math>

Revision as of 21:49, 31 July 2019

Let A1,A2,A3, be a sequence of events in some sample space Ω. Let ωΩ be an outcome.

In the following table, all statements in the "infinitely often" column are logically equivalent. Similarly, all statements in the "almost always" column are logically equivalent.

perspective infinitely often almost always
unions and intersections ωN=1n=NAn ωN=1n=NAn
first-order quantifiers N1nN:ωAn N1nN:ωAn
verbal expression ωAn for infinitely many n1 ωAn for almost all n1, i.e. ωAn for all but finitely many n1, i.e. ωAn for finitely many n1
lim sup/lim inf ωlim supnAn ωlim infnAn
limit of sup/inf ωlimNn=NAn ωlimNn=NAn

Analogy with sequences of real numbers

Let (an)n=1 be a sequence of real numbers, and let ϵ>0 be a real number.

We say (an)n=1 is eventually ϵ-close to x iff there exists some N1 such that for all nN we have |anx|ϵ.

We say that (an)n=1 is continually ϵ-adherent iff for every N1 there exists some nN such that |anx|ϵ.