Proof by Contradiction

The concept of proof by contradiction refers to taking a statement and assuming the opposite is true. When assuming the opposite is true we begin to further examine the our ‘opposite’ statement and reach to a conclusion which doesn’t add up or in simple terms is absurd.

Take the case:

Statement: There are infinite number of prime numbers.

Using the concept of proof by contradiction, we will assume the opposite is true.


If an integer (2) divides an integer (6) we say that 2 divides 6 or 2|6. In a more general sense we can say that if any integer ‘a’ divides any other integer ‘b’ then a|b.

Prime numbers: it is an integer (n ≥ 2) that has exactly two positive factors (1 and itself).

eg. 2, 3, 5 …

Composite numbers: it is an integer (n ≥ 2) that has more than two positive factors.

eg. 4, 6, 8 …

Fundamental Theorem of Arithmetic: Every integer n ≥ 2 has a unique (exactly one) prime factorization.…

By | April 17th, 2017|Uncategorized|0 Comments

Group Theory (lecture 1) by Robert de Mello Koch

Some ten (and change) years ago, the African Summer Theory Institute (ASTI) took place in Cape Town at UCT. This was a course designed for students to give them a taste of a number of topics related to theoretical physics. These lectures were all recorded, and I watched them at the time, never of course thinking for a moment that I would end up lecturing in the same venue a decade or so later. In particular, I remembered that the lectures by Robert de Mello Koch on Group Theory were some of the most pedagogically clear that I had ever seen. Sadly, the old ASTI website seems to be defunct, but the lectures can all be found on YouTube.

I wanted to start posting some of them here and see if people seem enthusiastic about me posting more. It would be great to have some comments on this post to let me know if you would like more of these, or of course if you have any questions or comments about the material itself.…

By | January 19th, 2017|Uncategorized|4 Comments

“Integration sounds like interrogation and that scares me”

I recently received a message from a friend and the heading of the post perfectly describes what was said to me. Thereafter, an interesting integration question was sent to me. It read as follows:

 

integral

 

I must admit, it does look quiet scary. My immediate thought was that some sort of substitution was required but I really had no idea as to where and how this should be done. Two pages and a headache later, I thought to myself why don’t I get a rough idea of what the answer should look like. Once again, let’s start approximating things (as it turns out, my approximation gets me the absolutely correct answer).

I looked at the integration bounds and noted that the point x = 3 was in fact the midpoint. I then decided to construct a Taylor polynomial for the above function around the point x = 3. It was done as follows:

 

integral2

 

You might be wondering why I didn’t bother taking anymore derivatives.…

By | December 23rd, 2016|Uncategorized|1 Comment

The least preferred, but maybe the most understandable way of approximating π

Why \pi? I assume this is the question on everyone’s mind. (Whether you’re a Math lover or not)

The simple answer would be that we all love pie, now don’t we?

Before I begin discussing any technicalities, I’d like to acknowledge that it is possible for some of us to find the concepts easy whilst others might struggle with them. This is the reason why I’m choosing to speak in a very simple and understandable manner. (I’m baby proofing my post!)

Firstly, let us have a look at the Maclaurin series of \arctan(x)

Aside: A Maclaurin series is a polynomial which approximates a function around the point x = 0. The level of accuracy decreases as you move further away from x = 0. The only way to get an exact answer and not an approximate is to let the sum go to infinity.

Below is a table of the first few derivatives of \arctan(x).…

By | December 21st, 2016|Uncategorized|1 Comment

Maxwell’s Equations

Essentially, the entire theory of electromagnetism can be found in the following four equations:

\begin{aligned}\mathbf{\nabla \cdot E} &= \frac{\rho}{\epsilon_{0}} \\ \mathbf{\nabla \times E} &= - \frac{\partial{\mathbf{B}}}{\partial{t}}\\ \mathbf{\nabla \cdot B} &= 0\phantom{\frac{1}{2}}\\ \mathbf{\nabla \times B} &= \mu_{0} \mathbf{j}+\mu_{0} \epsilon_{0} \frac{\partial{\mathbf{E}}}{\partial{t}} \end{aligned}

These are Maxwell’s Equations in differential form, not in integral form, which is the way they are often introduced. I will discuss them in this form, however, as I believe the differential equations convey more elegantly their physical meaning straight from the mathematics. Let’s get started.


Fields

If you ever did high school physics, you should have some idea of what electric and magnetic fields are. Below is an example of each (depicted using field lines):

Fields

What these field lines show is the direction of the respective fields at each location (indicated by arrows) as well as their relative strengths (indicated by density of field lines). So what are these fields actually representing? Well, for electric fields, this shows you the direction an object with a positive electric charge would be forced, while a negatively charged object would feel a force in the opposite direction.…

By | December 1st, 2016|Uncategorized|0 Comments

A Linear algebra problem

