bn:00870763n
Noun Concept
Categories: Order theory
EN
cofinal  Cofinal function  Cofinal net  cofinal sequence  cofinal set
EN
In mathematics, a subset B ⊆ A {\displaystyle B\subseteq A} of a preordered set {\displaystyle } is said to be cofinal or frequent in A {\displaystyle A} if for every a ∈ A, {\displaystyle a\in A,} it is possible to find an element b {\displaystyle b} in B {\displaystyle B} that is "larger than a {\displaystyle a} ". Wikipedia
English:
mathematics
Definitions
Relations
Sources
EN
In mathematics, a subset B ⊆ A {\displaystyle B\subseteq A} of a preordered set {\displaystyle } is said to be cofinal or frequent in A {\displaystyle A} if for every a ∈ A, {\displaystyle a\in A,} it is possible to find an element b {\displaystyle b} in B {\displaystyle B} that is "larger than a {\displaystyle a} ". Wikipedia
mathematical property of subsets in order theory Wikidata
HAS INSTANCE