nhaliday + topology   39

gn.general topology - Pair of curves joining opposite corners of a square must intersect---proof? - MathOverflow
In his 'Ordinary Differential Equations' (sec. 1.2) V.I. Arnold says "... every pair of curves in the square joining different pairs of opposite corners must intersect".

This is obvious geometrically but I was wondering how one could go about proving this rigorously. I have thought of a proof using Brouwer's Fixed Point Theorem which I describe below. I would greatly appreciate the group's comments on whether this proof is right and if a simpler proof is possible.

...

Since the full Jordan curve theorem is quite subtle, it might be worth pointing out that theorem in question reduces to the Jordan curve theorem for polygons, which is easier.

Suppose on the contrary that the curves A,BA,B joining opposite corners do not meet. Since A,BA,B are closed sets, their minimum distance apart is some ε>0ε>0. By compactness, each of A,BA,B can be partitioned into finitely many arcs, each of which lies in a disk of diameter <ε/3<ε/3. Then, by a homotopy inside each disk we can replace A,BA,B by polygonal paths A′,B′A′,B′ that join the opposite corners of the square and are still disjoint.

Also, we can replace A′,B′A′,B′ by simple polygonal paths A″,B″A″,B″ by omitting loops. Now we can close A″A″ to a polygon, and B″B″ goes from its "inside" to "outside" without meeting it, contrary to the Jordan curve theorem for polygons.

- John Stillwell
nibble  q-n-a  overflow  math  geometry  topology  tidbits  intricacy  intersection  proofs  gotchas  oly  mathtariat  fixed-point  math.AT  manifolds  intersection-connectedness 
october 2017 by nhaliday
Best Topology Olympiad ***EVER*** - Affine Mess - Quora
Most people take courses in topology, algebraic topology, knot theory, differential topology and what have you without once doing anything with a finite topological space. There may have been some quirky questions about such spaces early on in a point-set topology course, but most of us come out of these courses thinking that finite topological spaces are either discrete or only useful as an exotic counterexample to some standard separation property. The mere idea of calculating the fundamental group for a 4-point space seems ludicrous.

Only it’s not. This is a genuine question, not a joke, and I find it both hilarious and super educational. DO IT!!
nibble  qra  announcement  math  geometry  topology  puzzles  rec-math  oly  links  math.AT  ground-up  finiteness  math.GN 
october 2017 by nhaliday
co.combinatorics - Classification of Platonic solids - MathOverflow
My question is very basic: where can I find a complete (and hopefully self-contained) proof of the classification of Platonic solids? In all the references that I found, they use Euler's formula v−e+f=2v−e+f=2 to show that there are exactly five possible triples (v,e,f)(v,e,f). But of course this is not a complete proof because it does not rule out the possibility of different configurations or deformations. Has anyone ever written up a complete proof of this statement?!

...

This is a classical question. Here is my reading of it: Why is there a unique polytope with given combinatorics of faces, which are all regular polygons? Of course, for simple polytopes (tetrahedron, cube, dodecahedron) this is clear, but for the octahedron and icosahedron this is less clear.

The answer lies in the Cauchy's theorem. It was Legendre, while writing his Elements of Geometry and Trigonometry, noticed that Euclid's proof is incomplete in the Elements. Curiously, Euclid finds both radii of inscribed and circumscribed spheres (correctly) without ever explaining why they exist. Cauchy worked out a proof while still a student in 1813, more or less specifically for this purpose. The proof also had a technical gap which was found and patched up by Steinitz in 1920s.

The complete (corrected) proof can be found in the celebrated Proofs from the Book, or in Marcel Berger's Geometry. My book gives a bit more of historical context and some soft arguments (ch. 19). It's worth comparing this proof with (an erroneous) pre-Steinitz exposition, say in Hadamard's Leçons de Géométrie Elémentaire II, or with an early post-Steinitz correct but tedious proof given in (otherwise, excellent) Alexandrov's monograph (see also ch.26 in my book which compares all the approaches).

P.S. Note that Coxeter in Regular Polytopes can completely avoid this issue but taking a different (modern) definition of the regular polytopes (which are symmetric under group actions). For a modern exposition and the state of art of this approach, see McMullen and Schulte's Abstract Regular Polytopes.

