You are determining probabilities using a visual aid. Which visual aid would be most effective for finding the compound probability of picking a blue marble out of a hat with multiple colors of marbles and rolling a prime number on a die?
@James You can try - but there is no guarantee that somebody will know the answer. (There is also category theory chatroom - but it has virtually no activity.)
Ok so I'm trying to understand the definition of a Comma category (en.wikipedia.org/wiki/Comma_category). I'm confused because I don't understand why it's necessary for the diagram in the article to commute (i.e. why T(g) o h = h' o S(f) )
If you look at some special cases, for example slice category, then this condition looks quite natural, doesn't it?
In the case of slice category you want to have morphisms between "morphisms ending in A_*".
Without the condition the the diagram commute, you would get all morphisms between A and A' and the relationship between them and pi_A, pi_{A'} would be lost.
For other special cases mentioned in the WP article you linked (coslice category, arrow category), the requirement that we want the diagram to commute seems rather natural, too.
I suppose that's the best I can do. (I did not work with comma categories, although I have seen the definition before.) Maybe somebody else will be able to explain this better or have some better insight.
Hello everyone, I have a function that maps from Lie algebra se(3) to R (not sure if it's a necessary detail). I need to linearise the function using Taylor expansion. How can I verify if my derivative is correct or not? I guess one way to check can be to see if the linear approximation is close to the actual value, but I'm not sure how close should it actually be.
Sorry if it's off-topic, I really hope someone can help me out as it's been driving me nuts for a few days now
Let’s say I have a monoid on a class of partial functions with a “combine” operation $f(x) \diamond g(x) = \left\{\begin{array}{l}f(x) \text{ when } f(x) \text{ is defined} \\g(x) \text{ otherwise}\end{array}\right$. How do you call a property that distinguishes the operation from $f(x) \diamond g(x) = \left\{\begin{array}{l}g(x) \text{ when } g(x) \text{ is defined} \\f(x) \text{ otherwise}\end{array}\right$?
I was searching for a “direction” and “bias” but was not able to find any concrete jargon.
Since the TeX does not render, I am looking for a name of property that distinguishes these two operations: f(x) ⋄ g(x) = g(x) when g(x) is defined; f(x) otherwise f(x) ⋄ g(x) = f(x) when f(x) is defined; g(x) otherwise
I feel like this is too trivial for a question but can still open one.
@JanTojnar You need to have something after right to get that rendered correctly.
This should work:
$f(x) \diamond g(x) = \left\{\begin{array}{l}f(x) \text{ when } f(x) \text{ is defined} \\g(x) \text{ otherwise}\end{array}\right.$
$f(x) \diamond g(x) = \left\{\begin{array}{l}g(x) \text{ when } g(x) \text{ is defined} \\f(x) \text{ otherwise}\end{array}\right.$
All I added was the dot after \right.
For instructions how to render MathJax(TeX) in chat see this post on meta or go directly to robjohn's website. (Sorry for the digression from your problem towards TeX-nical issues.)
Consider a polynomial $f(\lambda)$ in $\lambda$. "If it takes value zero in an open interval on $\mathbb{R}$, the polynomial is identically zero." This is a result which we often. Can anyone give me an idea for proving this?
And, if the polynomial takes a value zero for some countable values of $\lambda$. Then what can we say in this regard?
@MartinSleziak I suppose intuitively the commutativity conditions are there in order to guarantee some image of the original function in the new one it gets mapped to.
This follows from the fact that a degree $n$ polynomial has at most $n$ roots. To prove this, exploit the correspondence between the roots of a polynomial and its linear factors.
@Bhargob Polynomials can only have finitely many roots. In fact, if the polynomial has degree $n$, there can be at most $n$ values of $\lambda$ with $f(\lambda)=0$. (Proof: If $f(c) = 0$, then $\lambda-c$ has to be a factor of $f$. Divide and continue ...)
Oops. I didn't notice that Thorgott already said this. Well, now you have it twice.
So is there any (natural) condition weaker than being polynomial that implies being zero as soon as it has an infinite number of zeroes? What if we require those zeroes to be within a bounded interval?
@TedShifrin If $f(x)=c_0+c_1(x-a)+\dots+c_n(x-a)^n$ and $f=0$ in a nbhd of $a$, then $c_0=c_1=\dots=c_k=0$ for a maximal $k$. Factor out $(x-a)^{k+1}$ to get $f(x)=(x-a)^{k+1}(c_{k+1}+\dots+c_n(x-a)^{n-k-1})$. The factor $(x-a)^{k+1}$ is nonzero for any $x\ne a$. The polynomial $c_{k+1}+\dots+c_n(x-a)^{n-k-1}$ is thus zero in a punctured nbhd of $a$.
@TedShifrin This is just a contradiction (assuming to start that $f\ne 0$). $c_{k+1}\ne 0$ by hypothesis, but it would have to be zero given the continuity of polynomials.
I need to choose a branch of $f(z) = z^{-2/3}(1-z)^{-1/3}$ such that $f$ is holomorphic on $\mathbb C \setminus [0,1]$. The solution does the following:
"Imposing the restrictions $0 < \arg z < 2\pi$ and $0 < \arg(z-1) < 2\pi$, we obtain:
$z^{-2/3} = \text{algebra} = |z|^{-2/3} e^{-2/3 i \arg z}$ and
$(1-z)^{-1/3} = e^{-1/3} \log(1-z) = |1-z|^{-1/3} e^{-1/3 i \arg (1-z)} = |1-z|^{-1/3} e^{-i\pi/3}}e^{-1/3 i \arg(z-1)}}$
You want to analyze what happens to the function as you go around a little circle around $z=0$ and around a little circle at $z=1$ (this is like the usual keyhole path).
The point should be to make sure that going around both brings $f$ back to its original value.
@TobiasKildetoft it's the identity principle, often it is phrased as "two holomorphic functions that agree on an open set are equal", but it's really enough for the set to have an accumulation point
@AlessandroCodenotti Ahh, I had somehow not put together in my mind that an infinite number of elements in a bounded interval will have an accumulation point
Okay so this works for $\mathbb C \setminus [0,+\infty)$ and then he says we show that the limit coming from the positive imaginary direction and the negative imaginary direction agree
To prove that every open subset $U$ of $\mathbb{R}^n$ is a union of open balls without using choice would it suffy to use $U = \bigcup \{B_R(x),\, x \in U\}$, where $R$ is the maximum of all balls that lie in $U$ with center at $x$: $R = \mbox{sup} \{r \in \mathbb{R}_>0 | B_r(x) \subset U\}.$ That's assuming that for every point we have a finite supremum, but otherwise $U$ would equal $R^n$.
As I go counterclockwise around a little circle at $0$, $z^{2/3}$ changes by a factor of $e^{4\pi i/3}$. As I go counterclockwise around a little circle at $1$, $(z-1)^{1/3}$ changes by a factor of $e^{2\pi i/3}$.
@famesyasd If you really wanted to carry out your construction, use $R/2$ rather than $R$. Note, however, that it only appears to need the axiom of choice to do the usual argument. For, just write $\bigcup\{B:\text{B is an open ball and $B\subset U$}\}$. Then, prove in the usual way that $U$ is that union.
$$I = \int \limits_{a}^{b} \sqrt{1+y'^2} \, dx$$ is always finite for a arc.
@Ultradark Sorry, please refer to your last text, you mentioned 'arc' which I assume it to be a part of a circle which is always supposed to be finite under a given interval.
@J.Doe I know how to evaluate the integral, just wondering why the series doesn't works for $|a|>1$...
My bad @AbhasKumarSinha I didn't realise. What you did inferring that oscillating sum is 0 is textbook definition of dodgy though. Couldn't you argue that it's also sin(x) by re-bracketing after the first term?
No, 259 is not a prime number. The list of all positive divisors (i.e., the list of all integers that divide 259) is as follows: 1, 7, 37, 259. To be 259 a prime number, it would have been required that 259 has only two divisors, i.e., itself and 1.
@TedShifrin Suppose now I consider a power series which is taking value zero for a countable (say for $\mathbb{N}$) number of points. Thus it imply that the power series is also zero?
@Bhargob This is not the correct statement. You need a countable set of points that have a limit point somewhere. For example, $\sin x$ vanishes at every multiple of $2\pi$. ... At any rate, you need to say convergent power series and be talking about what happens in its domain of convergence.
@Vrouvrou: It really is not polite to ping random people in the room with questions that might not be of interest to them. I do have one comment on your question: Ordinarily in this situation, if you start with a real differential equation, the real and imaginary parts of your solution should give (usually linearly independent, I believe) solutions, and a general linear combination of them gives the general real solution.
Consider $y''+y=0$ with solutions $e^{ix}$ and $e^{-ix}$. The general real solution is a linear combination of the real part $\cos x$ and the imaginary part $\pm \sin x$.