
A Subrecursive Refinement of the Fundamental Theorem of Algebra
... Fk defined by Γ (f¯)(x1 , . . . , xk ) = Γ0 (f¯)(Γ1 (f¯)(x1 , . . . , xk ), . . . , Γm (f¯)(x1 , . . . , xk )), then Γ is also an E 2 -computable operator. 4. Whenever Γ0 is an E 2 -computable operator from F n into Fm , Γ1 is an E 2 computable operator from F n into Fm+2 , Γ2 is an E 2 -computable o ...
... Fk defined by Γ (f¯)(x1 , . . . , xk ) = Γ0 (f¯)(Γ1 (f¯)(x1 , . . . , xk ), . . . , Γm (f¯)(x1 , . . . , xk )), then Γ is also an E 2 -computable operator. 4. Whenever Γ0 is an E 2 -computable operator from F n into Fm , Γ1 is an E 2 computable operator from F n into Fm+2 , Γ2 is an E 2 -computable o ...
Combinatorial Equivalence Versus Topological Equivalence
... work of Stallings [13] related to this question, also. A weaker question may be asked, which, in the light of Theorem 6.1, is relevant. Are there two combinatorial imbeddings f,g:S,-2_Sm such that these bounded complements M, Mg c S'" have the same homotopy type but distinct simple homotopy type? Fi ...
... work of Stallings [13] related to this question, also. A weaker question may be asked, which, in the light of Theorem 6.1, is relevant. Are there two combinatorial imbeddings f,g:S,-2_Sm such that these bounded complements M, Mg c S'" have the same homotopy type but distinct simple homotopy type? Fi ...
1. (a) Let X be a topological space and γ 0,γ1 : [0
... (b) What does it mean to say that two topological spaces are homotopy equivalent? ...
... (b) What does it mean to say that two topological spaces are homotopy equivalent? ...
Pythagorean Theorem
... • A rational number can have a rational or irrational sq. rt. • An irrational number can only have an irrational root. Aim: Pythagorean Theorem ...
... • A rational number can have a rational or irrational sq. rt. • An irrational number can only have an irrational root. Aim: Pythagorean Theorem ...
The computer screen: a rectangle with a finite number of points
... It has long been known that each compact T2 space is the T2 reflection (“largest” T2 continuous image) of an inverse limit of finite T0 -spaces ([Fl], [KW1]). The next diagram suggests such a way to approximate the unit interval by finite spaces. Its top horizontal line represents the unit interval, ...
... It has long been known that each compact T2 space is the T2 reflection (“largest” T2 continuous image) of an inverse limit of finite T0 -spaces ([Fl], [KW1]). The next diagram suggests such a way to approximate the unit interval by finite spaces. Its top horizontal line represents the unit interval, ...
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.