I have this linear algebra problem in the context of quantum mechanics. Let \mathbf{f}_\lambda be a family of linear operators so to each \lambda \in \mathbf{R} we have a linear operator \mathbf{f}_\lambda : \mathcal{H} \to \mathcal{H} where \mathcal{H} is a complex vector space if one is unfamiliar with functional analysis (like I am) or is a Hilbert space if one is. Let’s suppose that this family is differentiable.

Suppose further that \mathbf{f}_\lambda is always a Hermitian operator. Suppose that \mathbf{f}_\lambda has a discrete spectrum of eigenvalues f_1(\lambda), f_2(\lambda), \cdots. I need to show the following:

Theorem

D_\lambda f_n(\lambda) = \left\langle f_n(\lambda)\right|D_\lambda \mathbf{f}_\lambda \left|f_n(\lambda) \right\rangle

Now here is a “proof,” it is not quite rigorous since there are probably a lot of technical details regarding functional analysis that I’m missing out on but:

Proof We begin by differentiating the eigenvalue equation \mathbf{f}_\lambda \left| f_n(\lambda) \right\rangle = f_n(\lambda) \left| f_n(\lambda) \right\rangle with respect to \lambda using the product rule:

(D_\lambda \mathbf{f}_\lambda) \left|f_n(\lambda)\right\rangle + \mathbf{f}_\lambda (D_\lambda \left| f_n(\lambda) \right \rangle) = (D_\lambda f_n(\lambda)) \left| f_n(\lambda) \right \rangle + f_n(\lambda) (D_\lambda \left| f_n(\lambda) \right\rangle)

After multiplying by \left\langle f_n(\lambda) \right| and rearranging terms we have the following:

\left\langle f_n(\lambda)\right| D_\lambda f_n(\lambda) \left|f_n(\lambda)\right\rangle = \left\langle f_n(\lambda)\right| D_\lambda \mathbf{f}_\lambda \left| f_n(\lambda) \right\rangle + \left\langle f_n(\lambda)\right| \mathbf{f}_\lambda (D_\lambda \left|f_n(\lambda)\right\rangle) - \left\langle f_n(\lambda)\right| f_n(\lambda) (D_\lambda \left|f_n(\lambda)\right\rangle)

Now we can take the adjoint of both sides of the eigenvalue equation to get that \langle f_n(\lambda)| \mathbf{f}_\lambda = \langle f_n(\lambda)| f_n(\lambda) since f_n(\lambda)^* = f_n(\lambda) because the eigenvalues of a normal operator are real.…

By | October 12th, 2016|Uncategorized|0 Comments

Dependent Types

This blog post will carry on from the previous one, and introduce dependent types. So what is a dependent type? To motivate the idea let’s talk about equality. Remember that we interpret propositions as types, so if we have x, y : A then the statement “x is equal to y” corresponds to some type, let’s call it x =_A y. This type depends on its values, for example we expect to be able to prove (i.e. construct) 3 =_{\mathbb{N}} 3, but not to be able to prove 2 =_{\mathbb{N}} 3 and so we will have an equality type that depends on its values. This idea is also being explored in various programming languages. These languages have a type like \mathrm{Vec}(x, A), where l : \mathrm{Vec}(x, A) means that l is a list of x elements from the type A. Since the length of the list is part of its type which is known ahead of time, it is impossible to ask questions like, “What is the first element of this empty list?” Indeed dependent types are so powerful that one can write a compiler and be sure that the compiler preserves the meaning of a program.…

By | October 11th, 2016|Uncategorized|0 Comments

Cellular Automaton

try

How clear is this post?
By | October 4th, 2016|Uncategorized|0 Comments

Mathematical Modelling for Infectious Diseases – a course at UCT (19th-30th September 2016)

For anybody interested in the mathematics of infectious disease modelling, the following should be very interesting.

A course on the application of mathematical modelling and computer simulation to predict the dynamics of infectious diseases to evaluate the potential impact of policy in reducing morbidity and mortality. (click to go to poster).

How clear is this post?
By | August 17th, 2016|Uncategorized|0 Comments

The mathematical equation that caused the banks to crash

The Black-Scholes model is a mathematical equation invented by Fischer Black and Myron Scholes that first appeared in their seminal paper of 1973 opening a new wave of selling and buying financial contracts. This economic formulation was well received and recognized to be effective by the financial community to the extent that it won Black and Scholes a noble price in 1997. However, on the 19th October, 1987 – The Black Monday, the world experienced a severe shock when the markets suddenly crushed bringing to light the flaws in the mighty celebrated Black-Scholes model. The number one mistake in the model was the assumption that a given contact could be priced at the same volatility level irrespective of the strike price – the price a contract owner had to pay at the expiry date of the contract. A more economic perspective is discussed here.

How clear is this post?
By | August 7th, 2016|Uncategorized|1 Comment