Infinitely often and almost always: Difference between revisions

From Machinelearning
Line 20: Line 20:
==Analogy with sequences of real numbers==
==Analogy with sequences of real numbers==


Let <math>(a_n)_{n=1}^\infty</math> be a sequence of real numbers, and let <math>\epsilon > 0</math> be a real number.
Let <math>(a_n)_{n=1}^\infty</math> be a sequence of real numbers, let <math>\epsilon > 0</math> be a real number, and let <math>x</math> be a real number.


We say <math>(a_n)_{n=1}^\infty</math> is eventually <math>\epsilon</math>-close to <math>x</math> iff there exists some <math>N \geq 1</math> such that for all <math>n \geq N</math> we have <math>|a_n - x| \leq \epsilon</math>.
We say <math>(a_n)_{n=1}^\infty</math> is eventually <math>\epsilon</math>-close to <math>x</math> iff there exists some <math>N \geq 1</math> such that for all <math>n \geq N</math> we have <math>|a_n - x| \leq \epsilon</math>.
Line 26: Line 26:
We say that <math>(a_n)_{n=1}^\infty</math> is continually <math>\epsilon</math>-adherent iff for every <math>N \geq 1</math> there exists some <math>n \geq N</math> such that <math>|a_n - x| \leq \epsilon</math>.
We say that <math>(a_n)_{n=1}^\infty</math> is continually <math>\epsilon</math>-adherent iff for every <math>N \geq 1</math> there exists some <math>n \geq N</math> such that <math>|a_n - x| \leq \epsilon</math>.


I think we can even define <math>A_n := \{x : |a_n-x| \leq \epsilon\}</math>.
I think we can even define <math>A_n := \{x \in \mathbf R : |a_n-x| \leq \epsilon\}</math>.


[[Category:Probability]]
[[Category:Probability]]

Revision as of 21:54, 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, let ϵ>0 be a real number, and let x 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|ϵ.

I think we can even define An:={xR:|anx|ϵ}.