Confusion about Homotopy Type Theory terminology - Mathematics Stack Exchange
The usual names for Σ-types and Π-types are dependent sum and dependent product, respectively, but for some reason the Homotopy Type Theory book calls them dependent pair type and dependent function type.
QA  math.CT  math.GN  cs.Pl 
june 2018 by coltongrainger
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
general topology - What should be the intuition when working with compactness? - Mathematics Stack Exchange

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
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
The inverse function theorem for everywhere differentiable maps
The classical inverse function theorem reads as follows: Theorem 1 ( inverse function theorem) Let be an open set, and let be an continuously differentiable function, such that for every , the derivative map is invertible. Then is a local homeomorphism; thus, for every , there exists an open neighbourhood of and an open neighbourhood [...]
expository  math.CA  math.GN  inverse_function_theorem  Jean_Saint_Raymond  math_overflow  from google
september 2011 by josephzizys

related tags

254a_-_hilbert's_fifth_problem  abstraction  announcement  arrows  atoms  big-list  boulder  cartoons  characterization  cheatsheet  closure  community  comparison  concept  concrete  contradiction  convergence  counterexample  definition  discrete  discussion  examples  expository  finiteness  funding  geometry  giants  gleason_metrics  gnon  gowers  graphs  ground-up  hi-order-bits  hilbert's_fifth_problem  ideas  inference  insight  intersection-connectedness  intuition  inverse_function_theorem  jean_saint_raymond  lie_algebras  lie_groups  limits  links  list  logic  manifolds  math.ct  math  math_overflow  mathtariat  measure  metabuch  metric-space  motivation  multi  neurons  nibble  oly  one-parameter_subgroups  orders  overflow  p:someday  puzzles  q-n-a  qa  qra  quiz  rec-math  reflection  rigidity  s:*  separation  smoothness  social  soft-question  spatial  structure  synthesis  techtariat  things  thinking  tidbits  todo  topology  trivia  twitter  visual-understanding  visualization  visuo  wild-ideas  wordlessness  zooming  🐸  👳 

Copy this bookmark: