Sperner's Lemma, the Brouwer Fixed-Point Theorem, and Cohomology

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages

Scientific paper

The proof of the Brouwer fixed-point Theorem based on Sperner's Lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial proof of Sperner's Lemma can be considered as a cochain-level version, written in the combinatorial language, of a standard cohomological argument; (ii) the standard deduction of the Brouwer Theorem from Sperner's Lemma is similar to the usual deduction of the Brouwer theorem from the No-Retraction Theorem and is closely related to the notion of a simplicial approximation. In order to make these connections transparent, we included the above mentioned standard arguments, so the note is self-contained modulo the basic notions of (simplicial) cohomology theory.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sperner's Lemma, the Brouwer Fixed-Point Theorem, and Cohomology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sperner's Lemma, the Brouwer Fixed-Point Theorem, and Cohomology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sperner's Lemma, the Brouwer Fixed-Point Theorem, and Cohomology will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-247170

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.