About: Club filter     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FClub_filter&invfp=IFP_OFF&sas=SAME_AS_OFF

In mathematics, particularly in set theory, if is a regular uncountable cardinal then , the filter of all sets containing a club subset of , is a -complete filter closed under diagonal intersection called the club filter. To see that this is a filter, note that since it is thus both closed and unbounded (see club set). If then any subset of containing is also in , since , and therefore anything containing it, contains a club set.

AttributesValues
rdfs:label
  • Club filter (en)
rdfs:comment
  • In mathematics, particularly in set theory, if is a regular uncountable cardinal then , the filter of all sets containing a club subset of , is a -complete filter closed under diagonal intersection called the club filter. To see that this is a filter, note that since it is thus both closed and unbounded (see club set). If then any subset of containing is also in , since , and therefore anything containing it, contains a club set. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
id
title
  • club filter (en)
has abstract
  • In mathematics, particularly in set theory, if is a regular uncountable cardinal then , the filter of all sets containing a club subset of , is a -complete filter closed under diagonal intersection called the club filter. To see that this is a filter, note that since it is thus both closed and unbounded (see club set). If then any subset of containing is also in , since , and therefore anything containing it, contains a club set. It is a -complete filter because the intersection of fewer than club sets is a club set. To see this, suppose is a sequence of club sets where . Obviously is closed, since any sequence which appears in appears in every , and therefore its limit is also in every . To show that it is unbounded, take some . Let be an increasing sequence with and for every . Such a sequence can be constructed, since every is unbounded. Since and is regular, the limit of this sequence is less than . We call it , and define a new sequence similar to the previous sequence. We can repeat this process, getting a sequence of sequences where each element of a sequence is greater than every member of the previous sequences. Then for each , is an increasing sequence contained in , and all these sequences have the same limit (the limit of ). This limit is then contained in every , and therefore , and is greater than . To see that is closed under diagonal intersection, let , be a sequence of club sets, and let . To show is closed, suppose and . Then for each , for all . Since each is closed, for all , so . To show is unbounded, let , and define a sequence , as follows: , and is the minimal element of such that . Such an element exists since by the above, the intersection of club sets is club. Then and , since it is in each with . (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software