https://en.wikipedia.org/wiki/Platonic_solid#Classification
https://mathoverflow.net/questions/46502/on-the-number-of-archimedean-solids
q-n-a  overflow  math  topology  geometry  math.CO  history  iron-age  mediterranean  the-classics  multi  curiosity  clarity  proofs  nibble  wiki  reference  characterization  uniqueness  list  ground-up 
july 2017 by nhaliday
Lecture 6: Nash Equilibrum Existence
pf:
- For mixed strategy profile p ∈ Δ(A), let g_ij(p) = gain for player i to switch to pure strategy j.
- Define y: Δ(A) -> Δ(A) by y_ij(p) ∝ p_ij + g_ij(p) (normalizing constant = 1 + ∑_k g_ik(p)).
- Look at fixed point of y.
pdf  nibble  lecture-notes  exposition  acm  game-theory  proofs  math  topology  existence  fixed-point  simplex  equilibrium  ground-up 
june 2017 by nhaliday
general topology - What should be the intuition when working with compactness? - Mathematics Stack Exchange
http://math.stackexchange.com/questions/485822/why-is-compactness-so-important

The situation with compactness is sort of like the above. It turns out that finiteness, which you think of as one concept (in the same way that you think of "Foo" as one concept above), is really two concepts: discreteness and compactness. You've never seen these concepts separated before, though. When people say that compactness is like finiteness, they mean that compactness captures part of what it means to be finite in the same way that shortness captures part of what it means to be Foo.

--

As many have said, compactness is sort of a topological generalization of finiteness. And this is true in a deep sense, because topology deals with open sets, and this means that we often "care about how something behaves on an open set", and for compact spaces this means that there are only finitely many possible behaviors.

--

Compactness does for continuous functions what finiteness does for functions in general.

If a set A is finite then every function f:A→R has a max and a min, and every function f:A→R^n is bounded. If A is compact, the every continuous function from A to R has a max and a min and every continuous function from A to R^n is bounded.

If A is finite then every sequence of members of A has a subsequence that is eventually constant, and "eventually constant" is the only kind of convergence you can talk about without talking about a topology on the set. If A is compact, then every sequence of members of A has a convergent subsequence.
q-n-a  overflow  math  topology  math.GN  concept  finiteness  atoms  intuition  oly  mathtariat  multi  discrete  gowers  motivation  synthesis  hi-order-bits  soft-question  limits  things  nibble  definition  convergence  abstraction 
january 2017 by nhaliday
Mikhail Leonidovich Gromov - Wikipedia
Gromov's style of geometry often features a "coarse" or "soft" viewpoint, analyzing asymptotic or large-scale properties.

