Sunday, July 2, 2017

trigonometry - How can we sum up $sin$ and $cos$ series when the angles are in arithmetic progression?


How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:


$$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$


There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2 a + (n-1)\cdot d}{2}\biggr)$$


How do we prove the above two identities?



Answer



Let $$ S = \sin{(a)} + \sin{(a+d)} + \cdots + \sin{(a+nd)}$$ Now multiply both sides by $\sin\frac{d}{2}$. Then you have $$S \times \sin\Bigl(\frac{d}{2}\Bigr) = \sin{(a)}\sin\Bigl(\frac{d}{2}\Bigr) + \sin{(a+d)}\cdot\sin\Bigl(\frac{d}{2}\Bigr) + \cdots + \sin{(a+nd)}\cdot\sin\Bigl(\frac{d}{2}\Bigr)$$


Now, note that $$\sin(a)\sin\Bigl(\frac{d}{2}\Bigr) = \frac{1}{2} \cdot \biggl[ \cos\Bigl(a-\frac{d}{2}\Bigr) - \cos\Bigl(a+\frac{d}{2}\Bigr)\biggr]$$ and $$\sin(a+d) \cdot \sin\Bigl(\frac{d}{2}\Bigr) = \frac{1}{2} \cdot \biggl[ \cos\Bigl(a + d -\frac{d}{2}\Bigr) - \cos\Bigl(a+d+\frac{d}{2}\Bigr) \biggr]$$


Then by doing the same thing you will have some terms cancelled out. You can easily see which terms are going to get Cancelled. Proceed and you should be able to get the formula.


I tried this by seeing this post. This has been worked for the case when $d=1$. Just take a look here:


combinatorics - Combinatorial identity's algebraic proof without induction.


How would you prove this combinatorial idenetity algebraically without induction?


$$\sum_{k=0}^n { x+k \choose k} = { x+n+1\choose n }$$


Thanks.


Answer



Here is an algebraic approach. In order to do so it's convenient to use the coefficient of operator $[z^k]$ to denote the coefficient of $z^k$ in a series. This way we can write e.g. \begin{align*} \binom{n}{k}=[z^k](1+z)^n \end{align*}



We obtain


\begin{align*} \sum_{k=0}^{n}\binom{x+k}{k}&=\sum_{k=0}^{n}\binom{-x-1}{k}(-1)^k\tag{1}\\ &=\sum_{k=0}^n[z^k](1+z)^{-x-1}(-1)^k \tag{2}\\ &=[z^0]\frac{1}{(1+z)^{x+1}}\sum_{k=0}^n\left(-\frac{1}{ z }\right)^k\tag{3}\\ &=[z^0]\frac{1}{(1+z)^{x+1}}\cdot \frac{1-\left(-\frac{1}{z}\right)^{n+1}}{1-\left(-\frac{1}{z}\right)}\tag{4}\\ &=[z^n]\frac{z^{n+1}+(-1)^n}{(1+z)^{x+2}}\tag{5}\\ &=(-1)^n[z^n]\sum_{k=0}^\infty\binom{-x-2}{k}z^k\tag{6}\\ &=(-1)^n\binom{-x-2}{n}\tag{7}\\ &=\binom{x+n+1}{n}\tag{8} \end{align*} and the claim follows.




Comment:



  • In (1) we use the binomial identity $\binom{-p}{q}=\binom{p+q-1}{q}(-1)^q$.




  • In (2) we apply the coefficient of operator.




  • In (3) we do some rearrangements by using the linearity of the coefficient of operator and we also use the rule \begin{align*} [z^{p-q}]A(z)=[z^p]z^{q}A(z) \end{align*}





  • In (4) apply the formula for the finite geometric series.




  • In (5) we do some simplifications and use again the rule stated in comment (3).




  • In (6) we use the geometric series expansion of $\frac{1}{(1+z)^{x+2}}$. Note that we can ignore the summand $z^{n+1}$ in the numerator since it has no contribution to the coefficient of $z^n$.





  • In (7) we select the coefficient of $z^n$.




  • In (8) we use the rule stated in comment (1) again.



Roots of a Polynomial Minus It's Constant Term



Suppose we have a sequence of integers $a_1,\dots,a_n$. Is there any way to determine the roots of the polynomial




$$P(x) = (x+a_1)\dots(x+a_n) - a_1\dots a_n$$



Clearly $P(0) = 0$, but can anything be said about the other roots? Can they be expressed in some way related to the original integers $a_1,\dots,a_n$?



Any answer or reference would be appreciated.



Edit: If need be, you may assume $a_i|a_{i+1}$ for all $i$.



Comment: The new roots need not be integers. I would be satisfied with finding complex roots.


Answer




It doesn't appear to be easier than solving a polynomial of degree $n-1$ "from scratch". For example, if $Q(x) = (x+1)(x+2)(x+4)(x+8)(x+16)(x+32)$, the Galois group of $$P(z)/z = (Q(z)-Q(0))/z = z^5 + 63 z^4 + 1302 z^3 + 11160 z^2 + 41664 z + 64512$$ is $S_5$, so this is not solvable by radicals.



On the other hand, it may be interesting to look at the roots of $Q(x) - t$ as functions of $t$: these are analytic except at the points where they collide (the roots of the discriminant of $Q(x)-t$), which can be branch points.
In the above example, the root that is $-32$ at $t=0$ has the Maclaurin series
$$ -32-{\frac {1}{9999360}}t+{\frac {1189}{578592599703552000}}{t}^{2}-{
\frac {5752091}{84743927083111118222131200000}}{t}^{3}+{\frac {
28255922633}{10460874099698222880422457709166592000000}}{t}^{4}-{
\frac {8129746966487}{
68399931666747186847737020565295881781248000000000}}{t}^{5}
+\ldots$$

I believe this has radius of convergence approximately $1.61741 \times 10^7$ (one of the roots of that discriminant), so it should certainly converge quite nicely at $t=Q(0)$.


Saturday, July 1, 2017

real analysis - Limit using Poisson distribution




Show using the Poisson distribution that



$$\lim_{n \to +\infty} e^{-n} \sum_{k=1}^{n}\frac{n^k}{k!} = \frac {1}{2}$$


Answer



By the definition of Poisson distribution, if in a given interval, the expected number of occurrences of some event is $\lambda$, the probability that there is exactly $k$ such events happening is
$$
\frac {\lambda^k e^{-\lambda}}{k!}.

$$
Let $\lambda = n$. Then the probability that the Poisson variable $X_n$ with parameter $\lambda$ takes a value between $0$ and $n$ is
$$
\mathbb P(X_n \le n) = e^{-n} \sum_{k=0}^n \frac{n^k}{k!}.
$$
If $Y_i \sim \mathrm{Poi}(1)$ and the random variables $Y_i$ are independent, then $\sum\limits_{i=1}^n Y_i \sim \mathrm{Poi}(n) \sim X_n$, hence the probability we are looking for is actually
$$
\mathbb P\left( \frac{Y_1 + \dots + Y_n - n}{\sqrt n} \le 0 \right) = \mathbb P( Y_1 + \dots + Y_n \le n) = \mathbb P(X_n \le n).
$$
By the central limit theorem, the variable $\frac {Y_1 + \dots + Y_n - n}{\sqrt n}$ converges in distribution towards the Gaussian distribution $\mathscr N(0, 1)$. The point is, since the Gaussian has mean $0$ and I want to know when it is less than equal to $0$, the variance doesn't matter, the result is $\frac 12$. Therefore,

$$
\lim_{n \to \infty} e^{-n} \sum_{k=0}^{n} \frac{n^k}{k!} = \lim_{n \to \infty} \mathbb P(X_n \le n) = \lim_{n \to \infty} \mathbb P \left( \frac{Y_1 + \dots + Y_n - n}{\sqrt n} \le 0 \right) = \mathbb P(\mathscr N(0, 1) \le 0) = \frac 12.
$$



Hope that helps,


real analysis - How discontinuous can a derivative be?


There is a well-known result in elementary analysis due to Darboux which says if $f$ is a differentiable function then $f'$ satisfies the intermediate value property. To my knowledge, not many "highly" discontinuous Darboux functions are known--the only one I am aware of being the Conway base 13 function--and few (none?) of these are derivatives of differentiable functions. In fact they generally cannot be since an application of Baire's theorem gives that the set of continuity points of the derivative is dense $G_\delta$.


Is it known how sharp that last result is? Are there known Darboux functions which are derivatives and are discontinuous on "large" sets in some appropriate sense?



Answer



What follows is taken (mostly) from more extensive discussions in the following sci.math posts:


http://groups.google.com/group/sci.math/msg/814be41b1ea8c024 [23 January 2000]


http://groups.google.com/group/sci.math/msg/3ea26975d010711f [6 November 2006]


http://groups.google.com/group/sci.math/msg/05dbc0ee4c69898e [20 December 2006]


Note: The term interval is restricted to nondegenerate intervals (i.e. intervals containing more than one point).


The continuity set of a derivative on an open interval $J$ is dense in $J.$ In fact, the continuity set has cardinality $c$ in every subinterval of $J.$ On the other hand, the discontinuity set $D$ of a derivative can have the following properties:



  1. $D$ can be dense in $\mathbb R$.





  2. $D$ can have cardinality $c$ in every interval.




  3. $D$ can have positive measure. (Hence, the function can fail to be Riemann integrable.)




  4. $D$ can have positive measure in every interval.





  5. $D$ can have full measure in every interval (i.e. measure zero complement).




  6. $D$ can have a Hausdorff dimension zero complement.




  7. $D$ can have an $h$-Hausdorff measure zero complement for any specified Hausdorff measure function $h.$



More precisely, a subset $D$ of $\mathbb R$ can be the discontinuity set for some derivative if and only if $D$ is an $F_{\sigma}$ first category (i.e. an $F_{\sigma}$ meager) subset of $\mathbb R.$


This characterization of the discontinuity set of a derivative can be found in the following references: Benedetto [1] (Chapter 1.3.2, Proposition, 1.10, p. 30); Bruckner [2] (Chapter 3, Section 2, Theorem 2.1, p. 34); Bruckner/Leonard [3] (Theorem at bottom of p. 27); Goffman [5] (Chapter 9, Exercise 2.3, p. 120 states the result); Klippert/Williams [7].



Regarding this characterization of the discontinuity set of a derivative, Bruckner and Leonard [3] (bottom of p. 27) wrote the following in 1966: Although we imagine that this theorem is known, we have been unable to find a reference. I have found the result stated in Goffman's 1953 text [5], but nowhere else prior to 1966 (including Goffman's Ph.D. Dissertation).


Interestingly, in a certain sense most derivatives have the property that $D$ is large in all of the ways listed above (#1 through #7).


In 1977 Cliff Weil [8] published a proof that, in the space of derivatives with the sup norm, all but a first category set of such functions are discontinuous almost everywhere (in the sense of Lebesgue measure). When Weil's result is paired with the fact that derivatives (being Baire $1$ functions) are continuous almost everywhere in the sense of Baire category, we get the following:


(A) Every derivative is continuous at the Baire-typical point.


(B) The Baire-typical derivative is not continuous at the Lebesgue-typical point.


Note that Weil's result is stronger than simply saying that the Baire-typical derivative fails to be Riemann integrable (i.e. $D$ has positive Lebesgue measure), or even stronger than saying that the Baire-typical derivative fails to be Riemann integrable on every interval. Note also that, for each of these Baire-typical derivatives, $\{D, \; {\mathbb R} - D\}$ gives a partition of $\mathbb R$ into a first category set and a Lebesgue measure zero set.


In 1984 Bruckner/Petruska [4] (Theorem 2.4) strengthened Weil's result by proving the following: Given any finite Borel measure $\mu,$ the Baire-typical derivative is such that the set $D$ is the complement of a set that has $\mu$-measure zero.


In 1993 Kirchheim [5] strengthened Weil's result by proving the following: Given any Hausdorff measure function $h,$ the Baire-typical derivative is such that the set $D$ is the complement of a set that has Hausdorff $h$-measure zero.


[1] John J. Benedetto, Real Variable and Integration With Historical Notes, Mathematische Leitfäden. Stuttgart: B. G. Teubne, 1976, 278 pages. [MR 58 #28328; Zbl 336.26001]


[2] Andrew M. Bruckner, Differentiation of Real Functions, 2nd edition, CRM Monograph Series #5, American Mathematical Society, 1994, xii + 195 pages. [The first edition was published in 1978 as Springer-Verlag's Lecture Notes in Mathematics #659. The second edition is essentially unchanged from the first edition with the exception of a new chapter on recent developments (23 pages) and 94 additional bibliographic items.] [MR 94m:26001; Zbl 796.26001]



[3] Andrew M. Bruckner and John L. Leonard, Derivatives, American Mathematical Monthly 73 #4 (April 1966) [Part II: Papers in Analysis, Herbert Ellsworth Slaught Memorial Papers #11], 24-56. [MR 33 #5797; Zbl 138.27805]


[4] Andrew M. Bruckner and György Petruska, Some typical results on bounded Baire $1$ functions, Acta Mathematica Hungarica 43 (1984), 325-333. [MR 85h:26004; Zbl 542.26004]


[5] Casper Goffman, Real Functions, Prindle, Weber & Schmidt, 1953/1967, x + 261 pages. [MR 14,855e; Zbl 53.22502]


[6] Bernd Kirchheim, Some further typical results on bounded Baire one functions, Acta Mathematica Hungarica 62 (1993), 119-129. [94k:26008; Zbl 786.26002]


[7] John Clayton Klippert and Geoffrey Williams, On the existence of a derivative continuous on a $G_{\delta}$, International Journal of Mathematical Education in Science and Technology 35 (2004), 91-99.


[8] Clifford Weil, The space of bounded derivatives, Real Analysis Exchange 3 (1977-78), 38-41. [Zbl 377.26005]


calculus - Limit of $left(frac{x^2+5x+3}{x^2+x+3}right)^x$



We have to evaluate:
$$\lim\limits_{x\to\infty} \left(\frac{x^2+5x+3}{x^2+x+3}\right)^x$$






My work:



Let the desired limit equal a constant $L$.




When I take $\log$ of both sides, the exponent $x$ comes down. What do I do now? Where will we apply L'Hopital's rule? Can we do it without the rule also?



The answer is $e^4$.


Answer



$$\ln\left(\lim_{x\to +\infty}\left(\frac{x^2+5x+3}{x^2+x+3}\right)^x\right)=\lim_{x\to +\infty}\left(x(\ln(x^2+5x+3)-\ln(x^2+x+3))\right)$$



$$=\lim_{x\to +\infty}\frac{\ln(x^2+5x+3)-\ln(x^2+x+3)}{\frac{1}{x}}$$



$$\stackrel{\text{L'Hop}}=\lim_{x\to +\infty}\frac{\frac{2x+5}{x^2+5x+3}-\frac{2x+1}{x^2+x+3}}{-\frac{1}{x^2}}$$




$$=\lim_{x\to +\infty}\left(\frac{x^2(2x+1)}{x^2+x+3}-\frac{x^2(2x+5)}{x^2+5x+3}\right)$$



$$=\lim_{x\to +\infty}\frac{4x^2(x^2-3)}{(x^2+x+3)(x^2+5x+3)}$$



$$=\lim_{x\to +\infty}\frac{4(1-\frac{3}{x^2})}{(1+\frac{1}{x}+\frac{3}{x^2})(1+\frac{5}{x}+\frac{3}{x^2})}=4$$


algebra precalculus - How to prove: $-frac{1}{sec2x}=frac{cos^3x-sin^3x}{cos x +sin x}+frac{cos2x}{(cos x +sin x)^2}$

How do you do it?
I'm really stuck on this proof. Can someone please explain? Thanks

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...