Angewandte Mathematik und. Informatik. Universitat zu Koln. Oriented Matroids from Wild Spheres. W. Hochstattler
|
|
- Adele Carter
- 5 years ago
- Views:
Transcription
1 Angewandte Mathematik und Informatik Universitat zu Koln Report No Oriented Matroids from Wild Spheres by W. Hochstattler 1995 W. Hochstattler Universitat zu Koln Weyertal D{50931 Koln Germany Telefon (0221) 470{6012 e{mail
2 1991 Mathematics Subject Classication: 05B35, 06B30, 51D20, 52B30, 52B40, 57N50 Keywords: Oriented Matroids, Wild Spheres, Sphere Systems, Topology, Matroids, Geometry
3 Oriented Matroids from Wild Spheres W. Hochstattler November 21, 1995 Abstract In a recent article [5] we gave a lattice-theoretical characterization of oriented matroids in terms of the zero-map. In this paper we derive from that characterization a generalization of one direction of the Topological Representation Theorem using hyperspheres which may be wildly embedded, thus solving a problem presented by A. Bjorner (see [1] Exercise 5.6.c). 1 Introduction Matroids, introduced in the 30s of this century, were modelled as a combinatorial abstraction of linear dependency in a vector space. Though they, originally, were supposed to reect a geometric situation their axioms are weak enough to allow structures quite dierent from point congurations in Euclidean space, in particular they encode the combinatoric structure of projective geometries over nite elds. As a consequence they are frequently considered to be \just" set systems. When oriented matroids were introduced in [7], [2] the former of these articles proved a close connection to topology: Every oriented matroid can be realized as a cell decomposition of a sphere induced by codimension 1 spheres such that the signed covectors of the oriented matroid correspond bijectively to the cells of the complex. Thus, oriented matroids always encode a geometric situation. On the other hand certain systems of hyperspheres on a sphere were shown to induce oriented matroids (see [7] and [9]). Both of them impose a \niceness" condition on the spheres, namely that their embedding always can be extended to a global homeomorphism of the sphere. As they are nice they induce a regular cell decomposition of the sphere which is the cell complex realizing the poset of the signed covectors of an oriented matroid. 1
4 Basics and Denitions 2 As by Jordan Brouwer Separation Theorem arbitrarily wild spheres have the combinatorial property to separate the sphere, there does not seem to be a combinatorial reason why the topological property of \being nice" should be necessary for a collection of hyperspheres to encode the combinatorial structure of an oriented matroid. In this paper we will prove that it actually is not. We will show that any niceness condition is redundant. As a corollary we derive an even weaker denition of a sphere system. Finally, we will restate the results in a lattice theory language to derive a characterization of oriented matroids in terms of shellability. We will prove that oriented matroid posets are given as matroidal nested systems of spheres satisfying a certain symmetry property. The paper is organized as follows: In Section 2 we will introduce sphere systems and some tools, in Section 3 we will present our main result and its proof. Section 4 proves that the axiom system for sphere systems can be weakened without loosing structure and in Section 5 we will present a lattice theoretical version of that result. We assume some familiarity with matroids and oriented matroids, standard references are [11] and [1]. Furthermore we will need some basic facts in elementary topology on an undergraduate course level (see e.g. [8]). 2 Basics and Denitions Why is it natural to consider sphere systems in the context of oriented matroids? Oriented matroids may be viewed as a combinatorial abstraction of ane hyperplane arrangements. The diculty with boundary eects of parallel ats as usual can be overcome by adding the hyperplane at innity, thus considering the situation projectively. One common denition of the projective space constructs it from the standard sphere by identifying antipodal points. The resulting space is not orientable which conicts intuition. We can avoid this by not doing the identication and considering the sphere as two-sided oriented projective space with the side eect that vector spaces become spheres. That way hyperplane arrangements \become hypersphere arrangements". Denition 1 Let S n := fx 2 IR n+1 j j kxk = 1g denote the n-dimensional standard sphere. If X S n is homeomorphic to S n?1, we call X a hypersphere of S n. The most important property of a hypersphere on a sphere for our purposes is given by the Jordan-Brouwer Separation Theorem (see e.g. [6]).
5 Basics and Denitions 3 Figure 1: The third step on the way to Alexander's horned sphere Theorem 1 (Jordan-Brouwer Separation Theorem) Any hypersphere H e of S n separates S n into exactly two disjoint domains of which it is the common boundary. Although combinatorially any hypersphere is, therefore, well-behaved, the components may have non-trivial topology (such spheres are called wild). Example 1 A rst example of a sphere wildly embedded into IR 3 was given by Alexander (see e.g [10]). The construction is done by the following iterative process. S 0 is a standard sphere, this sphere grows two horns which almost link to get S 1, each of these horn splits into two ngers which almost link and the pairs of ngers mesh thus forming S 2. Iterating this process we get uniform convergence towards a homeomorphic image S 1 of the sphere. The unbounded component of IR 3 ns 1 has non-trivial topology, it is not simply connected. A sketch of S 3 is given in Figure 1. For notational reasons it will be convenient given a hypersphere of S n to mark one of the two components of its complement. Denition 2 Let H e be a hypersphere of S n. Marking one of the two components of S n nh e to be the positive side H + e we get an oriented hypersphere. Let H? := e Sn n (H e [ H + ). We will use e H0 and H e e synonymously. Let H T = (H e ) e2e be a family of oriented hyperspheres of S n. If A E, we call T f2a H f the at of A. Furthermore we denote by cl (A) = fe 2 E j H e f2a H f g the closure of A. H is called a sphere system if
6 Basics and Denitions 4 (S1) All ats are topological spheres. (S2) The intersection of a at F with any oriented hypersphere H e 6 F, is a hypersphere H e \F of F, separating F into F + H + e and F? H? e. If s : E! f+;?; 0g is some map then we call a pseudo cell. \ e2e H s(e) e Remark 1 Note, that a pseudo cell is not necessarily homeomorphic to ball. The author does not even know whether it is always connected. Considering only hyperspheres which are tamely embedded, i.e. the two components of their complements are simply connected, the above axioms are known to dene a regular CW-complex the poset of which is isomorphic to the big face lattice of an oriented matroid (see [1]). Take a S hypersphere H f of such a tame sphere system and consider a cell Z of H f n e2enf H e. This cell will be in the boundary of two maximal cells T 1 and T 2. Now observe that given a cell decomposition of a standard S n -sphere embedded in IR n the modications of the sphere to get Alexander's horned sphere can be restricted to any maximal cell of that decomposition. Therefore, it is clear that we can have H f grow horns such that say T 2 is not simply connected anymore but neither the topology of any other cell changes nor any boundary relation changes. Nevertheless, it is not very surprising that we get a \pseudo cell complex" with the same poset as before. This will be made more precise later (see Denition 4). In other words it is immediate that there are oriented matroids \from" wild spheres. What we are going to prove in the following is that the above axiom system is strong enough to always guarantee an oriented matroid. Two minors of sphere systems are immediate. Lemma 1 Let H be a sphere system on a nite set E; A E; G = T e2a H e. Then 1. H ja := fh e 2 H j e 2 Ag, 2. H=A := ff(h e \ G) j e 2 E n Ag, where f : G! S d is a suitable homeomorphism are sphere systems. 2
7 Basics and Denitions 5 To prove that the pseudo cells of any sphere system give rise to the signed covectors of an oriented matroid we are going to use our result from [5]. There we showed that a map from a lattice to a geometric lattice is the zero map of an oriented matroid if and only if it is a symmetric antitonic folding. This result is quite technical. Therefore we cannot avoid making the following denitions. Denition 3 Let P be a nite partially ordered set. We say P is connected, if for any two elements a; b 2 P there is a path in the Hasse-Diagram from a to b. We say P is openly connected, if all open intervals with at least two comparable elements are connected. If I = [x; y] is an interval in a poset, the length of I is given by the number of elements in a maximum chain minus one. P has the diamond property, if each interval of length 2 consists of exactly four elements. A nite lattice R is a combinatorial d-manifold[3], if R is openly connected, R has length d + 2, R has the diamond property. If P is a poset and a < b 2 P, then b covers a, if for all c 2 P we have a c b only if a = c or b = c. We denote this by a < b or b > a. If P und R are JD-lattices of nite length and r(1i P ) = r(1i R ) + 1 then an antitonism is a map ' : P n f1i P g! R satisfying (a < b 2 P and b 6= 1I P ) =) '(a) > '(b), (a; b 2 P and a _ b 6= 1I P ) =) '(a _ b) = '(a) ^ '(b). Let P be a combinatorial d-manifold and L be a geometric lattice of rank d + 1. An antitonic folding ' is a surjective antitonism ' : P n f1i P g! L satisfying folding property: If [x; y] L is an interval of length 1 and b 2 '?1 (y), then there are exactly two elements a; a 0 2 P in the preimage of x covering b. In this situation we call the triple (a; b; a 0 ) a fold. local atness: If [x; y] L is an interval of length 2 and b 2 '?1 (y), then the Hasse-Diagram of the set fa 2 P j a > b und '(a) xg is connected. We say an antitonic folding (L; P; ') is symmetric, if for all folds a; 0; a 0 and any path a = a 0 ; a 1 ; : : : ; a n = a 0 in P n f1i P g we have: 80 < p 2 L 90 i n : p '(a i ).
8 Oriented Matroids from Wild Spheres 6 Theorem 2 ([5]) Let (L; P; ') be a symmetric antitonic folding. Then P is the big face lattice of an oriented matroid with ' for its zero-map. 3 Oriented Matroids from Wild Spheres While Theorem 2 actually characterizes reorientation classes of oriented matroids we could actually examine sphere systems without specied orientations. But since we provided each sphere in our system with an orientation the Separation Theorem of Jordan Brouwer immediately yields a unique signed vector X 2 2 E for each point p 2 S n und thus for each pseudo cell, rendering notation easier. Denition 4 A signed vector U on a nite set E is a map U : E! f0; +;?g. Instead of U(e) we will simply write U e. If U and V are signed vectors sep (U; V ) := fe 2 E j U e =?V e 6= 0g and supp (U) := U?1 (f+;?g). On signed vectors we have the partial order P:. X Y :, 8e 2 E : (X e 6= Y e ) X e = 0) We have a canonical right hand side for an antitonism: Lemma 2 The map cl satises the axioms of a matroid closure. Proof. By set inclusion we get an atomic nite lattice on the image of cl : 2 E! 2 E with the lattice operations supfa; Bg = cl (A[B) und inffa; Bg = A \ B = cl (A \ B) for two sets A; B in the image of cl. The rst half of Axiom (S2) implies that in this lattice L the following holds: If e 2 L is atomic and x 2 L such that e 6 x, then e _ x > x. Hence Theorem 3 implies that L is geometric. The lemma follows by the 1-1-correspondence between geometric lattices and simple matroids (see [11] 3.4.1). 2 Theorem 3 (see e.g. [11] Exercise 3.8) A nite, atomic lattice is geometric if and only if 8a 2 L 8 0 < p 2 L : (p 6 a ) a < a _ p): Thus cl provides us with the possibility to construct a map onto a geometric lattice. Before we give its denition we mention the following fact the easy verication of which is left to the reader.
9 Oriented Matroids from Wild Spheres 7 Proposition 1 Let H be a sphere system and X one of its signed vectors. Then cl (E n supp (X)) = E n supp (X). 2 Denition 5 For all X 2 P let '(X) := E n supp (X). By the above proposition ' is a map from some poset onto a geometric lattice. With the next lemma we prove that P is pure dimensional. Lemma 3 Let P be the poset of a sphere system. Then: 1. Each point of the pseudo cell 0 P is in the boundary of every component of S n n S e2e H e. 2. If x 2 S n with signed vector X, then for all Y 2 P: X Y, x is on the boundary of Y: 3. P satises the Jordan-Dedekind chain condition. 4. P is pure dimensional. Proof. 1: We proceed by induction on n = jej. The case n = 1 is clear by Jordan Brouwer Separation Theorem. Let n 2, and p 2 T e2e H e, let be a component of S n n S e2e H e and f 2 E. In the sphere system (H e ) e2enf there is a component 0 of S n n S e2enf H e such that 0. If 0 = we are done. Otherwise the intersection of the boundary of with H f is non-empty and thus contains a component of H f n S e2enf H e. By inductive assumption p is in the boundary of. Since is contained all in the boundary of, the claim follows. 2:and 3: The backward implication of 2) is obvious. Considering the statement of 3) we rst remark that each pseudo cell dierent from 0 P is a relatively open proper subset of the minimal at containing it. Hence the dimension of a pseudo cell is well dened. Instead of 3) we may thus prove that X Y and Y covers X then dim(x) = dim(y )? 1. To verify suciency of 2) and to prove 3) we proceed by induction on n = jsupp (X)j. The case n = 0 is clear from the rst claim of this lemma. Thus let f 2 supp (X) 6= ;. Hence, let X 0 ; Y 0 denote the
10 Oriented Matroids from Wild Spheres 8 pseudo cells of (H e ) e2enf, containing X resp. Y. Necessarily we must have dim(x 0 ) = dim(x) and dim(y 0 ) = dim(y ). If Y 0 still covers X 0 we are done since 2) follows from the fact for all x 2 X there is some suciently small neighborhood intersecting Y 0 only in points of Y. Therefore, assume there is some Z 0 such that X 0 Z 0 Y 0. Since Y covers X no point of Z 0 must be on the same side of H f than any point of X, contradicting the fact that each point of X must be on the boundary of Z 0. Note, that in fact we proved that the rank function of P satises 8X 2 P : r(x) = dim(x) + dim(0 P ). 4: This is immediate from the above and the fact each point which is not an interior point of a full dimensional pseudo cell is in the boundary of some full dimensional pseudo cell. The following is a direct consequence of the denition of a sphere system. Lemma 4 Let H = (H e ) e2e be a sphere system, X a signed vector of the corresponding partial order P and '(X) = A. The partial order of H=A is isomorphic to the order ideal generated by '?1 (A). 2 2 The other minor is also compatible with the partial order. Lemma 5 Let H = (H e ) e2e be a sphere system, X one of its signed vectors and A = '(X). The partial order of H ja is isomorphic to the lter generated by X in P. Proof. It suces to verify that V is a signed vector of H ja if and only if (X; V ) is a signed vector of P (where (X; V ) denotes the signed vector satisfying (X; V ) jsupp (X) = X jsupp (X) and (X; V ) ja = V ). The non-trivial implication is suciency. This is done by induction on n = jej. The case n = 0 is clear, thus T let n > 0. If '(V ja ) 6= ;, then V as well as X are contained in the sphere e2'(v ja ) H e, and the claim follows from inductive hypothesis and Lemma 4. So we may assume '(V ja ) = ; and V 6= 0 and choose a signed vector W of H ja such that W V and V covers W. Let f 2 supp (V ) n supp (W ): By inductive hypothesis applied to H=f and Lemma 4, (X; W ) is a signed vector of P. By Jordan Brouwer Separation Theorem S n is separated into two components by H f. The point set corresponding to (X; W ) is a full dimensional open subset of the point
11 Oriented Matroids from Wild Spheres 9 set with vector W in H ja, which is in the boundary of V (Lemma 4). In any neighborhood of a point in (X; W ) there have to be points of V with coordinates (X; V ) with respect to the original system. 2 Recall that the denition of an antitonism requires the domain of the map to be a lattice where the top element has been removed. Therefore we have to verify that P [ 1I P is a lattice. First we show the existence of non-trivial joins, i.e. those which are not equal to 1I P. Lemma 6 Assume X; Y are pseudo cells of a sphere system H such that sep (X; Y ) = ;. Then there is a pseudo cell Z in the sphere system satisfying Z jsupp (X) = X jsupp (X), Z jsupp (Y ) = Y jsupp (Y ) and supp (Z) = supp (X) [ supp (Y ). Proof. We proceed by induction on n = jej the case n = 1 being trivial. Thus let n > 1. If supp (X) [ supp (Y ) E the claim follows immediately from inductive assumption and Lemma 4. We may assume that there is an f 2 E : X f 6= 0 = Y f. In the sphere system H n f all points of Y belong to the same pseudo cell Y 0. By inductive assumtion applied to a H n f there is a pseudo cell Z ~ which is as desired with respect to X n f and Y 0. The claim now again follows from the fact that any point in the pseudo cell X has suciently small neighborhood not intersecting H f. 2 Now we are prepared to prove Lemma 7 ^P is a lattice and a combinatorial manifold. Proof. According to Lemma 3 P is pure dimensional. To verify the remaining conditions we proceed by induction on the dimension d of ^P. d = 1 The only possible partial order is the diamond satisfying all conditions. d = 2 The poset of any such sphere system must be the pseudo cell complex of an even cycle. d > 2 Since T e2e H e separates S n only if it is a hypersphere, Lemmas 4 and 5 and inductive hypothesis imply that open connectivity and the diamond property are satised. We are left to verify that P is a lattice. Thus let U be a lower bound for X 1 ; X 2 2 P. Let A = cl (sep (X 1 ; X 2 )[('(X 1 )['(X 2 T )). The subset M S n with signed vector U has to be part of F = e2a H e : Thus Lemma 6 guarantees the existence of a unique maximal lower bound.
12 The Crossing Property 10 Since the meet of two upper bounds always is an upper bound again, we are done. 2 Next we are going to verify the properties of '. Lemma 8 The map ' : P! L is an antitonic folding. Proof. We have already proven that ' is an order reversing, cover preserving surjection from a combinatorial manifold onto a geometric lattice. Consider a pseudo cell X being the join of X 1 and X 2. Lemma 6 guarantees that if X 1 _ X 2 6= 1I P we have '(X 1 _ X 2 ) = '(X 1 ) ^ '(X 2 ). The validity of the folding property and local atness follows from Lemmas 4 and 5 and the observations in the proof of the last lemma. 2 Theorem 4 The set of signed vectors given by a sphere system is the set of signed covectors of an an oriented matroid. Proof. The symmetry of the antitonic folding is immediate from the Jordan Brouwer Separation Theorem since the two pseudo cells of any minimal nonzero signed vector must be separated by each sphere not containing them. 2 4 The Crossing Property Considering the results of the last section in more detail we nd that axiom (S2) splits into two conditions. (S2a) If F 6 H 0 e is a at then F \ H0 e is a hypersphere of F. (S2b) Under the assumptions of (S2a) the components of F n H 0 e dierent sides of H 0. e are on To prove that the map ' is an antitonic folding condition (S2b) (which Edmonds called the crossing property) was not used at all. It was needed only to prove the symmetry. As it is known that, given a matroid, a cocircuit signature is an oriented matroid cocircuit signature i the signed cocircuit elimination axiom is satised for modular pairs of cocircuits one might ask whether it is possible
13 Shellable Spheres and Lattices 11 to restrict condition (S2b) to the cases where F is 1-dimensional. It is immediately clear that this way we always will get a proper oriented matroid cocircuit sign pattern on the 0-dimensional cells. But our above examinations actually yield the following stronger result. Theorem 5 Let H = (H e ) e2e be a nite family of hyperspheres of S n. Then H is a sphere system if and only if (S1) For all A E T e2a H e is a topological sphere. (S2 0 a) The map cl : 2 E! 2 E, given by cl (A) = fe 2 E j H e T f2a H f g is a matroid closure and its rank function satises: r(a) = n?dim( T e2a H e ). (S2 0 b): If X; Y are copoints of M(E; cl ) such that X ^ Y is a coline then the two components of \ e2x H e lie in dierent components of \ \ H e n e2x^y e2y H e Proof. In Lemma 2 we proved that a sphere system satises (S2 0 a). Since (S2 0 b) is a special case of (S2b) it is clear that any sphere system satises the above axioms. On the other hand the proofs in the last section showed that a nite family of hyperspheres of S n satisfying (S1) and (S2 0 a) canonically induces an antitonic folding. Assume this folding were not symmetric and there were some copoint X 2 L and an atom e 2 L such that there exists a path in P n 0 P between the two preimages of X missing e. Clearly we must have X 6= 0 L and, therefore we may choose some coline G 2 L which is covered by X. Now X and Y := G _ e contradict (S2 0 b). 2 5 Shellable Spheres and Lattices To get a lattice-theoretical characterization of oriented matroids similar to Theorem 2 from the above it is necessary to review some facts from combinatorial topology. The required material is completely covered by the Appendix 4.7 from [1]. The following denition is a lattice-theoretical counterpart of shellability of regular cell complexes.
14 Shellable Spheres and Lattices 12 Denition 6 (cf. [1] ) Let P be a nite lattice with rank funktion. A linear ordering x 1 ; : : : ; x t of its coatoms is a recursive coatom ordering if either r(1 P ) 2, or if r(1 P ) > 2 and for all 1 j t 1. [x j ], the ideal generated by x j has a recursive coatom ordering y 1 ; : : : ; y s and 2. there is an 1 k s such that [x j ] \ Si<j[x i ] = S ik[y i ]: The notion of recursive coatom ordering is important for us since the big face lattice of an oriented matroid admits a recursive coatom ordering and the following Theorem therefore allows to construct, given an oriented matroid O, a sphere systems which is a topological model for O. Theorem 6 (cf. [1] ) Let P be a nite lattice with rank function r and r(1 L ) = d + 2. Then P is isomorphic to the face poset of some shellable regular cell decomposition of the d-sphere if and only if it has the diamond property and admits a recursive coatom ordering. Furthermore is uniquely determined by P up to cellular homeomorphism. Denition 7 A matroidal sphere lattice is a tripel (L; P; ), where L is a geometric lattice, P is a poset and is a surjective map : P! L satisfying 1. 8p; q 2 P : (p > q =) (q) > (p)), 2. 8x 2 L :?1 ([x; 1I L ]) with a top element 1?1 ([x;1i L ] admits a recursive coatom ordering and has the diamond property. It is well known that given the big face lattice P of an oriented matroid, L the geometric lattice of the underlying matroid and ' the zero map then the tripel (L; P; ) satises the above conditions. In the following we will prove that vice versa any matroidal sphere lattice arises from an oriented matroid this way. By the above theorem, given a matroidal sphere lattice (L; P; ) P has a topological realization ^F() as a regular cell decomposition of the sphere. Let isom denote the isomorphism from to P and ' = isom. By Theorem 6 we have that for all atoms of e 2 L the space k'?1 ([e; 1 L ])k is a hypersphere H e of kk. Denote by E the set of all atoms of L and let A E. Then \ \ H e = k'?1 ([e; 1])k (1) e2e e2a
15 Shellable Spheres and Lattices 13 = kisom?1 ( \ e2a?1 ([e; 1]))k (2) = kisom?1 (fz 2 P j 8e 2 A : _ (Z) eg)k (3) = kisom?1 (fz 2 P j (Z) eg)k (4) _ e2a = k'?1 ( e)gk: (5) e2a Therefore, the collection of spheres (H e ) e2e satises (S1). A similar computation veries that (S2 0 a) holds as well. Obviously (S2 0 b) will not be valid without further assumptions. This is easily seen on a rank 2 example. But (S2 0 b) is easily translated into our lattice theoretical notation. Denition 8 A matroidal sphere lattice (L; P; ) is symmetric, if for all copoints X 2 L and all colines G 2 L such that X covers G we have?1 ([G; 1 L ]) n?1 ([X; 1 L ]) consists of two connected components of the same cardinality. Theorem 7 Let (L; P; ') be a symmetric matroidal sphere lattice. Then P is the partial order of an oriented matroid and ' is its zero map. Proof. By the above remarks we are left to verify that (S2 0 b) holds. Assume to the contrary that X; Y are copoints of M(E; cl ) such that X ^Y is a coline and the two components of \ e2x H e were in the same component of \ \ H e n e2x^y e2y H e : Consider the two components A 1 ; A 2 of?1 ([X ^ Y; 1 L ]) n?1 ([X; 1 L ]). By symmetry they have the same cardinality. Now let B 1 and B 2 denote the two components of?1 ([X ^ Y; 1 L ]) n?1 ([Y; 1 L ]). By assumption wlog. A 1 B 1 and thus B 2 A 2 and we get ja 1 j < jb 1 j = jb 2 j < ja 2 j contradicting symmetry. 2
16 REFERENCES 14 References [1] A. Bjorner, M. Las Vergnas, B. Sturmfels, N. White, G. Ziegler: Oriented Matroids. Cambridge, [2] R. G. Bland and M. Las Vergnas: Orientability of Matroids Journal of Combinatorial Theory, Series B (1978) [3] R. Cordovil and K. Fukuda: Oriented Matroids and Combinatorial Manifolds Working Paper CNRS Paris (1987) [4] W. Hochstattler: Seitenachenverbande orientierter Matroide Dissertation Universitat zu Koln, [5] W. Hochstattler: A lattice-theoretical characterization of oriented matroids submitted to: European Journal of Combinatorics. [6] J.G. Hocking and G.S. Young: Topology, Addison Wesley, London [7] J. Folkman and J. Lawrence: Oriented Matroids Journal of Combinatorial Theory, Series B (1978) [8] L.C. Kinsey: Topology of Surfaces, Springer Verlag, New York [9] A. Mandel: Topology of Oriented Matroids Ph.D. Thesis University of Waterloo (1982) [10] T. B. Rushing: Topological Embeddings Academic Press New York and London [11] N. White (ed.): Theory of Matroids. Cambridge, 1986.
Diskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: On the Chromatic Number of an Oriented Matroid Technical Report feu-dmo007.07 Contact: winfried.hochstaettler@fernuni-hagen.de
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: Joins of Oriented Matroids Technical Report feu-dmo009.07 Contact: winfried.hochstaettler@fernuni-hagen.de robert.nickel@fernuni-hagen.de
More informationA Topological Representation Theorem for Oriented Matroids
Smith ScholarWorks Computer Science: Faculty Publications Computer Science 4-2005 A Topological Representation Theorem for Oriented Matroids Jürgen Bokowski Technische Universitat Darmstadt Simon King
More informationarxiv: v1 [math.co] 25 Jun 2014
THE NON-PURE VERSION OF THE SIMPLEX AND THE BOUNDARY OF THE SIMPLEX NICOLÁS A. CAPITELLI arxiv:1406.6434v1 [math.co] 25 Jun 2014 Abstract. We introduce the non-pure versions of simplicial balls and spheres
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Steffen Hitzemann and Winfried Hochstättler: On the Combinatorics of Galois Numbers Technical Report feu-dmo012.08 Contact: steffen.hitzemann@arcor.de, winfried.hochstaettler@fernuni-hagen.de
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationLECTURE 3 Matroids and geometric lattices
LECTURE 3 Matroids and geometric lattices 3.1. Matroids A matroid is an abstraction of a set of vectors in a vector space (for us, the normals to the hyperplanes in an arrangement). Many basic facts about
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationKnowledge spaces from a topological point of view
Knowledge spaces from a topological point of view V.I.Danilov Central Economics and Mathematics Institute of RAS Abstract In this paper we consider the operations of restriction, extension and gluing of
More informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationTHE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection
More informationALGEBRAIC PROPERTIES OF BIER SPHERES
LE MATEMATICHE Vol. LXVII (2012 Fasc. I, pp. 91 101 doi: 10.4418/2012.67.1.9 ALGEBRAIC PROPERTIES OF BIER SPHERES INGA HEUDTLASS - LUKAS KATTHÄN We give a classification of flag Bier spheres, as well as
More informationRevisiting Poincaré's Theorem on presentations of discontinuous groups via fundamental polyhedra
Revisiting Poincaré's Theorem on presentations of discontinuous groups via fundamental polyhedra E. Jespers a, A. Kiefer a, Á. del Río b a Department of Mathematics, Vrije Universiteit Brussel, Pleinlaan
More informationINTRODUCTION TO NETS. limits to coincide, since it can be deduced: i.e. x
INTRODUCTION TO NETS TOMMASO RUSSO 1. Sequences do not describe the topology The goal of this rst part is to justify via some examples the fact that sequences are not sucient to describe a topological
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationDISKRETE MATHEMATIK UND OPTIMIERUNG
DISKRETE MATHEMATIK UND OPTIMIERUNG Immanuel Albrecht and Winfried Hochstättler: Lattice Path Matroids Are 3-Colorable Technical Report feu-dmo039.15 Contact: immanuel.albrechtfernuni-hagen.de, winfried.hochstaettler@fernuni-hagen.de
More informationLehrstuhl für Mathematische Grundlagen der Informatik
Lehrstuhl für Mathematische Grundlagen der Informatik W. Hochstättler, J. Nešetřil: Antisymmetric Flows in Matroids Technical Report btu-lsgdi-006.03 Contact: wh@math.tu-cottbus.de,nesetril@kam.mff.cuni.cz
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationAn Arrangement of Pseudocircles Not Realizable With Circles
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 46 (2005), No. 2, 351-356. An Arrangement of Pseudocircles Not Realizable With Circles Johann Linhart Ronald Ortner Institut
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationSemimatroids and their Tutte polynomials
Semimatroids and their Tutte polynomials Federico Ardila Abstract We define and study semimatroids, a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We
More informationarxiv:math/ v1 [math.co] 3 Sep 2000
arxiv:math/0009026v1 [math.co] 3 Sep 2000 Max Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department San Francisco State University San Francisco, CA 94132 sergei@sfsu.edu
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationBEN KNUDSEN. Conf k (f) Conf k (Y )
CONFIGURATION SPACES IN ALGEBRAIC TOPOLOGY: LECTURE 2 BEN KNUDSEN We begin our study of configuration spaces by observing a few of their basic properties. First, we note that, if f : X Y is an injective
More informationON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM
ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM ALEXANDER KUPERS Abstract. These are notes on space-filling curves, looking at a few examples and proving the Hahn-Mazurkiewicz theorem. This theorem
More informationQuantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en
Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for enlargements with an arbitrary state space. We show in
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler: Oriented Matroids - From Matroids and Digraphs to Polyhedral Theory Technical Report feu-dmo024.10 Contact: winfried.hochstaettler@fernuni-hagen.de
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationCharacterizations of the finite quadric Veroneseans V 2n
Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our
More informationZaslavsky s Theorem. As presented by Eric Samansky May 11, 2002
Zaslavsky s Theorem As presented by Eric Samansky May, 2002 Abstract This paper is a retelling of the proof of Zaslavsky s Theorem. For any arrangement of hyperplanes, there is a corresponding semi-lattice
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
More informationMath 203A, Solution Set 6.
Math 203A, Solution Set 6. Problem 1. (Finite maps.) Let f 0,..., f m be homogeneous polynomials of degree d > 0 without common zeros on X P n. Show that gives a finite morphism onto its image. f : X P
More informationThe topology of the external activity complex of a matroid
The topology of the external activity complex of a matroid Federico Ardila Federico Castillo José Alejandro Samper Abstract We prove that the external activity complex Act < (M) of a matroid is shellable.
More informationJ. Huisman. Abstract. let bxc be the fundamental Z=2Z-homology class of X. We show that
On the dual of a real analytic hypersurface J. Huisman Abstract Let f be an immersion of a compact connected smooth real analytic variety X of dimension n into real projective space P n+1 (R). We say that
More informationCW complexes. Soren Hansen. This note is meant to give a short introduction to CW complexes.
CW complexes Soren Hansen This note is meant to give a short introduction to CW complexes. 1. Notation and conventions In the following a space is a topological space and a map f : X Y between topological
More informationCW-complexes. Stephen A. Mitchell. November 1997
CW-complexes Stephen A. Mitchell November 1997 A CW-complex is first of all a Hausdorff space X equipped with a collection of characteristic maps φ n α : D n X. Here n ranges over the nonnegative integers,
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
More information121B: ALGEBRAIC TOPOLOGY. Contents. 6. Poincaré Duality
121B: ALGEBRAIC TOPOLOGY Contents 6. Poincaré Duality 1 6.1. Manifolds 2 6.2. Orientation 3 6.3. Orientation sheaf 9 6.4. Cap product 11 6.5. Proof for good coverings 15 6.6. Direct limit 18 6.7. Proof
More informationMath 396. Bijectivity vs. isomorphism
Math 396. Bijectivity vs. isomorphism 1. Motivation Let f : X Y be a C p map between two C p -premanifolds with corners, with 1 p. Assuming f is bijective, we would like a criterion to tell us that f 1
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationgrowth rates of perturbed time-varying linear systems, [14]. For this setup it is also necessary to study discrete-time systems with a transition map
Remarks on universal nonsingular controls for discrete-time systems Eduardo D. Sontag a and Fabian R. Wirth b;1 a Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, b sontag@hilbert.rutgers.edu
More informationLecture 4: Knot Complements
Lecture 4: Knot Complements Notes by Zach Haney January 26, 2016 1 Introduction Here we discuss properties of the knot complement, S 3 \ K, for a knot K. Definition 1.1. A tubular neighborhood V k S 3
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdor t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the (algebraic)
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationCHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998
CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More information14 Lecture 14: Basic generallities on adic spaces
14 Lecture 14: Basic generallities on adic spaces 14.1 Introduction The aim of this lecture and the next two is to address general adic spaces and their connection to rigid geometry. 14.2 Two open questions
More information3. The Sheaf of Regular Functions
24 Andreas Gathmann 3. The Sheaf of Regular Functions After having defined affine varieties, our next goal must be to say what kind of maps between them we want to consider as morphisms, i. e. as nice
More informationCORES OF ALEXANDROFF SPACES
CORES OF ALEXANDROFF SPACES XI CHEN Abstract. Following Kukie la, we show how to generalize some results from May s book [4] concerning cores of finite spaces to cores of Alexandroff spaces. It turns out
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationFaithful embedding on finite orders classes
Faithful embedding on finite orders classes Alain Guillet Jimmy Leblet Jean-Xavier Rampon Abstract We investigate, in the particular case of finite orders classes, the notion of faithful embedding among
More informationA NEW LINDELOF SPACE WITH POINTS G δ
A NEW LINDELOF SPACE WITH POINTS G δ ALAN DOW Abstract. We prove that implies there is a zero-dimensional Hausdorff Lindelöf space of cardinality 2 ℵ1 which has points G δ. In addition, this space has
More informationReid 5.2. Describe the irreducible components of V (J) for J = (y 2 x 4, x 2 2x 3 x 2 y + 2xy + y 2 y) in k[x, y, z]. Here k is algebraically closed.
Reid 5.2. Describe the irreducible components of V (J) for J = (y 2 x 4, x 2 2x 3 x 2 y + 2xy + y 2 y) in k[x, y, z]. Here k is algebraically closed. Answer: Note that the first generator factors as (y
More informationCHAPTER 9. Embedding theorems
CHAPTER 9 Embedding theorems In this chapter we will describe a general method for attacking embedding problems. We will establish several results but, as the main final result, we state here the following:
More informationThe nite submodel property and ω-categorical expansions of pregeometries
The nite submodel property and ω-categorical expansions of pregeometries Marko Djordjevi bstract We prove, by a probabilistic argument, that a class of ω-categorical structures, on which algebraic closure
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationBlocks and 2-blocks of graph-like spaces
Blocks and 2-blocks of graph-like spaces von Hendrik Heine Masterarbeit vorgelegt der Fakultät für Mathematik, Informatik und Naturwissenschaften der Universität Hamburg im Dezember 2017 Gutachter: Prof.
More informationON INJECTIVE HOMOMORPHISMS BETWEEN TEICHM ULLER MODULAR GROUPS NIKOLAI V. IVANOV AND JOHN D. MCCARTHY. February 24, 1995
ON INJECTIVE HOMOMORPHISMS BETWEEN TEICHM ULLER MODULAR GROUPS NIKOLAI V. IVANOV AND JOHN D. MCCARTHY February 24, 1995 Abstract. In this paper we prove that injective homomorphisms between Teichmuller
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationAlgebraic Varieties. Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra
Algebraic Varieties Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra Algebraic varieties represent solutions of a system of polynomial
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationChapter 2 Linear Transformations
Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more
More informationalgebras Sergey Yuzvinsky Department of Mathematics, University of Oregon, Eugene, OR USA August 13, 1996
Cohomology of the Brieskorn-Orlik-Solomon algebras Sergey Yuzvinsky Department of Mathematics, University of Oregon, Eugene, OR 97403 USA August 13, 1996 1 Introduction Let V be an ane space of dimension
More informationGROUPS DEFINABLE IN O-MINIMAL STRUCTURES
GROUPS DEFINABLE IN O-MINIMAL STRUCTURES PANTELIS E. ELEFTHERIOU Abstract. In this series of lectures, we will a) introduce the basics of o- minimality, b) describe the manifold topology of groups definable
More informationIndependence of Boolean algebras and forcing
Annals of Pure and Applied Logic 124 (2003) 179 191 www.elsevier.com/locate/apal Independence of Boolean algebras and forcing Milos S. Kurilic Department of Mathematics and Informatics, University of Novi
More informationSYZYGIES OF ORIENTED MATROIDS
DUKE MATHEMATICAL JOURNAL Vol. 111, No. 2, c 2002 SYZYGIES OF ORIENTED MATROIDS ISABELLA NOVIK, ALEXANDER POSTNIKOV, and BERND STURMFELS Abstract We construct minimal cellular resolutions of squarefree
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdor t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the (algebraic)
More informationA Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids
Journal of Algebraic Combinatorics 12 (2000), 295 300 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. A Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids WINFRIED HOCHSTÄTTLER
More information1 The Erdős Ko Rado Theorem
1 The Erdős Ko Rado Theorem A family of subsets of a set is intersecting if any two elements of the family have at least one element in common It is easy to find small intersecting families; the basic
More informationne varieties (continued)
Chapter 2 A ne varieties (continued) 2.1 Products For some problems its not very natural to restrict to irreducible varieties. So we broaden the previous story. Given an a ne algebraic set X A n k, we
More informationComputability of Heyting algebras and. Distributive Lattices
Computability of Heyting algebras and Distributive Lattices Amy Turlington, Ph.D. University of Connecticut, 2010 Distributive lattices are studied from the viewpoint of effective algebra. In particular,
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler Michael Wilhelmi: Sticky matroids and Kantor s Conjecture Technical Report feu-dmo044.17 Contact: {Winfried.Hochstaettler, Michael.Wilhelmi}@fernuni-hagen.de
More informationA multiplicative deformation of the Möbius function for the poset of partitions of a multiset
Contemporary Mathematics A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Patricia Hersh and Robert Kleinberg Abstract. The Möbius function of a partially ordered
More information1. Affine Grassmannian for G a. Gr Ga = lim A n. Intuition. First some intuition. We always have to rst approximation
PROBLEM SESSION I: THE AFFINE GRASSMANNIAN TONY FENG In this problem we are proving: 1 Affine Grassmannian for G a Gr Ga = lim A n n with A n A n+1 being the inclusion of a hyperplane in the obvious way
More informationDISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph called c-orientations. Given a distributive
More informationTHE JORDAN-BROUWER SEPARATION THEOREM
THE JORDAN-BROUWER SEPARATION THEOREM WOLFGANG SCHMALTZ Abstract. The Classical Jordan Curve Theorem says that every simple closed curve in R 2 divides the plane into two pieces, an inside and an outside
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationMultiplicative Conjunction and an Algebraic. Meaning of Contraction and Weakening. A. Avron. School of Mathematical Sciences
Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening A. Avron School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel Abstract
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationCHEVALLEY S THEOREM AND COMPLETE VARIETIES
CHEVALLEY S THEOREM AND COMPLETE VARIETIES BRIAN OSSERMAN In this note, we introduce the concept which plays the role of compactness for varieties completeness. We prove that completeness can be characterized
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationCOMPLEX VARIETIES AND THE ANALYTIC TOPOLOGY
COMPLEX VARIETIES AND THE ANALYTIC TOPOLOGY BRIAN OSSERMAN Classical algebraic geometers studied algebraic varieties over the complex numbers. In this setting, they didn t have to worry about the Zariski
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationEffectiveness for embedded spheres and balls
Electronic Notes in Theoretical Computer Science 66 No. 1 (2003) URL: http://www.elsevier.nl/locate/entcs/volume66.html 12 pages Effectiveness for embedded spheres and balls Joseph S. Miller 1 Department
More informationLecture Notes on Oriented Matroids and Geometric Computation
Lecture Notes on Oriented Matroids and Geometric Computation Komei Fukuda Institute for Operations Research ETH Zurich, Switzerland fukuda@ifor.math.ethz.ch http://www.ifor.math.ethz.ch/ fukuda/fukuda.html
More informationTOPOLOGY TAKE-HOME CLAY SHONKWILER
TOPOLOGY TAKE-HOME CLAY SHONKWILER 1. The Discrete Topology Let Y = {0, 1} have the discrete topology. Show that for any topological space X the following are equivalent. (a) X has the discrete topology.
More informationSpanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More information