
Toposym 4-B - DML-CZ
... Example 4« Consider a subspace L of a unit interval [0fl] defined by the equality L • [Ofl]\[n' n=l f 2,...}. The space L is neither bicompact nor connected, but it is a cb-space# Example ft« Modify the previous example taking for base on the set [0fl]\{&: n » l f 2 f # # # } all sets open in L and ...
... Example 4« Consider a subspace L of a unit interval [0fl] defined by the equality L • [Ofl]\[n' n=l f 2,...}. The space L is neither bicompact nor connected, but it is a cb-space# Example ft« Modify the previous example taking for base on the set [0fl]\{&: n » l f 2 f # # # } all sets open in L and ...
Burnside`s Theorem - Oregon State Mathematics Department
... order. Note that when discussing an abstract group G, it is common to use juxtaposition to indicate the group’s operation. Furthermore, if a group G has the operation +, we use the conventional notation of 0 for the identity element and −g for the inverse of g ∈ G. You are probably already familiar ...
... order. Note that when discussing an abstract group G, it is common to use juxtaposition to indicate the group’s operation. Furthermore, if a group G has the operation +, we use the conventional notation of 0 for the identity element and −g for the inverse of g ∈ G. You are probably already familiar ...
MIXED SUMS OF SQUARES AND TRIANGULAR NUMBERS (III)
... a sum of two squares and a triangular number. This is remarkable since there are infinitely many natural numbers which cannot be written as a sum of three squares. According to [D, p. 24], E. Lionnet stated, and V. A. Lebesgue [L] and M. S. Réalis [R] showed that n is also a sum of two triangular n ...
... a sum of two squares and a triangular number. This is remarkable since there are infinitely many natural numbers which cannot be written as a sum of three squares. According to [D, p. 24], E. Lionnet stated, and V. A. Lebesgue [L] and M. S. Réalis [R] showed that n is also a sum of two triangular n ...
spaces of countable and point-countable type
... assume that X^ßX. The first equivalence in part (a) is well known, and the second is trivial. The first equivalence in part (b) is the definition of complete space, and the second is trivial. The proof of part (c) follows from [5, Theorem 3.6, p. 98] which states that a space X is of countable type ...
... assume that X^ßX. The first equivalence in part (a) is well known, and the second is trivial. The first equivalence in part (b) is the definition of complete space, and the second is trivial. The proof of part (c) follows from [5, Theorem 3.6, p. 98] which states that a space X is of countable type ...
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.