The Bolzano-Poincaré type theorems (Q642238)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5964014
Language Label Description Also known as
default for all languages
No label defined
    English
    The Bolzano-Poincaré type theorems
    scientific article; zbMATH DE number 5964014

      Statements

      The Bolzano-Poincaré type theorems (English)
      0 references
      0 references
      0 references
      26 October 2011
      0 references
      Summary: In 1883--1884, Henri Poincaré announced a result about the structure of the set of zeros of a function \(f : I^n \rightarrow\mathbb R^n\), or alternatively the existence of solutions of the equation \(f(x) = 0\). In the case \(n = 1\), the Poincaré theorem is well known as the Bolzano theorem. In 1940 Miranda rediscovered the Poincaré theorem. Except for a few isolated results it is essentially a non-algorithmic theory. The aim of this article is to introduce an algorithmical proof of the theorem ``On the existence of a chain'' and for \(n = 3\) an algorithmical proof of the Bolzano-Poincaré theorem and to show the equivalence of the Poincaré theorem, the Brouwer theorem and the theorem ``On the existence of a chain''.
      0 references
      Steinhaus' chessboard theorem
      0 references
      Brouwer fixed point theorem
      0 references

      Identifiers