User marc - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-19T11:44:25Z http://mathoverflow.net/feeds/user/1623 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/23113/is-there-any-geometry-where-the-triangle-inquality-fails/23140#23140 Answer by marc for Is there any geometry where the triangle inquality fails? marc 2010-04-30T19:56:29Z 2010-04-30T19:56:29Z <p>In <a href="http://en.wikipedia.org/wiki/Information_geometry" rel="nofollow">Information Geometry</a>, the <a href="http://en.wikipedia.org/wiki/Kullback%25E2%2580%2593Leibler_divergence" rel="nofollow">Kullback-Liebler divergence</a> is commonly used in the manner of a metric, but it does not satisfy the triangle inequality. It localizes to the <a href="http://en.wikipedia.org/wiki/Fisher_information_metric" rel="nofollow">Fisher Information Metric</a> on the probability <a href="http://en.wikipedia.org/wiki/Simplex" rel="nofollow">simplex</a>, the interior of which is diffeomorphic to the geometry of the sphere with the inherited metric from Euclidean space under the map $x \mapsto 2\sqrt{x}.$ This geometry is used in evolutionary game theory to study natural selection.</p> <p>There are many other information divergences that are not symmetric and do not satisfy the triangle inequality. You can form a <a href="http://www.citeulike.org/group/2854/article/1603607" rel="nofollow">divergence that does satisfy the triangle inequality</a>.</p> http://mathoverflow.net/questions/430/homological-algebra-for-commutative-monoids/5850#5850 Answer by marc for Homological Algebra for Commutative Monoids? marc 2009-11-17T18:21:59Z 2009-12-09T07:59:05Z <p>Presummably you could use the forgetful functor to sets and its adjoint to construct a homology theory (using the walking adjunction, simplicial sets, etc) analogously to how group homology arises from the forgetful-free adjunction to set.</p> <p>The details are probably rather dense and tedious though.</p> http://mathoverflow.net/questions/6511/examples-of-mathematics-motivated-by-technological-considerations/6523#6523 Answer by marc for Examples of mathematics motivated by technological considerations marc 2009-11-23T03:16:03Z 2009-11-23T03:16:03Z <p>Contemporary work in biology has lots of examples. With the wealth of sequencing data coming out of the machines at ever lower costs there is a huge need for new methods and models to analyze and understand the data.</p> <p>Google is another good example. Better (or even acceptable) internet search was desired and it took a <a href="http://en.wikipedia.org/wiki/PageRank" rel="nofollow">mathematical advance</a> to move the technology forward.</p> http://mathoverflow.net/questions/3721/programming-languages-based-on-category-theory/5874#5874 Answer by marc for Programming Languages based on Category Theory marc 2009-11-17T21:51:16Z 2009-11-17T21:51:16Z <p>Also see <a href="http://en.wikibooks.org/wiki/Haskell/Category%5Ftheory" rel="nofollow">here</a>.</p> http://mathoverflow.net/questions/4235/relating-category-theory-to-programming-language-theory/5872#5872 Answer by marc for Relating Category Theory to Programming Language Theory marc 2009-11-17T21:44:29Z 2009-11-17T21:44:29Z <p>If you want to get your hands dirty, look into the programming language Haskell, which has functors and natural transformations.</p> <p>Functors implement structure. For instance, consider the category of types T and a functor L that sends a type t to the type L(t), lists of t. This is somewhat similar to the functor on Set that sends a set X to the set of all finite lists on the set X (i.e. the underlying set of the free monoid on X). You could also consider a functor B that sends a type t to the type B(t) of a binary tree on t.</p> <p>Now you can define a natural transformation from B(t) to L(t) such as flatten, which takes a binary tree and flattens it to a list. So as functors implement structure, natural transformations alter structure.</p> <p>It gets interesting when you bring in monads. Using the list functor above, think about L(L(t)), lists of lists. You can concatenate a list of lists to a single list, which corresponds to the monad map L(L(t)) to L(t).</p> <p>Check out this <a href="http://en.wikibooks.org/wiki/Haskell/Category%5Ftheory" rel="nofollow">link</a> for more.</p> http://mathoverflow.net/questions/5786/how-do-i-check-if-a-functor-has-a-left-right-adjoint/5787#5787 Answer by marc for How do I check if a functor has a (left/right) adjoint? marc 2009-11-17T06:28:21Z 2009-11-17T06:28:21Z <p>There's the <a href="http://en.wikipedia.org/wiki/Adjoint%5Ffunctors#General%5Fexistence%5Ftheorem" rel="nofollow">Freyd Adjoint Functor Theorem</a>. </p> <p>A right adjoint functor is continuous (commutes with limits) and a left adjoint functor is cocontinuous (commutes with colimits). So, if a functor has a left adjoint then it is continuous because it is a right adjoint. The adjoint functor theorem is a partial converse to this fact in the case that the domain category is complete (has all small limits) and the functor satisfies a "smallness condition".</p> http://mathoverflow.net/questions/1785/how-do-you-keep-your-research-notes-organized/4716#4716 Answer by marc for How do you keep your research notes organized? marc 2009-11-09T08:10:39Z 2009-11-09T08:10:39Z <p>I'll echo what Charles said with the addition of using git. You can literally branch your notes just like you would source code and it plays nicely with latex. You can roll back, merge, and share with others very easily. You can tag commits with brief explanations and search those later or use a git visualizer to quickly find something.</p> <p>Plus all your work is still in text files so you can still use grep and all the usual console tools.</p> http://mathoverflow.net/questions/23113/is-there-any-geometry-where-the-triangle-inquality-fails/23140#23140 Comment by marc marc 2010-05-03T21:41:52Z 2010-05-03T21:41:52Z In evolutionary game theory the Fisher information metric is called the Shahshahani metric. See &quot;Evolutionary Game Theory&quot; by Hofbauer and Sigmund. The information divergence can be used to give a Lyapunov function for the replicator equation. I believe this goes back to Akin; others use an exponentiated form (e.g. Hofbauer and Sigmund). http://mathoverflow.net/questions/6551/what-is-an-intuitive-view-of-adjoints-version-1-category-theory/6555#6555 Comment by marc marc 2009-11-23T19:34:24Z 2009-11-23T19:34:24Z Just to emphasize on part of this response, note that an adjoint pair provides a global solution (category-wide) as opposed to a local solution provided by universal maps. So universality is more general, in that if the universal map exists for every object in the category, the family of universal maps can be used to define an adjoint. http://mathoverflow.net/questions/6511/examples-of-mathematics-motivated-by-technological-considerations/6523#6523 Comment by marc marc 2009-11-23T15:06:19Z 2009-11-23T15:06:19Z Well it depends on what you mean by mathematical advance. If your metric is the creation of an entire new field, such as graph theory itself in this case, then I guess not. http://mathoverflow.net/questions/5786/how-do-i-check-if-a-functor-has-a-left-right-adjoint/5787#5787 Comment by marc marc 2009-11-17T18:16:41Z 2009-11-17T18:16:41Z It's not all that hard to verify the definition directly in a lot of cases. Do you mean &quot;not tedious&quot;-to-check?