Infinitely often and almost always: Difference between revisions

From Machinelearning
No edit summary
Line 25: Line 25:


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>.


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

Revision as of 21:53, 31 July 2019

Let 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
first-order quantifiers
verbal expression for infinitely many for almost all , i.e. for all but finitely many , i.e. for finitely many
lim sup/lim inf
limit of sup/inf

Analogy with sequences of real numbers

Let be a sequence of real numbers, and let be a real number.

We say is eventually -close to iff there exists some such that for all we have .

We say that is continually -adherent iff for every there exists some such that .

I think we can even define .