User apollo - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-24T17:42:23Z http://mathoverflow.net/feeds/user/1222 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/56939/must-a-linearly-ordered-separable-space-be-metrizable/56942#56942 Answer by Apollo for Must a linearly ordered, separable space be metrizable? Apollo 2011-03-01T00:01:43Z 2011-03-01T19:51:17Z <p>No. Take $[0,1]\times{0,1}$ with the lexicographic order. This gives a counterexample --- it is separable (for example $\mathbb{Q}\times{1}$ is a countable dense set), yet it is not metrizable. One way to see this is to notice that the subspace $[0,1]\times{1}$ (homeomorphic to the Sorgenfrey line) is not second-countable, hence not metrizable. The counter-example can also be viewed as an example of an Alexandroff "double-point" construction, which is an example of the general construction of "(special) resolution" (which is a nice technique for generating counterexamples).</p> <p>(Edited to incorporate comments --- original answer was incorrect, citing Sorgenfrey line as a counterexample.)</p> http://mathoverflow.net/questions/55885/why-semigroups-could-be-important/55896#55896 Answer by Apollo for Why semigroups could be important? Apollo 2011-02-18T19:40:23Z 2011-02-18T19:40:23Z <p>(Commutative) semigroups and their analysis shows up in the theory of misère combinatorial games. The "misère quotient" semigroup construction gives a natural generalization of the normal-play Sprague-Grundy theory to misere play which allows for complete analysis of (many) such games. (See <a href="http://miseregames.org/" rel="nofollow">http://miseregames.org/</a> for various papers and presentations.)</p> http://mathoverflow.net/questions/55162/how-can-i-write-down-polynomial-relations-that-define-when-a-polynomial-is-a-squa/55164#55164 Answer by Apollo for How can I write down polynomial relations that define when a polynomial is a square? Apollo 2011-02-11T20:26:31Z 2011-02-11T20:26:31Z <p><a href="http://en.wikipedia.org/wiki/Square-free_polynomial" rel="nofollow">http://en.wikipedia.org/wiki/Square-free_polynomial</a> gives a method for finding a square-free factorization of a polynomial (over characteristic zero field), ie $f=a_1\cdot a_2^2\cdots a_n^n$ where each $a_i$ is a square-free polynomial. Then $f$ is a perfect square iff $a_{2i+1}=1$ for each $i$.</p> http://mathoverflow.net/questions/55080/probability-question-regarding-brownian-motion/55081#55081 Answer by Apollo for probability question regarding brownian motion Apollo 2011-02-10T22:00:04Z 2011-02-10T22:24:49Z <p>A straightforward approach is to simply integrate the density of $X_t$ at time $a$ (which will be normally distributed with mean $\mu$ and variance $\sigma^2 a$) against the probability of hitting 0 conditional on the value at time $a$ (which is also known in closed-form). This will give you a messy integral (with an exponential multiplied by a cumulative-normal) but it should be reducible to a (messy sum of) bivariate cumulative normal(s).</p> <p>The value we want to compute is $$\int_0^\infty \mathbb{P}[X_\xi>0 \text{ for } a\leq\xi\leq T\ |\ X_a=z] e^{-z^2/2\sigma^2T}\frac{dz}{\sigma\sqrt{T}\sqrt{2\pi}}$$ where I'm integrating the density at time $a$ for positive values against the non-hitting time.</p> <p>The next step is to observe that the probability $\mathbb{P}[X_\xi>0 \text{ for } a\leq\xi\leq T\ |\ X_a=z]$ is equal to the probability $\mathbb{P}[X_\xi>-z \text{ for } 0\leq\xi\leq T-a]$ but this probability is equal to a difference of (basically) cumulative normals (it's just a hitting time computation for a (scaled) Brownian motion with drift). Then plug that formula into the above integral.</p> <p>A quick calculation (might be wrong, so beware) gives me $$\mathbb{P}[X_\xi>-z \text{ for } 0\leq\xi\leq T-a] = \Phi\left[\frac{-z+\alpha (T-a)}{\sigma\sqrt{T-a}}\right] - e^{2\alpha z/\sigma^2}\Phi\left[\frac{z+\alpha (T-a)}{\sigma\sqrt{T-a}}\right]$$ where $\Phi[z]=\int_{-\infty}^z e^{-\xi^2/2}\frac{d\xi}{\sqrt{2\pi}}$ is the standard cumulative normal distribution function. (This follows from application of Girsanov to a reflection argument, a well-known result.)</p> http://mathoverflow.net/questions/35348/the-difference-between-a-sequential-space-and-a-space-with-countable-tightness/54148#54148 Answer by Apollo for The difference between a sequential space and a space with countable tightness Apollo 2011-02-02T23:20:37Z 2011-02-04T19:49:23Z <p>Some examples to expand Andreas' answer might be of interest: (it's too much to fit in a comment so I'm adding it as an answer, though I think Andreas' response is great)</p> <ul> <li><p>any metric space will be Frechet-Urysohn (choose <code>$x_n$</code> in <code>$A$</code> within <code>$1/n$</code> of <code>$p$</code>); (more generally, any first-countable space is F-U: just choose $x_n$ in the intersection of <code>$A$</code> and <code>$U_n$</code> where <code>$\{U_n\}_n$</code> is a countable base at the limit point);</p></li> <li><p>a sequential but not Frechet-Urysohn space is given by taking <code>$((\omega+1)\times\omega)\cup\{*\}$</code> where each copy of $\omega+1$ has the usual topology and a base for <code>$*$</code> consists of sets <code>$A_{m,n}=\{(m,n)|m&gt;M,n&gt;N_m\}$</code> for <code>$M,N_m\in\omega$</code> (ie cofinitely many elements of cofinitely many fibers) - then <code>$*$</code> is in the closure of <code>$\omega\times\omega$</code> but is not the limit of any sequence of points in <code>$\omega\times\omega$</code>; however, it is the limit of the sequence <code>$x_n=(\omega,n)$</code> and each <code>$x_n$</code> is the limit of a sequence of points from <code>$\omega\times\omega$</code>;</p></li> <li><p>a countably-tight but not sequential space could be given by taking <code>$(\omega\times\omega)\cup\{*\}$</code> where all points <code>$(m,n)$</code> are open and a base for <code>$*$</code> consist of sets <code>$A_{M,N}=\{(m,n)|m&gt;M, n&gt;N_m\}$</code> for <code>$M,N_m\in\omega$</code> - this space is trivially countably tight (it's countable) but is not sequential: <code>$*$</code> is not the limit of any sequence in <code>$\omega\times\omega$</code> (since we can always exclude any putative sequence converging to <code>$*$</code>);</p></li> <li><p>finally a non-countably-tight space is given by <code>$\omega_1+1$</code> with the usual topology: <code>$\omega_1$</code> (as a point) is in the closure of <code>$\omega_1$</code> (as a set) but any countable subset of <code>$\omega_1$</code> has bounded (countable) closure.</p></li> </ul> http://mathoverflow.net/questions/24144/is-there-an-uncountable-non-discrete-hausdorff-toronto-space/54139#54139 Answer by Apollo for Is there an uncountable, non-discrete, Hausdorff Toronto space? Apollo 2011-02-02T22:03:20Z 2011-02-02T22:03:20Z <p>From "Open Problems in Topology" the following facts are known (described there as "folklore")</p> <ul> <li>any Hausdorff non-discrete Toronto space is scattered with countably many isolated points</li> <li>hence such a space must have derived length $\omega_1$ and be hereditarily separable, thus must be an $S$-space</li> <li>this gives a way to have a model where there are no non-discrete Hausdorff Toronto spaces of size $\aleph_1$: assume $2^{\aleph_0}\neq2^{\aleph_1}$ and note that hereditary separability implies that the space has only $2^{\aleph_0}$ autohomeomorphisms while any Toronto space of size $\lambda$ must have $2^\lambda$ autohomeomorphisms</li> </ul> <p>I have no idea what has been proven since then. It is also mentioned that questions concerning Toronto spaces with larger cardinalities and with stronger separation axioms is still open and gives for example the question "Are all regular (or normal) Toronto spaces of size $\aleph_1$ discrete?"</p> http://mathoverflow.net/questions/4235/relating-category-theory-to-programming-language-theory/4272#4272 Answer by Apollo for Relating Category Theory to Programming Language Theory Apollo 2009-11-05T16:55:25Z 2009-11-05T16:55:25Z <p>The connections I have seen are in the area of denotational semantics and type theory. For example, the objects can be the types: Integer, List(Integer), Integer+List(List(Integer)), etc. Functions (in the language) are arrows between the objects. (So the successor function is an arrow from Integer to Integer.) Then categorical constructions translate into programming language constructs ("List" is an endo-functor, for example). The existence of recursive functions is guaranteed by certain categorical properties of the category, etc.</p> http://mathoverflow.net/questions/4019/derivate-bessel-function-with-respect-to-order/4174#4174 Answer by Apollo for Derivate Bessel Function with respect to order Apollo 2009-11-04T23:59:24Z 2009-11-04T23:59:24Z <p>Abramowitz and Stegun give a couple of special cases but don't give a general result. Starting from some of the integral or series representations and differentiating you can get a corresponding integral or series for the derivative, but I would guess that it's unlikely to simplify to a "known" function in the general case. An example they give is (for the spherical Bessel function <img src="http://latex.mathoverflow.net/png?%24j%5F%5Cnu%28x%29%24" alt="$j_\nu(x)$" title="" />):</p> <p>[ d/d\nu j_\nu(x) ]_{\nu=0} = (\pi/(2x))(Ci(2x)\sin x - SI(2x)\cos x)</p> <p>They also give examples evaluated at <img src="http://latex.mathoverflow.net/png?%24%5Cnu%3D%2D1%24" alt="$\nu=-1$" title="" /> and similar results for the case of the "other" spherical bessel <img src="http://latex.mathoverflow.net/png?%24y%5F%5Cnu%28x%29%24" alt="$y_\nu(x)$" title="" />.</p> http://mathoverflow.net/questions/229/is-the-long-line-paracompact/4127#4127 Answer by Apollo for Is the long line paracompact? Apollo 2009-11-04T17:54:04Z 2009-11-04T17:54:04Z <p>The <em>Handbook of Set-Theoretic Topology</em> is the bible for this kind of question. It has a chapter on the long-line and a chapter on questions of paracompactness of manifolds.</p> http://mathoverflow.net/questions/3462/characterizations-of-non-wellfounded-models/3948#3948 Answer by Apollo for Characterizations of non-wellfounded models? Apollo 2009-11-03T16:02:49Z 2009-11-03T16:02:49Z <p>You may want to look at Peter Aczel, Jon Barwise, <em>Non-Well-founded Sets</em> where they describe doing set-theory replacing the Axiom of Foundation by the Anti-Foundation Axiom. There, certain kinds of non-well-founded sets are postulated to exist and they give means to determine if two sets are the "same" set. (For example given A={A} and B={C}, C={B}, is A=B? (I think the answer is yes, shown by a bi-simulation argument.)</p> http://mathoverflow.net/questions/3920/discharging-assumptions/3930#3930 Answer by Apollo for Discharging assumptions Apollo 2009-11-03T12:37:56Z 2009-11-03T12:37:56Z <p>As I understand it, to discharging a premise or assumption is the opposite of introducing it: you absorb it (for example) into the antecedent of an implication --- this means that it is no longer an assumption. A trivial example:</p> <p>P 1. Assume P</p> <p>__</p> <p>P 2. From 1</p> <p>__</p> <p>P->P 3. Discharging 1</p> <p>Thus I have concluded that P->P without any assumptions (iow |- P->P). If we didn't discharge the assumption, we would have P|-P</p> http://mathoverflow.net/questions/108818/product-spaces-of-rationals Comment by Apollo Apollo 2012-10-04T14:12:20Z 2012-10-04T14:12:20Z They're all countable metric spaces with no isolated points. See <a href="http://at.yorku.ca/p/a/c/a/25.htm" rel="nofollow">at.yorku.ca/p/a/c/a/25.htm</a> http://mathoverflow.net/questions/108818/product-spaces-of-rationals Comment by Apollo Apollo 2012-10-04T13:50:40Z 2012-10-04T13:50:40Z They're homeomorphic. http://mathoverflow.net/questions/59359/choice-function-on-the-countable-subsets-of-the-reals/59362#59362 Comment by Apollo Apollo 2011-03-23T23:09:56Z 2011-03-23T23:09:56Z Solovay's model is a model of ZF where every set of reals is measurable. (Assuming the existence of an inaccessible cardinal.) Thus, ZF without choice does not allow you to build a non-measurable set. http://mathoverflow.net/questions/57980/what-is-the-largest-laver-table-which-has-been-computed Comment by Apollo Apollo 2011-03-10T23:42:50Z 2011-03-10T23:42:50Z Thanks. I'd be surprised if there was a faster method (based on the need (maybe) for very powerful large cardinals (at least more than PRA) to prove facts about the periodicity of the top row) to compute arbitrary entries... http://mathoverflow.net/questions/57980/what-is-the-largest-laver-table-which-has-been-computed Comment by Apollo Apollo 2011-03-09T22:52:55Z 2011-03-09T22:52:55Z Do you have a reference you could give for the algorithm? Thanks, http://mathoverflow.net/questions/56939/must-a-linearly-ordered-separable-space-be-metrizable/56942#56942 Comment by Apollo Apollo 2011-03-01T00:24:37Z 2011-03-01T00:24:37Z Actually, now that I think about it, yes it is separable: $[0,1]\times\{0,1\}$ ordered lexicographically. http://mathoverflow.net/questions/56939/must-a-linearly-ordered-separable-space-be-metrizable/56942#56942 Comment by Apollo Apollo 2011-03-01T00:19:25Z 2011-03-01T00:19:25Z The Sorgenfrey line is a subspace of a linear order with the order topology, but yes, it is not an order topology http://mathoverflow.net/questions/54868/low-discrepancy-sequences-for-sampling-of-distributions Comment by Apollo Apollo 2011-02-23T15:56:05Z 2011-02-23T15:56:05Z I would recommend using Sobol' sequences as they tend to give better results in my experience. Second, using low-discrepancy sequences you do <i>not</i> want to use methods like Box-Muller to generate normals from the uniforms since, as pointed out by Tim, the points in the low-discrepancy sequences are not independent. Simply invert the cumulative normal density function (the Ziggurat method is an efficient method for this). http://mathoverflow.net/questions/55172/what-is-an-efficient-algorithm-to-compute-modular-exponentiation-of-stacked-expon Comment by Apollo Apollo 2011-02-11T23:13:23Z 2011-02-11T23:13:23Z This question was also asked on <a href="http://math.stackexchange.com/questions/21601/what-is-an-efficient-algorithm-to-compute-modular-exponentiation-of-stacked-expon" rel="nofollow" title="what is an efficient algorithm to compute modular exponentiation of stacked expon">math.stackexchange.com/questions/21601/&hellip;</a> (seems a better fit there). http://mathoverflow.net/questions/55080/probability-question-regarding-brownian-motion/55081#55081 Comment by Apollo Apollo 2011-02-10T22:44:33Z 2011-02-10T22:44:33Z A useful fact for simplifying the resulting integral is that $\int_{-\infty}^\lam \phi(u)\Phi(\alpha+\beta u)du = \Psi[\lambda,\frac{\alpha}{\sqrt{1+\beta^2}};\frac{-\beta}{\sqrt{1+\beta^2}}]$ where $\Psi[x,y;\rho]$ is the bivariate normal cumulative distribution function. This is a straightforward bit of algebra (expand the inner cumulative normal as an integral and play with it until you get the standard bivariate). http://mathoverflow.net/questions/55080/probability-question-regarding-brownian-motion/55081#55081 Comment by Apollo Apollo 2011-02-10T22:34:31Z 2011-02-10T22:34:31Z We're integrating along the distribution of $X$ at time $a$ and multiplying by the conditional probability (given our location at time $a$) that we make it further to time $T$ without hitting zero. If we're already below zero then this probability is $0$ (so the lower bound of the integral starts at $0$) if we're above zero then we just need to keep the minimum of the remaining path above zero. http://mathoverflow.net/questions/55080/probability-question-regarding-brownian-motion/55081#55081 Comment by Apollo Apollo 2011-02-10T22:18:03Z 2011-02-10T22:18:03Z Added a little more detail. http://mathoverflow.net/questions/24144/is-there-an-uncountable-non-discrete-hausdorff-toronto-space/54139#54139 Comment by Apollo Apollo 2011-02-04T19:56:31Z 2011-02-04T19:56:31Z From the 7th status report: in G. Gruenhage, J.T. Moore, Countable Toronto spaces, Fund. Math. 163 (2) (2000) 143–162, they show that there is an <code>$\omega$</code>-Toronto space, where an <code>$\alpha$</code>-Toronto space is a scattered space of Cantor-Bendixson rank <code>$\alpha$</code> which is homeomorphic to each of its subspaces of rank <code>$\alpha$</code>. They constructed countable <code>$\alpha$</code>-Toronto spaces for each <code>$\alpha&lt;\omega$</code>. Gruenhage also constructed consistent examples of countable <code>$\alpha$</code>-Toronto spaces for each <code>$\alpha&lt;\omega&#95;1$</code>. http://mathoverflow.net/questions/24079/are-there-sigma-algebras-of-cardinality-kappa2-aleph-0-with-countable-cofi/24092#24092 Comment by Apollo Apollo 2010-05-10T14:09:00Z 2010-05-10T14:09:00Z This argument doesn't work. The set of countable subsets of a cardinal $\kappa$ will be of size $\kappa^\omega$ which will be equal to $2^\omega \kappa$ for $\kappa$ with uncountable cofinality (and hence $&gt;\kappa$ for any $\kappa&lt;2^\omega$. For $\kappa$ of countable cofinality $\kappa^\omega&gt;\kappa$. So in all of these cases your construction fails. However, for $\kappa$ of uncountable cofinality you will get a $\sigma$-algebra of cardinality $\kappa$. http://mathoverflow.net/questions/19783/countable-paracompactness-normality-and-locally-countable-open-covers/19798#19798 Comment by Apollo Apollo 2010-04-19T14:12:21Z 2010-04-19T14:12:21Z David- No problem. Thanks for posting the scan --- it's nice to have an e-copy (mine is a 20 year old xerox...) Cheers