|
|
| Line 1: |
Line 1: |
| {{for|the term in highway engineering|Subbase (pavement)}}
| | Hello, I'm Jeanett, a 23 year old from Marke, Belgium.<br>My hobbies include (but are not limited to) Vehicle restoration, Australian Football League and watching NCIS.<br><br>my weblog - castle clash cheats ([http://streetsocietynews.com/members/pilargrimley/activity/176480/ view]) |
| | |
| In [[topology]], a '''subbase''' (or '''subbasis''') for a [[topological space]] ''X'' with [[topological space|topology]] ''T'' is a subcollection ''B'' of ''T'' which generates ''T'', in the sense that ''T'' is the smallest topology containing ''B''. A slightly different definition is used by some authors, and there are other useful equivalent formulations of the definition; these are discussed below.
| |
| | |
| == Definition ==
| |
| | |
| Let ''X'' be a topological space with topology ''T''. A subbase of ''T'' is usually defined as a subcollection ''B'' of ''T'' satisfying one of the two following equivalent conditions:
| |
| | |
| #The subcollection ''B'' ''generates'' the topology ''T''. This means that ''T'' is the smallest topology containing ''B'': any topology ''U'' on ''X'' containing ''B'' must also contain ''T''.
| |
| #The collection of open sets consisting of all finite [[intersection (set theory)|intersections]] of elements of ''B'', together with the set ''X'' and the empty set, forms a [[Basis (topology)|basis]] for ''T''. This means that every non-empty proper [[open set]] in ''T'' can be written as a [[union (set theory)|union]] of finite intersections of elements of ''B''. Explicitly, given a point ''x'' in a proper open set ''U'', there are finitely many sets ''S''<sub>1</sub>, …, ''S''<sub>n</sub> of ''B'', such that the intersection of these sets contains ''x'' and is contained in ''U''.
| |
| | |
| (Note that if we use the [[nullary intersection]] convention, then there is no need to include ''X'' in the second definition.)
| |
| | |
| For ''any'' subcollection ''S'' of the [[power set]] P(''X''), there is a unique topology having ''S'' as a subbase. In particular, the [[Intersection (set theory)|intersection]] of all topologies on ''X'' containing ''S'' satisfies this condition. In general, however, there is no unique subbasis for a given topology.
| |
| | |
| Thus, we can start with a fixed topology and find subbases for that topology, and we can also start with an arbitrary subcollection of the power set P(''X'') and form the topology generated by that subcollection. We can freely use either equivalent definition above; indeed, in many cases, one of the two conditions is more useful than the other.
| |
| | |
| === Alternative definition ===
| |
| | |
| Sometimes, a slightly different definition of subbase is given which requires that the subbase ''B'' cover ''X''.<ref>{{cite book |last1=Merrifield |first1=Richard E. |last2=Simmons |first2=Howard E. |authorlink2=Howard Ensign Simmons, Jr. |title=Topological Methods in Chemistry |year=1989 |publisher=John Wiley & Sons |isbn=0-471-83817-9 |url=http://www.wiley.com/WileyCDA/WileyTitle/productCd-0471838179.html|accessdate=13 June 2013 |page=17 |quote=A collection ''S'' of subsets that satisfies criterion (i) is called a ''subbasis'' for a topology on ''X''.}}</ref> In this case, ''X'' is an open set in the topology generated, because it is the union of all the {''B''<sub>''i''</sub>} as ''B''<sub>''i''</sub> ranges over ''B''. This means that there can be no confusion regarding the use of nullary intersections in the definition.
| |
| | |
| However, with this definition, the two definitions above are not always equivalent. In other words, there exist spaces ''X'' with topology ''T'', such that there exists a subcollection ''B'' of ''T'' such that ''T'' is the smallest topology containing ''B'', yet ''B'' does not cover ''X''. In practice, this is a rare occurrence; e.g. a subbase of a space satisfying the [[T1 separation axiom|T<sub>1</sub> separation axiom]] must be a cover of that space.
| |
| | |
| == Examples ==
| |
| | |
| The usual topology on the [[real number]]s '''R''' has a subbase consisting of all [[semi-infinite]] open intervals either of the form (−∞,''a'') or (''b'',∞), where ''a'' and ''b'' are real numbers. Together, these generate the usual topology, since the intersections <math>(a,b) = (-\infty,b) \cap (a,\infty)</math> for ''a'' < ''b'' generate the usual topology. A second subbase is formed by taking the subfamily where ''a'' and ''b'' are [[rational number|rational]]. The second subbase generates the usual topology as well, since the open intervals (''a'',''b'') with ''a'', ''b'' rational, are a basis for the usual Euclidean topology.
| |
| | |
| The subbase consisting of all semi-infinite open intervals of the form (−∞,''a'') alone, where ''a'' is a real number, does not generate the usual topology. The resulting topology does not satisfy the [[T1 space|T<sub>1</sub> separation axiom]], since all open sets have a non-empty intersection.
| |
| | |
| The [[initial topology]] on ''X'' defined by a family of functions ''f''<sub>''i''</sub> : ''X'' → ''Y''<sub>''i''</sub>, where each ''Y''<sub>''i''</sub> has a topology, is the coarsest topology on ''X'' such that each ''f''<sub>''i''</sub> is [[continuous (topology)|continuous]]. Because continuity can be defined in terms of the inverse images of open sets, this means that the initial topology on ''X'' is given by taking all ''f''<sub>''i''</sub><sup>−1</sup>(''U''),
| |
| where ''U'' ranges over all open subsets of ''Y''<sub>''i''</sub>, as a subbasis.
| |
| | |
| Two important special cases of the initial topology are the [[product topology]], where the family of functions is the set of projections from the product to each factor, and the [[subspace topology]], where the family consists of just one function, the [[inclusion map]].
| |
| | |
| The [[compact-open topology]] on the space of continuous functions from ''X'' to ''Y'' has for a subbase the set of functions
| |
| :<math>V(K,U) = \{f\colon X\to Y \mid f(K)\sub U\}</math>
| |
| where ''K'' is [[compact space|compact]] and ''U'' is open ''Y''.
| |
| | |
| == Results using subbases ==
| |
| | |
| One nice fact about subbases is that [[continuity (topology)|continuity]] of a function need only be checked on a subbase of the range. That is, if ''B'' is a subbase for ''Y'', a function ''f'' : ''X'' → ''Y'' is continuous [[iff]] ''f''<sup>−1</sup>(''U'') is open in ''X'' for each ''U'' in ''B''.
| |
| | |
| === Alexander subbase theorem ===
| |
| | |
| There is one significant result concerning subbases, due to [[James Waddell Alexander II]].
| |
| | |
| '''Theorem''': Let ''X'' be a topological space with a subbasis B. If every subbasic cover from ''B'' has a finite subcover, then the space is [[compact space|compact]].
| |
| | |
| (The corresponding result for basic covers is trivial.)
| |
| | |
| '''Proof''' (outline): Assume by way of contradiction that the space ''X'' is not compact, yet every subbasic cover from ''B'' has a finite subcover. Use [[Zorn's Lemma]] to find an open cover '''C''' without finite subcover that is ''maximal'' amongst such covers. That means that if ''V'' is not in '''C''', then '''C'''∪{''V''} has a finite subcover, necessarily of the form '''C'''<sub>0</sub>∪{''V''}.
| |
| | |
| Consider '''C'''∩''B'', that is, the subbasic subfamily of '''C'''. If it covered ''X'', then by hypothesis, it would have a finite subcover. But '''C''' does not have such, so '''C'''∩''B'' does not cover ''X''. Let ''x''∈''X'' that is not covered. '''C''' covers ''X'', so ''x''∈''U'' for some ''U''∈'''C'''. ''B'' is a subbasis, so for some ''S''<sub>1</sub>, …, ''S''<sub>n</sub>∈''B'', ''x''∈''S''<sub>1</sub>∩…∩''S''<sub>n</sub>⊆''U''.
| |
| | |
| Since ''x'' is uncovered, ''S''<sub>''i''</sub>∉'''C'''. As noted above, this means that for each ''i'', ''S''<sub>''i''</sub> along with a finite subfamily '''C'''<sub>''i''</sub> of '''C''', covers ''X''. But then ''U'' and all the '''C'''<sub>''i''</sub>’s cover ''X'', so '''C''' has a finite subcover after all. [[Q.E.D.]]
| |
| | |
| Although this proof makes use of [[Zorn's Lemma]], the proof does not need the full strength of choice. Instead, it relies on the intermediate [[Ultrafilter principle]].
| |
| | |
| Using this theorem with the subbase for '''R''' above, one can give a very easy proof that bounded closed intervals in '''R''' are compact.
| |
| | |
| [[Tychonoff's theorem]], that the product of compact spaces is compact, also has a short proof. The product topology on ∏<sub>''i''</sub>''X''<sub>''i''</sub> has, by definition, a subbase consisting of ''cylinder'' sets that are the inverse projections of an open set in one factor. Given a ''subbasic'' family '''C''' of the product that does not have a finite subcover, we can partition '''C'''=∪<sub>''i''</sub>'''C'''<sub>''i''</sub> into subfamilies that consist of exactly those cylinder sets corresponding to a given factor space. By assumption, no '''C'''<sub>''i''</sub> has a finite subcover. Being cylinder sets, this means their projections onto ''X''<sub>''i''</sub> have no finite subcover, and since each ''X''<sub>''i''</sub> is compact, we can find a point ''x''<sub>''i''</sub>∈''X''<sub>''i''</sub> that is not covered by the projections of '''C'''<sub>''i''</sub> onto ''X''<sub>''i''</sub>. But then ‹''x''<sub>''i''</sub>› is not covered by '''C'''.
| |
| | |
| Note, that in the last step we implicitly used the [[axiom of choice]] (which is actually equivalent to [[Zorn's lemma]]) to ensure the existence of ‹''x''<sub>''i''</sub>›.
| |
| | |
| ==See also==
| |
| * [[Base (topology)]]
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| * {{Citation | last=Willard | first=Stephen | title=General topology | publisher=[[Dover Publications]] | location=New York | isbn=978-0-486-43479-7 | id={{MathSciNet | id = 2048350}} | year=2004}}
| |
| | |
| [[Category:General topology]]
| |
| [[Category:Articles containing proofs]]
| |
| | |
| [[de:Basis (Topologie)]]
| |
Hello, I'm Jeanett, a 23 year old from Marke, Belgium.
My hobbies include (but are not limited to) Vehicle restoration, Australian Football League and watching NCIS.
my weblog - castle clash cheats (view)