User linda brown westrick - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-18T12:34:01Z http://mathoverflow.net/feeds/user/6649 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/114945/mutually-tangent-ellipsoids-in-3-space Mutually tangent ellipsoids in 3 space Linda Brown Westrick 2012-11-30T00:04:07Z 2012-12-01T08:02:22Z <p>I recently heard a claim that for any n, it is possible to arrange n ellipsoids in 3 space such that each pair of ellipsoids is kissing. Is this true, and if so, how?</p> <p>Edit: By kissing, I mean that I would like the interiors of the ellipsoids to be disjoint, but each pair of ellipsoids should intersect at a point.</p> http://mathoverflow.net/questions/109550/a-question-about-recursively-enumerable-sets-of-rational-numbers/109555#109555 Answer by Linda Brown Westrick for A question about recursively enumerable sets of rational numbers Linda Brown Westrick 2012-10-13T19:23:05Z 2012-10-13T19:23:05Z <p>The ordering (f(N*),&lt;) that you describe is a recursive ordering, so if it is well-founded, it has the order type of a recursive ordinal. It is known (see e.g. Higher Recursion Theory by Sacks) that the recursive ordinals coincide with the constructive ordinals. Therefore, the order type is constructive.</p> http://mathoverflow.net/questions/66249/musings-in-set-theory-reverse-sets/66253#66253 Answer by Linda Brown Westrick for Musings in set theory: Reverse sets? Linda Brown Westrick 2011-05-28T02:09:50Z 2011-05-28T02:09:50Z <p>The assumption is incorrect because the reverse graph H(X) might not be extensional (i.e. it might not satisfy $(\forall z (z,x) \leftrightarrow (z,y)) \rightarrow x=y$). An example is $X=\{\{1\},\{2\}\}$.</p> http://mathoverflow.net/questions/65911/when-checking-if-a-harmonic-function-is-continuous-on-its-boundary-is-a-dense-su When checking if a harmonic function is continuous on its boundary, is a dense subset enough? Linda Brown Westrick 2011-05-24T23:03:12Z 2011-05-27T01:54:19Z <p>Let $U$ be an open connected subset of $\mathbb{C}$ and let $u:U\rightarrow \mathbb{R}$ be harmonic and bounded on $U$. </p> <p>Let $f:\partial_\infty U \rightarrow \mathbb{R}$ be a continuous function, and suppose $u$ extends continuously to $f$ on a dense subset of $\partial_\infty U$. </p> <p>By $\partial_\infty U$ I mean the boundary of $U$ in $\mathbb{C}\cup\{\infty\}$. By "$u$ extends continuously to $f$ on $D$" I mean that for each $a \in D$, $\lim_{z\rightarrow a} u(z)$ exists and is equal to $f(a)$.</p> <p>Does it follow that $u$ extends continuously to $f$ on all of $\partial_\infty U$?</p> http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable Characterize where the Dirichlet Problem for the Laplacian is always solvable Linda Brown Westrick 2011-05-24T22:28:16Z 2011-05-25T20:47:34Z <p>Conway's 1978 textbook <em>Functions of One Complex Variable I</em> gives an unsatisfying characterization of the regions for which the Dirichlet Problem can always be solved, and then comments no cleaner characterization is known. <strong>Has any progress been made since then? And what simpler characterization is known today, if one is known?</strong></p> <h2>Here is the problem definition:</h2> <p>An open connected set $G\subseteq \mathbb{C}$ is called a <em>Dirichlet Region</em> if for each continuous function $f:\partial_\infty G\rightarrow \mathbb{R}$ there is a continuous function $u:G^- \rightarrow \mathbb{R}$ such that $u$ is harmonic in $G$ and $u(z)=f(z)$ for all $z$ in $\partial_\infty G$.</p> <p>(The notation $\partial_\infty G$ refers to the boundary of $G$ in $\mathbb{C}\cup\{\infty\}$, and $G^-$ denotes the closure of $G$ in $\mathbb{C}\cup\{\infty\}$.)</p> <h2>The characterization given in the book is:</h2> <p>Given $a \in \partial_\infty G$, a <em>barrier</em> for $G$ at $a$ is a family $\{\psi_r: r>0\}$ of functions such that: <br> 1. $\psi_r$ is well-defined and superharmonic on $B(a;r) \cap G$ with $0\leq \psi_r(z) \leq 1$ <br> 2. $\lim_{z\rightarrow a}\psi_r(z) = 0$, and <br> 3. $\lim_{z\rightarrow w} \psi_r(z) = 1$ for $w$ in $G \cap \{w:|w-a|=r\}$.</p> <p>An open connected set $G$ is a Dirichlet Region iff there is a barrier for $G$ at each point of $\partial_\infty G$. </p> http://mathoverflow.net/questions/43950/meaning-of-subset-notation Meaning of \Subset notation Linda Brown Westrick 2010-10-28T07:16:49Z 2010-10-28T18:14:56Z <p>The symbol $\Subset$ (occurring in places where $\subseteq$ could occur syntactically) comes up frequently in a paper I'm reading. The paper lives at the intersection of a few areas of math, and I don't even know where to begin looking for the meaning of a symbol whose latex code is "\Subset". Do you know what this usually denotes?</p> <p>Edit: some context follows.</p> <p>All the sets in question are subsets of $\hat{\mathbb{C}} = \mathbb{C}\cup\{\infty\}$. </p> <p>Example 1. In a situation where $J$ is closed with empty interior, $U$ and $V$ are closed with $U\subsetneq V$, it is written "Note that $J \Subset U$ and, selecting a neighborhood $W \subset U$ of $J$ which is compactly contained in $V$, ..."</p> <p>Example 2. In a situation where $R$ is a rational mapping, and where it is assumed that $B\subset \hat{\mathbb{C}}$ is such that $R(B)\Subset B$, it is written "Let $\Omega_0 = \hat{\mathbb{C}}\setminus B$. Define $\Omega_1 = R^{-1}(\Omega_0)$. By the properties of $B$, we have $\Omega_1\Subset\Omega_0$. If we let $U_0$ be any finite union of closed balls such that $\Omega_1 \subset U_0 \subset \Omega_0$, ..."</p> <p>In both cases I have paraphrased to simplify the notation, so I hope I have not introduced errors into it.</p> http://mathoverflow.net/questions/30874/arithmetic-fixed-point-theorem/31374#31374 Answer by Linda Brown Westrick for Arithmetic fixed point theorem Linda Brown Westrick 2010-07-11T08:17:54Z 2010-07-11T08:17:54Z <p>Let's start out with the observation that there can be no formula $D$ with the property that for all $\varphi$, $$D([\varphi]) \iff \varphi([\varphi]).$$ For if such a $D$ existed, then defining the formula $E$ by $E(\underline{n}) = \neg D(\underline{n})$, we would have $$D([E]) \iff E([E]) \iff \neg D([E]),$$ a contradiction.</p> <p>Now, the task is to show that given a formula $F$ of one variable, there is another formula $A$ such that $A\iff F([A])$. Well, if that's not true, then an improbable-looking thing would happen: for every sentence $A$, we would have $$\neg F([A])\iff A.$$</p> <p>The reason this looks improbable is that the formula $\neg F$ looks fairly similar to the forbidden formula $D$ above. In fact, if I want to juice the similarity for all it's worth, I would explore what happens when $A$ is of the form $A = \varphi([\varphi])$ for some $\varphi$; then we would have $$\neg F([\varphi([\varphi])]) \iff \varphi([\varphi]).$$</p> <p>But if this holds for all $\varphi$, we can define the forbidden $D$ by $D([\varphi]) = \neg F([\varphi([\varphi])])$. Contradiction.</p> <p>Now out of this argument, let's extract the specific formula $A$ that we originally wanted. We are looking for an $A$ of the form $\varphi([\varphi])$. Our hint is to use the same formula $E([E])$ which destroyed our hopes about $D$ above. The context is new, but we define $E$ in the same way: $E([\varphi]) = \neg D([\varphi])$. That is $$E([\varphi]) = F([\varphi([\varphi])).$$ </p> <p>Now the only step that remains is the one you've already seen: checking that $A=E([E])$ in fact works.</p> http://mathoverflow.net/questions/30633/sneaky-recursive-non-well-orders Sneaky Recursive Non-Well-Orders Linda Brown Westrick 2010-07-05T15:45:29Z 2010-07-05T18:13:12Z <h2>Background</h2> <p>An ordinal $\alpha$ is called a <em>recursive ordinal</em> if there is a recursive well-order $R$ on $\mathbb{N}$ such that ordertype($\mathbb{N},R) = \alpha$. For example, $2\omega$ is a recursive ordinal because the ordering of $\mathbb{N}$ as 0, 2, 4, 6, 8, ... 1, 3, 5, 7, ... is computable and has order type $2\omega$.</p> <p>Kleene encoded the recursive ordinals in the natural numbers in a nifty way which is described at <a href="http://en.wikipedia.org/wiki/Kleene%27s_O" rel="nofollow">the Wikipedia page on Kleene's O</a>. Now Kleene's $\mathcal{O}$ is a fairly powerful set -- given a Turing machine index for a linear order, $\mathcal{O}$ can decide whether that ordering is a well-ordering or not.</p> <p>Using Kleene's $\mathcal{O}$, it is possible to describe how to iterate the Turing jump through the recursive ordinals. For each natural number $a\in\mathcal{O}$, we can define a set $H_a$ recursively as follows:</p> <ol> <li>$H_a = \emptyset$ if $a=0$</li> <li>$H_a = {H_b}'$ if $a=2^b$</li> <li>$H_a = \{\langle n, x \rangle | x \in H_{\phi_e(n)} \}$ if $a = {3\cdot 5^e}$</li> </ol> <p>For each $a\in \mathcal{O}$, we have $H_a$ &lt;$_T \ \mathcal{O}$ (strict inequality), and no $H_a$ is powerful enough to decide which recursive orders are well-orders.</p> <h2>Question</h2> <p>Among recursive non-well-orders, some hide their descending chains better than others do. </p> <p>For example, if we only wanted to flag the non-well-orders sporting a <em>recursive</em> descending chain, the full power of $\mathcal{O}$ would not be necessary -- $\emptyset'''$ would do $(\exists e [ \phi_e$ is total and $\forall n [\ \phi_e(n+1)$ &lt;$_R\ \phi_e(n)\ ]]$?). Thus there is a recursive linear non-well-order with no recursive descending chain. </p> <p>In fact (by similar reasoning), for each $a \in \mathcal{O}$ there must be a recursive linear non-well-order with no recursive-in-$H_a$ descending chain.</p> <p>I wonder whether we could effectively construct these sneaky recursive non-well-orders.</p> <blockquote> <p>Is there a recursive function $f$ such that whenever $a\in\mathcal{O}$, $f(a)$ is a Turing index for a linear non-well-order with no $H_a$ -computable descending chain?</p> </blockquote> http://mathoverflow.net/questions/27960/when-does-replacement-accidentally-hold-in-amenable-sets When does replacement (accidentally) hold in amenable sets? Linda Brown Westrick 2010-06-12T18:49:18Z 2010-06-21T08:35:44Z <p>A set $M$ is called <em>amenable</em> if it is transitive and satisfies the following conditions:</p> <ol> <li>For all $x,y\in M$, $\{x,y\}\in M$</li> <li>For all $x\in M$, $\bigcup x \in M$</li> <li>$\omega \in M$</li> <li>For all $x,y \in M$, $x\times y \in M$</li> <li>($\Sigma_0$ comprehension) Whenever $\Phi$ is a $\Sigma_0$ formula of one free variable with parameters from $M$, then for all $x\in M$, $\{z\in x | \Phi(z)\}\in M$</li> </ol> <p>Although the definition of an amenable set does not include replacement, some very limited amount of replacement follows from the axioms given. For example, for all $x,y\in M$, it must be that $\{\{z,w\}|z\in x, w\in y\}\in M$ and $\{\{z\}|z\in x\}\in M$. So just how limited is the replacement in amenable sets? In particular,</p> <blockquote> <p>If $M$ is an amenable set and $x\in M$, does it follow that $\{\bigcup z | z \in x\} \in M$?</p> </blockquote> http://mathoverflow.net/questions/114945/mutually-tangent-ellipsoids-in-3-space Comment by Linda Brown Westrick Linda Brown Westrick 2012-12-01T01:33:13Z 2012-12-01T01:33:13Z Thanks for the comments and ideas. I added in what I mean by kissing, which, as many guessed, includes disjoint interiors. If I should have used another word, please let me know! http://mathoverflow.net/questions/65911/when-checking-if-a-harmonic-function-is-continuous-on-its-boundary-is-a-dense-su Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-27T02:07:24Z 2011-05-27T02:07:24Z Thank you. I only knew of the Poisson extension for continuous functions, but it seems that it works for $L^p$ more generally. Is there a standard reference for the Poisson extension for $L^p$ functions? http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable/65925#65925 Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-25T22:43:07Z 2011-05-25T22:43:07Z @Yakov Ah, thank you. http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable/65925#65925 Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-25T22:36:17Z 2011-05-25T22:36:17Z @Nilima Yes, I would be very interested in a simple characterization that works only for the plane. Geometric conditions are often the right kind of simple. Now to be more specific about &quot;simple&quot;: most of math can be formalized in Second Order Arithmetic; see <a href="http://en.wikipedia.org/wiki/Second-order_arithmetic" rel="nofollow">en.wikipedia.org/wiki/Second-order_arithmetic</a> for its syntax. The formula which says &quot;G is a Dirichlet Region&quot; has two set quantifiers (for all continuous $f$, there exists a harmonic $u$ such that...). Reduction to a single set quantifier would be useful, and an arithmetic characterization would be especially simple. http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable/65925#65925 Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-25T21:58:32Z 2011-05-25T21:58:32Z @Will I think I found the theorem from McKernan you mentioned at <a href="http://www.math.ucsb.edu/~mckernan/Teaching/06-07/Spring/202C/l_5.pdf" rel="nofollow">math.ucsb.edu/~mckernan/Teaching/06-07/Spring/&hellip;</a> and it is a nice sufficient condition, but there is no claim there that it is necessary. (note: Theorem 5.5 is found in a set of McKernan's lecture notes, and no attribution is given there.) It would be interesting to see an example of a Dirichlet Region which did not meet this condition. http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable/65925#65925 Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-25T21:39:07Z 2011-05-25T21:39:07Z @Yakov There is a discrepancy between the cusp failure-example you are offering and Corollary X.4.18 of Conway's <i>Functions of One Complex Variable I</i>, which asserts that &quot;a simply connected region is a Dirichlet Region&quot;. I am not familiar enough with potentials to be able to follow the example you referenced from Jost, but since I can see that the region is simply connected, perhaps there is some difference in the context between Jost and Conway. http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-25T20:45:01Z 2011-05-25T20:45:01Z Thanks to those who have offered elegant sufficient conditions. But as Will suggested, I am indeed interested in exactly classifying the &quot;always&quot; regions. My interest is from mathematical logic. When I come across an unwieldy characterization which has resisted simplification for a long time, I often wonder if that unwieldiness is unavoidable. In logical terms, what I mean by unwieldiness can be made precise: the definition of a Dirichlet Region is syntactically $\Pi^1_2$, and on its face the barrier characterization is also syntactically $\Pi^1_2$; i.e. just as complicated. http://mathoverflow.net/questions/65906/characterize-where-the-dirichlet-problem-for-the-laplacian-is-always-solvable/65925#65925 Comment by Linda Brown Westrick Linda Brown Westrick 2011-05-25T20:20:57Z 2011-05-25T20:20:57Z @Nilima Thank you for your argument which shows why the boundary regularity condition characterizes the Dirichlet Regions. My question is asking something different, though. The boundary regularity condition, while necessary and sufficient, is a complicated condition. I am wondering if someone has found a simpler condition which also characterizes the Dirichlet Regions. http://mathoverflow.net/questions/43950/meaning-of-subset-notation/43953#43953 Comment by Linda Brown Westrick Linda Brown Westrick 2010-10-30T19:30:06Z 2010-10-30T19:30:06Z It sounds like this answer is the consensus. Thanks all! http://mathoverflow.net/questions/43950/meaning-of-subset-notation/43953#43953 Comment by Linda Brown Westrick Linda Brown Westrick 2010-10-28T18:31:13Z 2010-10-28T18:31:13Z Taking this answer as a starting point and comparing it with the examples I just added, it seems a related possibility for $U\Subset V$ might be &quot;$U$ has a neighborhood which is compactly contained in $V$&quot;. Has anyone seen it used this way?