I was stucked at $f(0)=3$ $|f(0)|\leq 3$ can be proved using Cauchy-schwartz inequality. I am unable to prove $f(0)=3$.I even substitute the values $T^\star(0)=AT(0)$,$N^\star(0)=AN(0)$ and $B^\star(0)=AB(0)$ in the $f(0)$ expression. I was unable to reduce the expression. Could you give me hint?
If $\tilde{T}(0)={T}^\star(0)$,$\tilde{N}(0)={N}^\star(0)$ and $\tilde{B}(0)={B}^\star(0)$. I can say $f(0)=3$. Here all the unit vectors are different. How did the author got $f(0)=3$?
Zygmund's example is the discrete random variable $X$ where
$\mathbb{P}(X=\pm n) = \frac{C}{n^2\log(n)}$ for integer $n \geq 2$. $C$ is a unique constant that makes this a probability distribution. You can calculate that $X$ does not have a finite first moment because
$$\mathbb{E}(|X|)= \sum_{n=2...
I want to compute asymptotic approximations to partial sum of harmonic series in Mathematica, using Euler-Maclaurin summation formula.
f[x_] := 1/x
em[n_] := Integrate[f[x], {x, 1, n}]
+ (f[1] + f[n])/2
+ Sum[BernoulliB[2k]/(2k)! ((D[ f[x], {x, 2 k - 1}] /. x -> n)
- D[f[x], {x, 2 k ...
I'm looking to compute the sup-norm of $f_n(x)=\frac{2x}{1+nx^2}$ over $[0,\infty)$. The derivative of $f_n(x)$ is $\frac{2(1-nx^2)}{(1+nx^2)^2}$. Setting it to zero, yields $x=\pm \frac{1}{\sqrt{n}}$, so $x=\frac{1}{\sqrt{n}}$ is a critical point of interest, where we have $f_n\left(\frac{1}{\sqrt{n}}\right)=\frac{1}{\sqrt{n}}$. At $x=0$, we have $f_n(0)=0$. In the limit that $x$ tends to infinity, we have that $f_n(x)$ tends to $0$. Is $x=\frac{1}{\sqrt{n}}$ necessarily a maximum? Why?
According to the extreme value theorem, a continuous function on a compact set attains a maximum and minimum on that set, however, here we are dealing with $[0,\infty)$, so there's some uncertainty regarding whether or not the function attains a maximum/minimum or not.
No. If $E$ is the algebraic closure of the field $\Bbb{F}_p$, then we can think of $E$ as the nested union
$$K_0\subset K_1\subset K_2\subset \cdots,$$
where the field $K_\ell$ is th unique (up to isomorphism) field of $p^{\ell!}$ elements.
Then $E=\bigcup_{i=0}^\infty K_i$ is a countably infinit...
it doesn't, it can even be that the left side is greater than the right side
@sunny could we argue like this? Surely, $f_n\left(\frac{1}{\sqrt{n}}\right)=\frac{1}{\sqrt{n}}$ is not a minimum, since $f_n(0)=0$. Neither is it a saddle point, for if it where, then there'd be some $a$ such that $f_n(a)>f_n\left(\frac{1}{\sqrt{n}}\right)$. Since $f_n(x)$ approaches $0$ as $x\to\infty$, there must be another critical point $c$ in addition to $x=\frac{1}{\sqrt{n}}$, but there is none. So $x=\frac{1}{\sqrt{n}}$ has to be the maximum. Grateful for any response on this.
This is concerning (part of) Exercise 5.4.5 and Exercise 5.4.6 of Robinson's, "A Course in the Theory of Groups (Second Edition)".
I have done the first one; the second might take me a while.
The Details:
The dihedral group is given by the presentation
$$D_{2n}\cong \langle r,s\mid r^n, s^2, srs=...
@Unknownx Your first sentence is correct. Why are all the unit vectors different? You're missing the whole point of the construction.
@sunny Once and for all, you should prove the following. If $f$ is positive on an open interval (for example, $(a,b)$) and approaches $0$ at the boundary, then $f$ has a global maximum. You want to choose an appropriate closed interval $[c,d]\subset (a,b)$ and apply the extreme value theorem on $[c,d]$. If you've chosen the subinterval correctly, it will follow immediately that that is the maximum point for all of $(a,b)$.
@sunny you can argue based on the sign of the derivative of $f_n$ in $[0, 1/\sqrt{n}]$ and in $[1/\sqrt{n}, \infty)$. It tells you $f_n$ needs to increase, then decrease. So $1/\sqrt{n}$ is a maximum.
@robjohn I have not written other code for the Euler Maclaurin summation formula than this one for the Riemann zeta function: pastebin.com/QebeXVXD And that also i copied from the french site numbers.free about the Riemann zeta function.
Today I asked bing chat GPT to write a program for computing the Euler Maclaurin summation formula as a Mathematica program. It did write something but the program failed. It was not accurate.
@PNDas the expectation (or integral) is not defined unless $|X|$ is integrable. You can make special cases, such as $X \ge 0$, but in general, absolute integrability is required to avoid infinities of opposite directions.
expectation is based on Lebesgue theory of integral and there we can define $\mathbb{E}X$ if $\mathbb{E}X_-$ or $\mathbb{E}X_+$ is finite where $X_- = \max(0, -X)$ and $X_+ = \max(0, X)$
but in general when $\mathbb{E}|X|$ is infinite then even if one of those quantities is finite then $\mathbb{E}X$ won't be, so we can say it doesn't exist (well technically it's infinite if one of those is finite, but still...)
I'm not really excluding that people are using other types of integration in probability when necessary, though I never really heard of anything like that.
Weierstraß polynomials. To get at the deeper properties of the ring $\mathcal{O}_n$, we have to study the local structure of holomorphic functions more carefully. We will proceed by induction on $n \geq 0$, by using the inclusions of rings $\mathcal{O}_{n−1} \subseteq \mathcal{O}_{n−1}[z_n] \subseteq \mathcal{O}_n$.
I have some doubts here, we are considering the set of germs at the origin in $\Bbb{C}^n$. So we can have $\mathcal{O}_n$, but how are we defining $\mathcal{O}_{n-1}$ at the origin in $\Bbb{C}^n$
@TedShifrin Conversaly, We assume $\kappa=kappa^\star$ and $\tau=tau^\star$. We need to prove corresponding curves $C$ and $C^\star$ are congruent. Right?
@TedShifrin I am a little confused, what is the ambient space where we are defining these germs, for $\mathcal{O}_n$, this is germs of holo fns in $n$ variables, for $\mathcal{O}_{n-1}$, this is germs of holo fns in $n-1$ variables. When we are writing them as one is subset of other then what is the underlying space and points we are working at?
@SoumikMukherjee You’re working inductively/recursively. Just like you can think of a polynomial in $x,y$ as a poly in $y$ with coefficients that are polynomials in $x$.
We now define a rigid motion $Ψ$ as follows. Let $b = α^∗(0) − α(0)$, and let $A$ be the unique orthogonal matrix so that $AT(0) = T^∗(0), AN(0) = N^∗(0),$ and $AB(0) = B^∗(0).$. This is your statement in the beginning.
Could you tell me where I miss the idea?
Atleast give me hints.
$\tilde{T}(0)\cdot{T}^\star(0)=(A\alpha'(0)+(\alpha^\star(0) − \alpha(0)))\cdot A \alpha'(0)$. Am I correct?
@Thorgott I have two propositions and I'm wondering how close they are too each other. The first one says that a finite extension $K/F$ is Galois iff $[K:F] = |\text{Gal}(K/F)|$. The second says that if $F$ is a fixed field of a finite group $G$ of automorphisms of $K$, then $|G| = [K:F]$.
Of course, the second one helps to get the first one, but I'm wondering if I need to care about the second one
Since you're in $\mathbb{R}$ we could define something like the "principal value" $p.v. E[X] = \lim_{n\to \infty} E[X1_{[-n, n]}]$ and that would make sense I suppose
but it does use that we are in $\mathbb{R}$ pretty explicitly
Writing $\mathbb{E}[X]$ in this case is strange since e.g. it doesn't give you how you should order your summation, defining it in this case is problematic, for Lebesgue integrals what we care is absolute convergence
So I'll be there, and I'll fill in some Q&A's when I study. I think each time you have a question that you have to research, we should put it in Teams, that way future readers will be accelerated in a way
So maybe I won't require book purchase, but just say that it's highly recommended and that pirate copies are not allowed
I'm still at that conference, by the way. I have to get up early tomorrow. The afternoon is left free, so they've crammed in a bunch of lectures in the morning. I should try & sleep soon.
The question is simply asking why $\int_{[0,1]}1\,\mathrm{d}t=\int_0^11\,\mathrm{d}t=1$ instead of $\int_{[0,1]}1\,\mathrm{d}t=\int_1^01\,\mathrm{d}t=-1$.
which could be confusing when one starts path integration.