
An Introduction to Topological Groups
... Example 2.8. In R with the Euclidean topology, the set [0, 1] is closed. This is because R \ [0, 1] = (−∞, 0) ∪ (1, ∞), which is the union of two open intervals. Example 2.9. In (X, P(X)) every subset of X is closed. This is the case because for any F ⊂ X we have X \ F ∈ P(X). Given a topological sp ...
... Example 2.8. In R with the Euclidean topology, the set [0, 1] is closed. This is because R \ [0, 1] = (−∞, 0) ∪ (1, ∞), which is the union of two open intervals. Example 2.9. In (X, P(X)) every subset of X is closed. This is the case because for any F ⊂ X we have X \ F ∈ P(X). Given a topological sp ...
PDF
... The cofinite topology on a set X is defined to be the topology T where T = {A ⊆ X | X \ A is finite, or A = ∅}. In other words, the closed sets in the cofinite topology are X and the finite subsets of X. Analogously, the cocountable topology on X is defined to be the topology in which the closed set ...
... The cofinite topology on a set X is defined to be the topology T where T = {A ⊆ X | X \ A is finite, or A = ∅}. In other words, the closed sets in the cofinite topology are X and the finite subsets of X. Analogously, the cocountable topology on X is defined to be the topology in which the closed set ...
FINITE TOPOLOGICAL SPACES 1. Introduction: finite spaces and
... Theorem 2.13. The homeomorphism classes of finite spaces are in bijective correspondence with M . The number of sets in a minimal basis for X determines the size of the corresponding matrix, and the trace of the matrix is the number of elements of X. Proof. We work with minimal bases for the topolog ...
... Theorem 2.13. The homeomorphism classes of finite spaces are in bijective correspondence with M . The number of sets in a minimal basis for X determines the size of the corresponding matrix, and the trace of the matrix is the number of elements of X. Proof. We work with minimal bases for the topolog ...
NEARLY CONTINUOUS MULTIFUNCTIONS 1. Introduction Strong
... (i)⇔(iii). Let x ∈ F − (V ) and let V be an open set having N-closed complement. From (i), there exists an open set U containing x such that U ⊆ F − (V ). It follows that x ∈ int(F − (V )) and (iii) holds. The converse can be shown easily. (iii)⇔(iv). Since F − (co(V )) = co(F + (V )) and F + (co(V ...
... (i)⇔(iii). Let x ∈ F − (V ) and let V be an open set having N-closed complement. From (i), there exists an open set U containing x such that U ⊆ F − (V ). It follows that x ∈ int(F − (V )) and (iii) holds. The converse can be shown easily. (iii)⇔(iv). Since F − (co(V )) = co(F + (V )) and F + (co(V ...
Brouwer fixed-point theorem

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after Luitzen Brouwer. It states that for any continuous function f mapping a compact convex set into itself there is a point x0 such that f(x0) = x0. The simplest forms of Brouwer's theorem are for continuous functions f from a closed interval I in the real numbers to itself or from a closed disk D to itself. A more general form than the latter is for continuous functions from a convex compact subset K of Euclidean space to itself.Among hundreds of fixed-point theorems, Brouwer's is particularly well known, due in part to its use across numerous fields of mathematics.In its original field, this result is one of the key theorems characterizing the topology of Euclidean spaces, along with the Jordan curve theorem, the hairy ball theorem and the Borsuk–Ulam theorem.This gives it a place among the fundamental theorems of topology. The theorem is also used for proving deep results about differential equations and is covered in most introductory courses on differential geometry.It appears in unlikely fields such as game theory. In economics, Brouwer's fixed-point theorem and its extension, the Kakutani fixed-point theorem, play a central role in the proof of existence of general equilibrium in market economies as developed in the 1950s by economics Nobel prize winners Kenneth Arrow and Gérard Debreu.The theorem was first studied in view of work on differential equations by the French mathematicians around Poincaré and Picard.Proving results such as the Poincaré–Bendixson theorem requires the use of topological methods.This work at the end of the 19th century opened into several successive versions of the theorem. The general case was first proved in 1910 by Jacques Hadamard and by Luitzen Egbertus Jan Brouwer.