Gromov is also interested in mathematical biology,[11] the structure of the brain and the thinking process, and the way scientific ideas evolve.[8]
math  people  giants  russia  differential  geometry  topology  math.GR  wiki  structure  meta:math  meta:science  interdisciplinary  bio  neuro  magnitude  limits  science  nibble  coarse-fine  wild-ideas  convergence  info-dynamics  ideas 
january 2017 by nhaliday
Covering space - Wikipedia
A covering space of X is a topological space C together with a continuous surjective map p: C -> X such that for every x ∈ X, there exists an open neighborhood U of x, such that p^−1(U) (the inverse image of U under p) is a union of disjoint open sets in C, each of which is mapped homeomorphically onto U by p.
concept  math  topology  arrows  lifts-projections  wiki  reference  fiber  math.AT  nibble  preimage 
january 2017 by nhaliday
"Surely You're Joking, Mr. Feynman!": Adventures of a Curious Character ... - Richard P. Feynman - Google Books
Actually, there was a certain amount of genuine quality to my guesses. I had a scheme, which I still use today when somebody is explaining something that l’m trying to understand: I keep making up examples. For instance, the mathematicians would come in with a terrific theorem, and they’re all excited. As they’re telling me the conditions of the theorem, I construct something which fits all the conditions. You know, you have a set (one ball)—disjoint (two balls). Then the balls tum colors, grow hairs, or whatever, in my head as they put more conditions on. Finally they state the theorem, which is some dumb thing about the ball which isn’t true for my hairy green ball thing, so I say, “False!"
physics  math  feynman  thinking  empirical  examples  lens  intuition  operational  stories  metabuch  visual-understanding  thurston  hi-order-bits  geometry  topology  cartoons  giants  👳  nibble  the-trenches  metameta  meta:math  s:**  quotes  gbooks 
january 2017 by nhaliday
soft question - A Book You Would Like to Write - MathOverflow
- The Differential Topology of Loop Spaces
- Knot Theory: Kawaii examples for topological machines
- An Introduction to Forcing (for people who don't care about foundations.)
writing  math  q-n-a  discussion  books  list  synthesis  big-list  overflow  soft-question  techtariat  mathtariat  exposition  topology  open-problems  logic  nibble  fedja  questions 
october 2016 by nhaliday
Math attic
includes a nice visualization of implications between properties of topological spaces
math  visualization  visual-understanding  metabuch  techtariat  graphs  topology  synthesis  math.GN  separation  metric-space  zooming  inference  cheatsheet 
march 2016 by nhaliday

bundles : academeframemathsp

related tags

abstraction  academia  accretion  acm  acmtariat  algebra  algorithms  announcement  apollonian-dionysian  applications  approximation  arrows  atoms  axioms  bayesian  biases  big-list  big-picture  bio  books  boolean-analysis  business  caltech  cartoons  characterization  chart  cheatsheet  checklists  chemistry  clarity  clever-rats  closure  coarse-fine  cog-psych  comparison  concentration-of-measure  concept  conceptual-vocab  concrete  confluence  confusion  contradiction  convergence  convexity-curvature  counterexample  course  criminal-justice  cs  curiosity  current-events  curvature  data-science  database  decision-making  decision-theory  deep-learning  definition  differential  dimensionality  discrete  discussion  distribution  economics  electromag  empirical  ends-means  engineering  entropy-like  equilibrium  estimate  ethical-algorithms  ethics  examples  existence  exposition  fedja  feynman  fiber  finiteness  fixed-point  formal-values  fourier  game-theory  gbooks  geography  geometry  giants  gotchas  government  gowers  graph-theory  graphical-models  graphics  graphs  ground-up  growth  GT-101  heterodox  hi-order-bits  history  hmm  homogeneity  ideas  impact  impro  inference  info-dynamics  info-foraging  init  insight  interdisciplinary  intersection  intersection-connectedness  interview  intricacy  intuition  iron-age  knowledge  language  law  lecture-notes  lens  lesswrong  letters  levers  lifts-projections  limits  linear-algebra  linearity  links  list  logic  machine-learning  macro  magnitude  manifolds  maps  marginal  martingale  math  math.AT  math.CA  math.CO  math.CV  math.DS  math.FA  math.GN  math.GR  math.MG  math.NT  math.RT  mathtariat  measure  mediterranean  meta:math  meta:science  metabuch  metameta  metric-space  micro  mit  model-class  mostly-modern  motivation  multi  music-theory  neuro  news  nibble  numerics  oly  open-problems  operational  optimization  orders  org:bleg  org:edu  org:inst  org:junk  org:mag  org:sci  overflow  p:**  p:***  p:someday  pdf  pennsylvania  people  philosophy  physics  pigeonhole-markov  polisci  politics  polynomials  pragmatic  pre-2013  preimage  prioritizing  probability  problem-solving  profile  programming  proofs  psychology  puzzles  q-n-a  qra  quantum  quantum-info  questions  quixotic  quotes  rationality  ratty  reading  rec-math  recommendations  reference  reflection  relativity  review  rigidity  roadmap  russia  s:*  s:**  s:***  scholar-pack  science  separation  series  SIGGRAPH  simplex  skeleton  smoothness  social-choice  social-science  soft-question  spectral  stat-mech  stats  stochastic-processes  stories  structure  studying  subculture  survey  synthesis  tcs  tcstariat  teaching  techtariat  telos-atelos  the-classics  the-trenches  thermo  things  thinking  thurston  tidbits  toolkit  top-n  topics  topology  track-record  tricki  trivia  uniqueness  unit  usa  vague  visual-understanding  visualization  wiki  wild-ideas  winter-2017  world-war  wormholes  writing  yoga  zooming  🎓  👳  🤖  🦉 

Copy this bookmark:



description:


tags: