OurBigBook About$ Donate
 Sign in Sign up

Eventual domination (f≤∗g)

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Set theory
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For functions f,g:ω→ω, write f≤∗g when f(n)≤g(n) for all sufficiently large n. A dominating family is cofinal for this relation.
  • Table of contents
    • Bounding number Eventual domination
    • Dominating family Eventual domination

Bounding number (b)

 0  0
Eventual domination
The least size of a family in ωω having no common bound for eventual domination. Every countable family (fi​) has the bound g(n)=1+maxi≤n​fi​(n), so ℵ1​≤b≤2ℵ0​.

Dominating family (∀f ∃g∈C f≤∗g)

 0  0
Eventual domination
A family C⊆ωω such that every f∈ωω is eventually dominated by some g∈C.

 Ancestors (5)

  1. Set theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (2)

  • Bounding number
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 1 / a / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook