Posts

Sequences and subsequences, Part IV

Recall from part III that we are using the following notation, which may not be entirely standard: Let $X$ be a non-empty set, and let $(x_n)_{n\in \N}$ be a sequence of elements of $X$. Given positive integers $n_1<n_2<n_3<\cdots$, define the infinite set $A \subseteq \N$ by $A=\{n_1,n_2,n_3,\dots\}$. Then $(x_n)_{n\in A}$ denotes the subsequence $x_{n_1}, x_{n_2}, x_{n_3},\dots$ of $(x_n)$. Note (again) that we are working with a one to one correspondence between infinite subsets of $\N$ and strictly increasing sequences of natural numbers here, and so every subsequence of $(x_n)$ does have this form. (However, with our conventions, if the sequence $(x_n)$ has repeats, then different subsets of $\N$ might give the same subsequence.) Note also that if $A=\N$ then (to our relief) the notation $(x_n)_{n\in A}$ is unambiguously equal to the original sequence $(x_n)_{n\in \N}$. Now let's look at convergence of sequences of real numbers and connections with subsets of $\N$. (A...

Sequences and subsequences, Part III

 Recall from Part II Definition of subsequence Let $X$ be a non-empty set, and let $(x_n)_{n\in\N}$ be a sequence of elements of $X$. Then a subsequence of $(x_n)$ is a sequence of the form $x_{n_1},x_{n_2},x_{n_3},\dots$, where $(n_k)_{k\in\N}$ is a strictly increasing sequence of natural numbers. The subsequence can also be written as $(x_{n_k})_{k\in\N}$, always remembering that we require that $n_1<n_2<n_3<\cdots$. In this setting, as discussed last time, we may apply the definition above to the sequence $(n_k)_{k\in\N}$, and we see that $(n_k)_{k\in\N}$ is a subsequence of the sequence of  $1,2,3,\dots$. Now let us revisit this in terms of functions from $\N$ to $X$ and functions from $\N$ to $\N$. We can define $f:\N\to X$ by $f(n)=x_n$, and we can define $g:\N\to\N$ by $g(k)=n_k$. Then $g$ is a strictly increasing  function from $\N$ to $\N$, and we have  $x_{n_k}= x_{g(k)}=f(g(k))\;(k\in\N)$. Thus, if we define $h:\N\to X$ by $h(k)=x_{n_k}$, we have...

Sequences and subsequences, Part II

In this part, we will have a closer look at strictly increasing sequences of natural numbers, before beginning to discuss subsequences of sequences. Recall that I work with the convention that $\N=\{1,2,3,\dots\}$, so that $0\notin\N$. Let $(n_k)_{k\in\N}$ be a sequence of natural numbers (so $n_k\in\N$ for all $k\in \N$). As discussed in Part I, we may identify this sequence $(n_k)_{k\in\N}$ with a function $g:\N\to\N$, where $g(k)=n_k\;(k\in\N).$ We will be particularly interested in the case when the sequence $(n_k)$ is strictly increasing , i.e., when $n_1<n_2<n_3<\cdots\,.$ This is equivalent to saying that the function $g:\N \to \N$ above is a strictly increasing function . This way of thinking might be helpful to us later, because of the fact that if you compose two strictly increasing functions from $\N$ to $\N$, you obtain another strictly increasing function from $\N$ to $\N$. There is, however, another way to think about strictly increasing sequences of natural num...

Sequences and subsequences, Part I

Sequences and subsequences play an important role throughout mathematics, and especially in mathematical analysis. In this series (or sequence?) of posts, I will combine some standard theory with some of my own musings on the subject. These posts will be mainly about the theory around sequences etc. But to understand mathematics properly, you also need to play around with lots of examples and look at their properties. Here let me plug some old videos on Core Topics in University Mathematics ( YouTube PlayList ) that a group of us from Nottingham put together (funded by a teaching grant of Steve Cox ). Among other videos there you can find two videos by Dan Nicks on Convergence of sequences , and three videos of my own on Sequences and their properties (including discussion of a few examples, and a quiz). I also have a video there on the topic Think of a function . For the purposes of these posts, note that I work with the convention that $\N=\{1,2,3,\dots\}$, so that $0\notin\N$. Let...

Young's inequality (for products) and the AM-GM inequality: random musings

  Young's inequality  (for products) is related to the AM-GM (arithmetic mean -geometric mean) inequality . Let $a$ and $b$ be non-negative real numbers. Then $(ab)^{1/2} \leq (a+b)/2$, with equality if and only if $a=b$. This can be seen easily by multiplying both sides by $2$, then squaring both sides and noting that $(a+b)^2=(a-b)^2+4ab$. This is the special case of the AM-GM inequality for two non-negative real numbers (and the result generalises to any finite number of non-negative real numbers). However it is also the special case of Young's inequality when $p=q=2$. Young's inequality states that for non-negative real numbers $x$ and $y$ and positive real numbers $p$ and $q$ satisfying $1/p + 1/q = 1$, we have $xy \leq x^p/p + y^q/q$, with equality if and only if $x^p=y^q$. When $p=q=2$ this says that $xy \leq (x^2+y^2)/2$ with equality if and only if $x^2=y^2$, which is the same as the version of AM-GM above above when you set $a=x^2$ and $b=y^2$. Both AM-GM and Youn...

The Boundedness Theorem and the Extreme Value Theorem for subsets of finite-dimensional (Euclidean) space

In an earlier post  we looked at the Boundedness Theorem and the Extreme Value Theorem for continuous, real-valued functions on closed and bounded intervals $[a,b]$. However, the proof we gave there generalises to any setting in which the lemma we used is valid. Let $D$ be a non-empty subset of $\R^2$, and consider the following property (B) ( non-standard! ) that $D$ may or may not have: (B)           Every continuous function $f:D\to\R$ is bounded above on $D$. By the reasoning in  the earlier post , we can show that the Extreme Value Theorem holds for any non-empty set $D$ that satisfies condition (B). So the question arises, which subsets of $\R^2$ satisfy condition (B)? By considering the continuous function $f(x,y)=\sqrt{x^2+y^2}$ (or we could use $f(x,y)=x^2+y^2$), it is clear that any subset $D$ of $\R^2$ that satisfies condition (B) must be a bounded subset of $\R^2$ (that is, the set of distances from points of $D$ to $(0,0)$ is bounde...

Problems when multiplying powers

 In the past I used to confuse students by asking them what the correct value of $((-1)^{2/3})^{3/2}$ is. This is on the assumption that you follow the convention that $x^{2/3}$ is equal to the square of the cube root of $x$ for all real numbers $x$. But perhaps instead I should argue that $1$ must be equal to $\pm \mathrm{i}$, on the grounds that $((-1)^2)^{1/4}$ should be equal to $(-1)^{1/2}$?

Some musings on Cauchy-Schwarz, Part Vb

 Recall our claim from Part I Cauchy-Schwarz in complex inner product spaces can be deduced from Cauchy-Schwarz in real inner product spaces. This is essentially because every complex inner product space can also be regarded as a real inner product space with the same norm, but where the real inner product is the real part of the complex inner product. The last bit of the deduction uses a fairly standard "rotation trick": for any complex number \(z\), we have  \[|z|=\max\{\Re(\alpha z):\alpha \in \C, |\alpha|=1\,\}\,.\qquad(*)\] Let's check $(*)$ first. Let $z\in\C$, and set \[A=\{\Re(\alpha z):\alpha \in \C, |\alpha|=1\,\} \subseteq \R\,.\]  Clearly $A$ is non-empty.  Let $\alpha \in \C$ with $|\alpha|=1$. Then certainly we have \[\Re(\alpha z) \leq |\alpha z| = |z|\,.\] Thus we have \[\sup A \leq |z|\,.\] We now need to prove that equality holds, and that the supremum is actually a maximum. For this we just need to show that $|z| \in A$. This is trivial if $z=0$, b...

Some musings on Cauchy-Schwarz, Part Va

In this part, we take as our starting point the (easy) results discussed so far for real inner product spaces of dimensions less than or equal to $2$. That is, that for a given dimension $n$ (and we only need $n\leq 2$ below), up to "real inner product space isomorphism", all $n$-dimensional inner product spaces over $\R$ are the same as $\R^n$ with the usual dot product. In particular, the Cauchy-Schwarz inequality holds in all real inner product spaces of dimension $\leq 2$, with equality if and only if the two vectors involved are linearly dependent. Now let $V$ be any  inner product space over $\R$, with inner product $\langle \cdot,\cdot \rangle_V$ and associated norm $\|\cdot\|_V$. (Here $V$ can be infinite-dimensional, and need not be separable.) Let $\vx, \vy \in V$, let $W$ be the linear subspace of $V$ spanned by $\vx$ and $\vy$, i.e., $\lin\{\vx,\vy\}$. Clearly $W$ is then itself a real inner product space of dimension at most $2$. Thus the Cauchy-Schwarz inequalit...

Some musings on Cauchy-Schwarz, Part IVc

 To conclude Part IV, we prove the easy fact that all two-dimensional real inner product spaces are "essentially the same" as $\R^2$ with the usual dot product and the associated (Euclidean) norm $\|\vx\|_2 = \sqrt{\vx\cdot\vx}$. Of course what we need is a linear isomorphism which preserves norms and inner products. The argument is almost identical to that in Part III (and, unsurprisingly, generalises via the usual Gram-Schmidt process to higher dimensions). As an exercise you should check for yourselves the details of any unproven claims below. Now let $V$ be any two-dimensional inner product space over $\R$, with inner product $\langle \cdot,\cdot \rangle_V$ and associated norm $\|\cdot\|_V$. Let $\{\vv_1,\vv_2\}$ be a basis of $V$. Then $\vv_1\neq 0$, so we can normalize by setting \[\Ve_1=\frac{1}{\|\vv_1\|_V} \vv_1\,.\] Then $\{\Ve_1,\vv_2\}$ is easily seen to still be a basis of $V$. Next we write $\vv_2=\va+\vb$ with $\va=\langle \Ve_1,\vv_2\rangle\Ve_1$ being the com...

Some musings on Cauchy-Schwarz, Part IVb

In this part we will look at two-dimensional real inner product spaces, which are all essentially identical to $\R^2$ with the standard dot product. They are also all essentially identical to $\C$ when $\C$ is regarded as a  real  inner product space, using the  real  inner product (as discussed in Part II). \[\langle z,w \rangle = \Re(\bar z w)= \Re(z) \Re(w) + \Im(z) \Im(w)\,,\] and the Cauchy-Schwarz inequality for all two-dimensional real inner product spaces is immediate from this, because $|\Re(\bar z w)| \leq |\bar z w|$. (Of course, Cauchy-Schwarz in $\R^2$ is easy to prove anyway!) We already discussed the connection between $\R^2$ and $\C$ in Part II. Recall the following from that part (also discussed in intermediate parts). The (linear in the second variable) standard complex inner product on $\C$ is given by $\langle z,w \rangle = \bar z w$, with the associated norm given by modulus. Writing $z=a_1+\i a_2$ and $w=b_1+\i b_2$, with $a_1,a_2,b_1,b_2$ real,...

Some musings on Cauchy-Schwarz, Part IVa

In this very short part we look briefly at one-dimensional complex inner product spaces, essentially repeating some of the material from previous posts. As we noted in Part II, the standard (linear in the second variable) complex inner product on $\C$ is given by $\langle z,w \rangle_\C = \bar z w$, with the associated norm given by the usual modulus, $\|z\|_\C=|z|$. Since we have (by standard properties of $\C$) that \[|\langle z,w \rangle_\C|=|\bar z w| = |z| |w| = \|z\|_\C \|w\|_\C\,,\] the Cauchy-Schwarz inequality holds for $\C$, and in fact equality always holds here. We can now repeat the reasoning from Part III to see that all one-dimensional complex inner product spaces are essentially the same as $\C$ with its standard inner product (given above). Unsurprisingly, this means that  equality  always holds in the Cauchy-Schwarz inequality in one-dimensional complex inner product spaces. In part IVb we will look at two-dimensional real inner product spaces, which are all ...

Some musings on Cauchy-Schwarz, Part III

In this part we look at the very trivial case of one-dimensional inner product spaces over $\R$. As an exercise you can check any details omitted below, and identify the famous named theorems we are discussing the one-dimensional versions of! Almost everything discussed below is just the trivial one-dimensional case of standard facts about finite-dimensional, real inner product spaces. More advanced readers may wish to skip or merely skim Parts III and IV and move on to Part V. The standard inner product on $\R$ is just the usual product in $\R$, so, for $x,y \in \R$, \[\langle x,y\rangle_\R=xy\,.\] This is, of course, the one-dimensional version of the dot product! You can check that this really is a (real) inner product. (This is mostly just the standard rules of arithmetic in $\R$, along with properties of modulus.) Unsurprisingly, the associated norm is given by \[||x||_\R=\sqrt{\langle x,x \rangle}_\R = \sqrt{x^2} = |x|\,,\] i.e., the usual modulus of $x$. In this special case, th...

Some musings on Cauchy-Schwarz, Part II

In this part we'll have an initial look at some of the connections between real inner product spaces and complex inner product spaces. In a previous post, I discussed the fact that every vector space over $\C$ can be regarded as a vector space over $\R$ with respect to the same addition, and the restricted scalar multiplication obtained by using only real scalars (where we regard $\R$ as a subset of $\C$, as usual). If we have a finite-dimensional vector space over $\C$, then the dimension doubles when we regard it as a vector space over $\R$. In particular, $\C$ is a $1$-dimensional complex vector space, but is a $2$-dimensional real vector space. This is no surprise, since we often identify $\C$ with $\R^2$ (and may well define $\C$ that way as a set). Similarly, every normed space over $\C$ can also be regarded as a normed apace over $\R$, with the same addition and norm, and restricting attention to multiplication by only real scalars. Now, however, we are talking about inner p...

Some musings on Cauchy-Schwarz: Part I

I'm currently thinking about the Cauchy-Schwarz inequality for multiple reasons, including the following: I'm currently teaching a Level 4 module on Linear Analysis which includes material on inner product spaces and Hilbert spaces; I'm also still the Teaching Support Officer in our school, and one of the first-year students asked me why the dot product formula in terms of components gives the same answer as the formula in terms of norms and angles, as in \[\va \cdot \vb = ||\va||\cdot||\vb|| \cos \theta,\] where \(\theta\) is the angle between \(\va\) and \(\vb.\) For the first-year student, I drew a picture to illustrate the special case in \(\R^2\)  where \(\va\) has the form \((||\va||,0)\) and \(\vb\) is written in the form \((||\vb|| \cos \theta,||\vb||\sin \theta).\) I then noted that the two formulae clearly agreed here, and so, as long as you know that the dot product formulae are invariant under rotations about the origin , the general fact follows.  Now I'm ...

Measures, outer measures and measurable sets I

Although I have taught Measure and Integration many times over the years, typically I don't have time to prove all of the details of the Carathéodory theory of outer measures and their associated $\sigma$-algebras and measures. I've been thinking about how we prove some of the fiddly bits at the end, and trying to decide how to make some of the final bootstrapping from finite unions to infinite unions a bit more natural. One possibility I have thought of is to change the order in which we prove some of the results, essentially in order to avoid proving some facts twice. However, this might be at the cost of having to prove some results again for general measures that we first prove for measures coming from outer measures. On the other hand, every measure on a $\sigma$-algebra is actually the restriction to that $\sigma$-algebra of  a measure that comes from some outer measure! The same is also true for the more general "measures" on rings of sets and on semi-rings of...

The Extreme Value Theorem: a bootstrap approach

At the very end of last week I was teaching the first-year mathematics students about the Extreme Value Theorem. Here is a reminder of what the theorem says. Theorem (Extreme Value Theorem) Let $a,b$ be real numbers with $a<b$, and let $f:[a,b]\to\R$ be continuous. Then there exist points $c$ and $d$ in $[a,b]$ such that, for all $x \in [a,b]$, we have $f(c)\leq f(x) \leq f(d)$. Here we have \[f(c)=\min\{f(x):x\in[a,b]\}=\inf\{f(x):x\in[a,b]\}\] and  \[f(d)=\max\{f(x):x\in[a,b]\}=\sup\{f(x):x\in[a,b]\}\,.\] Unfortunately I only had a few minutes left for this, ran out of time, and didn't finish the proof. As I am on a very tight schedule this year, I had to refer the students to the the typed notes for the rest of the proof. On the other hand, I did finish the first part of the proof, showing that a continuous real-valued function $f$ on a closed and bounded interval $[a,b]$ is always bounded above, i.e., the set $f([a,b])$ is bounded above.  In this post I want to see how ...

Set of real numbers, bounds and sequences II

 In this post we carry on from where we got to in Part I. The aim in this part is to try to tie together what we know about infimum, supremum, epsilons and sequences. This will give us a lot of flexibility in how we approach problems later: we can choose which criterion will be easiest to work with for any given situation. Although working with sequences instead of epsilon and delta can lead to some very clean proofs, you shouldn't forget about epsilon and delta! That approach is very important later throughout mathematics, and it is best to be fluent in all possible methods so that you have the most suitable method available when you need it. Let's start by having another look at supremum . The results for infimum are almost identical: you just need to flip everything e.g. by reflecting across $0$ in the number line using the map $x \mapsto -x$, which reverses all of the relevant inequalities. Let $A\subseteq \R$ be a non-empty set which is bounded above in $\R$, and set $S = ...

Sets of real numbers, bounds and sequences I

Let $A$ be a subset of $\R$. Then a real number $y$ is an upper bound for $A$ if $A \subseteq (-\infty,y]$, i.e., for all $a \in A$ we have $a\leq y$. We define lower bound in a similar way. Not every set has an upper bound and/or a lower bound (in $\R$). For example $\R$, $\Q$ and $\Z$ have no upper bounds and they also have no lower bounds (in $\R$). Other sets such as $\N$, $(-\infty,2)$, $[-3,5)$ have one or the other or both.  The empty set $\emptyset$ is a pathological example: every real number is both an upper bound and a lower bound for $\emptyset$, so in particular many upper bounds for $\emptyset$ are less than some of the lower bounds for $\emptyset$. Let's face it, $\emptyset$ always causes trouble! The connection between English and mathematics is not always straightforward and can lead to misunderstandings! We say that the subset $A$ of $\R$ is bounded above if there is at least one upper bound for $A$ in $\R$. Of course as soon as $A$ has an upper bound $y\in\R$,...

Injective continuous real-valued functions on an interval must be monotone

It is a well-known and very useful theorem of real analysis that injective continuous real-valued functions on an interval must be monotone. This is usually proved by contradiction using the Intermediate Value Theorem (IVT). However the direct negation of a function being monotone is actually not very friendly. Let $I$ be a (nondegenerate) interval in $\R$. A function $f:I\to\R$ is monotone increasing if (and only if), for all $x_1,x_2 \in I$ with $x_1\leq x_2$, we have $f(x_1) \leq f(x_2)$. Negating this we see that $f$ is not monotone increasing if there exist $x_1,x_2 \in I$ with  $x_1\leq x_2$ such that $f(x_1) > f(x_2)$.  [Of course in this case we must actually have $x_1<x_2$.] Similarly, $f$ is not monotone decreasing if and only if there exist $x_3,x_4 \in I$ with  $x_3\leq x_4$ such that $f(x_3) < f(x_4)$.  [Again, in this case we must have $x_3<x_4$.] Now $f$ is monotone (on $I$) if and only if $f$ is monotone increasing or $f$...