Showing posts with label

**Newspaper Column: Experience Mathematics**. Show all postsShowing posts with label

**Newspaper Column: Experience Mathematics**. Show all posts## Friday, March 14, 2003

### Experience Mathematics #29 -- Abstraction

The first time you encountered abstraction in mathematics was when you associated the number (say $5$) with five oranges and five apples. When we begin to learn mathematics, we associate numbers with specific objects. Soon we realize that we can think of the number $5$ as a concept removed from the apples and oranges. This is abstraction. Now we can apply the concept of $5$ (and also other numbers) in counting any set of objects.

Mathematics students become used to abstracting concepts into symbols that we can apply in many situations. The same skill in abstract thought helps in other domains also. For example, object oriented programming—the most useful of the programming paradigms is all about abstraction.

In Object-oriented programming, we think of everything as an object. For example, the button you press in most applications is an object. Now a button looks and behaves in much the same way in any application. So we would naturally wish to program it just once. So most language environments (like Java or Visual Basic) give us a “Class” that represents the object that is the button. (A Class is like the set we encounter in mathematics.)

However, when we use the button in a particular program, we may wish to add certain properties of our own. For example, we may like to put the word “OK” as a label on the button we wish to use. So we “instantiate” a button and set its properties that include a label “OK” that will appear on it. Further, when a user clicks on the button, the button performs an “Action”. You have to code this “Event” to tell the button what to do.

The Classes contain data (or “properties”) that are used to describe a particular member (or “instance”) of the class, functions (or “methods”) that do certain tasks, and have the ability to process messages (or “events”) that the rest of the application uses to tell the class to perform its tasks.

## Friday, February 28, 2003

### Experience Mathematics #28 -- How fast do functions grow?

In the last column, we talked about the explosive growth of the exponential function. The number of computers infected by the SQL Slammer worm increased dramatically, bringing the Internet crashing down in a couple of hours.

Computer scientists measure the speed of computer algorithms by comparing them to functions.

Some of the functions they use are logarithmic: $\log(n)$, linear: $n$; the power functions: $n^2, n^3, n^4,\dots $; and the exponential functions: $2^n, 10^n,$ etc.

Usually $n$ is the size of the input. Computer scientists make statements such as: The “order” of an algorithm is $n^2$. For example, if you have to sort $n$ numbers, the algorithm is of order $n^2$. This means that the computer has to make approximately $n^2$ calculations. To get an idea of which algorithms are faster, consider when $n=1000$. $\log(n)$ is just $3$. The linear function $n$ is also manageable, at $1000$. However, $n^2$ is $1,000,000$ (one million) and $n^3$, is one billion. And $10^n$ is a huge number, 1 followed by a thousand zeros. This number of calculations is more than what Deep Junior had to perform to defeat Kasparov in Chess.

All these functions go to infinity as $n$ goes to infinity. That is to say, they become bigger and bigger as $n$ becomes bigger. What matters (to computer scientists) is how fast or slow this increase is. The slower the increase, the faster the algorithm.

Logarithmic, linear and Polynomial time algorithms the only algorithms that are fast enough to work in practical situations.

Computer scientists are continuously finding faster and faster algorithms. Recently, Maninder Agarwal, Neeraj Kayal, and Nitin Saxena, of IIT, Kanpur, found a deterministic polynomial-time algorithm to determine whether a number is a prime number.

This solved a problem that mathematicians have been trying to solve for centuries.

Computer scientists measure the speed of computer algorithms by comparing them to functions.

Some of the functions they use are logarithmic: $\log(n)$, linear: $n$; the power functions: $n^2, n^3, n^4,\dots $; and the exponential functions: $2^n, 10^n,$ etc.

Usually $n$ is the size of the input. Computer scientists make statements such as: The “order” of an algorithm is $n^2$. For example, if you have to sort $n$ numbers, the algorithm is of order $n^2$. This means that the computer has to make approximately $n^2$ calculations. To get an idea of which algorithms are faster, consider when $n=1000$. $\log(n)$ is just $3$. The linear function $n$ is also manageable, at $1000$. However, $n^2$ is $1,000,000$ (one million) and $n^3$, is one billion. And $10^n$ is a huge number, 1 followed by a thousand zeros. This number of calculations is more than what Deep Junior had to perform to defeat Kasparov in Chess.

All these functions go to infinity as $n$ goes to infinity. That is to say, they become bigger and bigger as $n$ becomes bigger. What matters (to computer scientists) is how fast or slow this increase is. The slower the increase, the faster the algorithm.

Logarithmic, linear and Polynomial time algorithms the only algorithms that are fast enough to work in practical situations.

Computer scientists are continuously finding faster and faster algorithms. Recently, Maninder Agarwal, Neeraj Kayal, and Nitin Saxena, of IIT, Kanpur, found a deterministic polynomial-time algorithm to determine whether a number is a prime number.

This solved a problem that mathematicians have been trying to solve for centuries.

## Friday, February 07, 2003

### Experience Mathematics # 27 -- The exponential function

The number of computers infected in $t$ seconds can be modelled by the function $N(t)$, where

$$N(t)=2^{t/8.5}.$$

This is a reasonable model. In the beginning (when $t=0$) we assume that the worm has infected only $1$ computer, and indeed, $N(0)=1$. In 8.5 seconds, the number becomes $N(8.5)=2$, so it doubles. In another $8.5$ seconds, $N(17)=4$. This doesn’t sound like very fast growth, but at the end of one minute ($t=60$) the number becomes more than $133$. In two minutes, $28995$ computers are infected, and in $5$ minutes, the number of computers infected is in the billions. Which means that the rate of growth must have slowed down, because there aren’t so many computers in the world! I hope this helps you understand why it caused the slowdown of the Internet traffic in Korea.

$N(t)$ is an example of an exponential function, which increases very fast. The prototypical example is THE exponential function, $f(x)=e^x$. Here the number e is an irrational number (just like the famous $\pi$, whose value is approximately $2.7182818\dots$. The graph of the function (made using desmos.com) is as follows.

The exponential function is not symmetric across the $y$-axis, nor across the origin. That is to say, it is not an even function or an odd function. However, consider the functions:

$$E(x)=(e^x+e^{-x})/2,$$ and $$O(x)=(e^x-e^{-x})/2.$$ $E$ is an even function, and $O$ is an odd function, and the exponential function is the sum of these functions. Draw the function $E(x)$ from $x=-5$ to $x=5$ using MS-Excel (update: try www.desmos.com), and see what the graph looks like. Does it look like a clothesline secured at its two ends?

## Friday, January 31, 2003

### Experience Mathematics # 26 -- Symmetries

There are two kinds of symmetries in a function. A function may be symmetric across the $y$-axis, or symmetric across the origin. (If a curve is symmetric across the $x$-axis, it is not a function. Can you tell why?)

For example, the function $f(x)= x^2$ is an example of a function that is symmetric across the $y$-axis.

This symmetry is obvious from the graph. An algebraic way to see that the function $f(x)= x^2$ is symmetric across the $y$-axis, is to replace $x$ by $–x$ in the formula, and note that:

$f(–x) =f(x)$ (since $(–x)^2=x^2$).

For example, the $y$-coordinate corresponding to the point $–2$ is the same as that corresponding to $2$.

The function $f(x)= x^3$ is an example of a function that is symmetric across the origin.

Each point (for example the point $(2, 8)$) maps to a symmetric point (the point $(-2, -8)$) in the graph. An algebraic way to notice that this function is symmetric across the origin is to note that

$f(–x) =–f(x)$ (because $(–x)^3= –x^3$).

Functions symmetric across the $y$-axis are called even functions, and functions symmetric across the origin are called odd functions.

What is remarkable is that any function defined on the set of real numbers can be written as a sum of an odd and an even function. Can you figure out a way to write the exponential function $f(x)=e^x$ as the sum of an even and an odd function? The curve formed by a hanging clothesline appears in the answer to this question.

## Thursday, January 23, 2003

### Experience Mathematics # 25 - Functions

A ball thrown in the air follows the path of a parabola. Parabolas are modelled by a function of the form $p(x)=ax^2+bx+c$, where $a$, $b$ and $c$ are real numbers. This kind of function—a polynomial of degree 2—is called a Quadratic Function. While we will not formally define functions, it is helpful to get an intuitive idea of functions from several points of view.

One point of view is to think of functions as a rule. For example, consider the quadratic function:

$f(x)=1-x^2$. Every real number $a$ corresponds to a unique real number denoted by $f(a)$ obtained by replacing $x$ by $a$ in the above equation. For example,

$f(0)=1, f(1)=0, f(-2)=-3.$

This suggests that we can also think of a function as an input-output machine. For each input $a$ we have a unique output $f(a)$. The set of possible input values (in this case the set $R$ of real numbers) is called the domain of the function.

Imagine making a table of all the input-output values of the function. (There are an infinite number of elements in the domain, so you can only imagine making a table!) All these values can be plotted on the coordinate plane. The input values are the $x$-coordinates and the output values are the $y$-coordinates.

If we do this, we will get a graph of the function. We denote the graph by $y=f(x)$, (or $y= 1-x^2$).

This is the third way of thinking about a function: as a graph. The graph is shown below.

Note that this parabola is symmetric about the $y$-axis. It meets the $x$-axis when $x=1$ and when $x=-1.$ These are (graphically speaking) the solutions of the equation $1-x^2=0$. The function has a maximum when $x=0$, corresponding to the highest point a ball reaches, when it is thrown in the air.

## Friday, January 10, 2003

### Experience Mathematics # 24 -- The Calculus

Happy New Year. The earth has finished another revolution around the sun, taking a little more than 365 days to do so. Meanwhile, the moon continues to rotate around the earth, the planets around the sun, and the same forces that make these things move in an elliptical path ensure that a ball thrown up in the air always falls down, or that a ball thrown in the air (towards a friend) takes a parabolic path.

Over this and the next few columns, I will discuss these natural motivations that are behind the notions that you encounter as you study the Calculus.

The first concept is that of a function. Mathematicians were already familiar with curves from Euclidean and coordinate geometry by 1600 or so A.D. It was natural to begin modelling various physical phenomena with functions. For example, $y=1-x^2$ models the parabola. For each value of the input $x$, we get a unique output $y$. If you plot the curve in the coordinate plane, you obtain a parabola.

It was natural to do two things. To figure out laws that can explain why a ball thrown in the air follows a path traced by such a curve. This led to the laws of Gravitation. And the other thing is to use these laws to predict the answers to common questions that arise. For example: How high will the ball go? How far will the ball go? Given the curve, when does the curve go up (increase)? And when does it come down (decrease)? We will consider such questions and relate them to what you encounter in Calculus.

Curves such as the circle ($x^2+y^2=1$) are not functions since there is not one output $y$ for each input $x$. For example, for $x=0, y$ can be $1$ or $–1$. So, every curve does not give rise to a function.

## Friday, December 20, 2002

### Experience Mathematics #23 -- Ambigrams (by Punya Mishra)

Symmetry is important in mathematics and in art. Today we will look at a special kind of wordplay based on ideas of symmetry and figure and ground. Consider the word below:

Such visual wordplays are called

**ambigrams.**The word “ambigram” was first coined by the cognitive scientist Douglas Hofstadter. Here is an ambigram of the word ambigram itself.
Ambigrams can be of many different kinds. For instance consider the word “logical” below.

Creating ambigrams is great fun. Why don’t you try creating some yourself? If you want to see more examples of such wordplay you can search on Google or go to my wordplay gallery: http://punya.educ.msu.edu

This word has reflection symmetry i.e. it will read the same even when reflected in a mirror.

Some ambigrams are not about symmetry as much as they are about reading words in multiple ways. Here is one titled “good-evil” Can you see both words? Look carefully. This is similar to figure-ground paintings by M. C. Escher.

Some ambigrams are not about symmetry as much as they are about reading words in multiple ways. Here is one titled “good-evil” Can you see both words? Look carefully. This is similar to figure-ground paintings by M. C. Escher.

Creating ambigrams is great fun. Why don’t you try creating some yourself? If you want to see more examples of such wordplay you can search on Google or go to my wordplay gallery: http://punya.educ.msu.edu

*This guest column has been written by Professor Punya Mishra, College of Education, Michigan State University, USA. You can email him at punya@msu.edu*

## Friday, December 13, 2002

### Experience Mathematics # 22: The mobius strip

Take a long, thin strip of paper, give it a half twist, and paste the two ends together. What you get is a mobius strip (see picture).

Compare the mobius strip with the cylinder, which you get if you don’t give a half twist. A mobius strip has only one surface. Can you see why? Draw a line along the edge and keep going on. Eventually, you will arrive at the starting point. A cylinder, on the other hand, has an inside and an outside surface. The artist Escher portrayed this idea in Mobius Strip II (woodcut, 1963) (see picture).

If you cut the paper cylinder in half, you will get two cylinders. However, if you cut the mobius strip, you will get something very similar to a mobius strip. How many half-twists does the cut mobius strip have?

The mobius strip is one of the many surfaces that appear in Topology, a branch of mathematics. Topologists have been described as the mathematicians who cannot tell the difference between a coffee mug and a doughnut. This is because a mug can be “continuously deformed” to become a doughnut. A doughnut (which is a tyre tube, topologically speaking) cannot be transformed into a sphere. So, according to topologists, the tyre tube is not the same as a sphere, but a coffee mug is

**homotopic**to a doughnut.

*Pic credits: Both were stolen off the web, I don't know from where.*

## Thursday, December 05, 2002

### Experience Mathematics # 21 -Euclid's fifth axiom

Euclid’s fifth axiom says that given a line $l$ and a point $P$ not on the line, there is

**exactly one line**parallel to $l$ passing through the point $P$. For centuries people thought that Euclid’s fifth axiom was “obvious”. But some mathematicians did not find it obvious.

Finally, Reimann and Lobachevsky, both modified the axiom and tried to derive a new geometry.

Reimann began with the axiom: Given a line $l$ and a point $P$ not on the line, there is

Similarly, if we take a hyperbola ($y=1/x$) and rotate it around the y-axis, then we obtain a surface where Lobachevsky’s geometry holds. Lobachevsky’s geometry contains the axiom: Given a line $l$ and a point $P$ not on the line, there is

There is a property of the surface (known as

**no line parallel**to $l$ passing through the point $P$. Reimann derived many geometrical theorems that are applicable on the surface of a sphere. For example, he showed that the sum of angles of a triangle is always greater than 180 degrees. Try drawing a triangle on a sphere and see why this has to be true.Similarly, if we take a hyperbola ($y=1/x$) and rotate it around the y-axis, then we obtain a surface where Lobachevsky’s geometry holds. Lobachevsky’s geometry contains the axiom: Given a line $l$ and a point $P$ not on the line, there is

**more than one line**parallel to $l$ passing through the point $P$. In this geometry, the sum of angles of a triangle is always less than $180$ degrees.There is a property of the surface (known as

**curvature**) that determines the geometry. Only surfaces with curvature zero follow the Euclidean geometry. Another example of a surface is that of a saddle (of a horse). Can you tell which geometry is applicable on this surface?## Friday, November 15, 2002

### Experience Mathematics # 20 -- The sum of angles in a triangle

Euclidean or plane geometry begins with notions of points and lines, and the notion that a point lies on a line. Think of lines as sets, and a point as an element belonging to a set. Points and lines satisfy certain axioms. In Euclidean Geometry (or plane geometry), the axioms are based on Euclid’s original axioms. From these axioms, we can use the rules of logic to derive theorems (or propositions) that can be regarded as truthful statements that apply to the plane. Here a plane is a model, or a mini-universe where those axioms and theorems hold.

For example, consider the theorem: The sum of angles in a triangle is $180$ degrees. The various terms in this theorem (angle, triangle etc.) are constructs in the plane that we wish to study. The theorem itself is a property that will hold in our mini-universe. The proof should proceed from the axioms, use the definitions of the various constructs, and follow the rules of logic.

Even though the theorem is true, it does not imply that the sum all triangles is $180$ degrees. For example, consider the surface of the earth. Draw a triangle with a right angle at the North Pole. Suppose the two sides of this angle go down to the equator, and the third side of the triangle is the equator. The sum of angles of this triangle—made on the surface of the earth—is $270$ degrees!

In fact, in this non-euclidean geometry, the sum of angles in a triangle is always greater that $180$ degrees.

Can you find a surface where a sum of angles in a triangle is always less than $180$ degrees?

For example, consider the theorem: The sum of angles in a triangle is $180$ degrees. The various terms in this theorem (angle, triangle etc.) are constructs in the plane that we wish to study. The theorem itself is a property that will hold in our mini-universe. The proof should proceed from the axioms, use the definitions of the various constructs, and follow the rules of logic.

Even though the theorem is true, it does not imply that the sum all triangles is $180$ degrees. For example, consider the surface of the earth. Draw a triangle with a right angle at the North Pole. Suppose the two sides of this angle go down to the equator, and the third side of the triangle is the equator. The sum of angles of this triangle—made on the surface of the earth—is $270$ degrees!

In fact, in this non-euclidean geometry, the sum of angles in a triangle is always greater that $180$ degrees.

Can you find a surface where a sum of angles in a triangle is always less than $180$ degrees?

## Friday, November 08, 2002

### Experience Mathematics #19 -- Euclid's axioms

Just like elements and sets,

We can think of a line as a set of points. These satisfy certain

However, several gaps were found in Euclid’s axioms. For example, consider Euclid’s proof that the base angles of an isosceles triangle are equal. Suppose we have an isosceles triangle $ABC$, where the side $AB$ is equal to the side $AC$. Drop a perpendicular $AD$ from a vertex to the side $BC$. There is nothing in Euclid’s axioms that says that the point $D$ is between the points $B$ and $C$. Nevertheless, Euclid proves that the triangles $ABD$ and $ACD$ are congruent. From this it is easy to see that the base angles of an isosceles triangle are equal.

The great mathematician Hilbert completed Euclid’s work by listing a few more axioms. These included the

To return to Euclid’s proof, some steps need to be added to show that $D$ is between $B$ and $C$.

But that is not all. We could consider a geometry where given a line $l$ and a point $P$ not on the line, there are no lines parallel to $l$ containing the point $P$. Such a

**Points**and**Lines**are undefined notions.We can think of a line as a set of points. These satisfy certain

**axioms**, such as: Given a line $l$ and a point $P$ not on the line, there is only one line that is parallel to $l$ containing the point $P$. Axioms are considered to be self-evident truths.However, several gaps were found in Euclid’s axioms. For example, consider Euclid’s proof that the base angles of an isosceles triangle are equal. Suppose we have an isosceles triangle $ABC$, where the side $AB$ is equal to the side $AC$. Drop a perpendicular $AD$ from a vertex to the side $BC$. There is nothing in Euclid’s axioms that says that the point $D$ is between the points $B$ and $C$. Nevertheless, Euclid proves that the triangles $ABD$ and $ACD$ are congruent. From this it is easy to see that the base angles of an isosceles triangle are equal.

The great mathematician Hilbert completed Euclid’s work by listing a few more axioms. These included the

**betweenness axioms**. For example, given three points $A, B and C$, one of the axioms said either $B$ is between $A$ and $C$, or $C$ is between $A$ and $B$ or $A$ is between $C$ and $B$.To return to Euclid’s proof, some steps need to be added to show that $D$ is between $B$ and $C$.

But that is not all. We could consider a geometry where given a line $l$ and a point $P$ not on the line, there are no lines parallel to $l$ containing the point $P$. Such a

**non-euclidean geometry**exists on the surface of the Earth. So one of Euclid’s axioms cannot be considered to be a self-evident truth after all.

## Friday, October 25, 2002

### Experience Mathematics #18 - All about itself

Russel’s Paradox shows that considering sets that contain themselves (or even asking whether they contain themselves or not) can lead to contradictory situations. But Real Life has many such self-referential situations. In this column, we will collect together many amusing (and not!) statements, such as

*this*one.

“All Cretans are Liars”, said the Cretan Epimenides. Did Epimenides tell the truth? How can he, since he is a Cretan, and hence a liar? But if he lied, maybe he is telling the truth!

What about: This sentence is false. Is it true or false? Go through each sentence in this column and evaluate whether it is true or false.

This sentence has four words. This one, however, has six words. This one has one too too many words.

This sentence has no comma. This sentence does not describe itself.

This article is written by the author of this article. In other words, the author of Experience Mathematics writes Experience Mathematics. It is self-referential, since it refers to itself. In fact, the article refers to itself several times—but only once does the article refer to itself twice in one sentence. The author of this article is careful not to write self-referential statements.

Is this a question or not. How about this statement?

The above two statements beg the question. But what is the question? Was that the question? Does this answer the question?

The sentence below is false. The above sentence is true.

Lets not say any more, and end.

## Friday, October 11, 2002

### Experience Mathematics # 17 -- If it is, then it is not

A set can be

Sets can be of two types: those that contain themselves, and those that do not. For example, consider the set $F$ of fruits in your home. This set is not a fruit, so cannot contain itself. Now consider the set $A$. The set $A$ contains all sets that can be described in less than sixteen words. The above sentence has only $15$ words and describes $A$, so $A$ must be a member of itself.

Now consider the set $R$ of all sets that

Well, if it is, then by definition $R$ consists of sets that do not contain themselves as a member. So $R$ is not a member of $R$. In short, if it is, then it is not.

Conversely, suppose $R$ is not a member of itself. Then since $R$ contains all sets that are not members of themselves, $R$ must be an element of $R$. Thus, if it is not, it is!

This paradox—pointed out the famous philosopher, Bertrand Russell—led to the formalization of set theory. Formally speaking, a ‘set’ and the relation ‘is an element of’ are undefined notions that satisfy certain axioms. However, we can continue to think of a set as a collection of objects. Just make sure that we consider only well defined sets—where we can decide whether any given object is an element of the set or not. That saves us from all Russellian disasters.

*thought*of as a collection of objects. But what is it, really? The above sentence does not say: A set is a collection of objects. So is a set a collection of objects, or can it only be*thought of*as a collection of objects?Sets can be of two types: those that contain themselves, and those that do not. For example, consider the set $F$ of fruits in your home. This set is not a fruit, so cannot contain itself. Now consider the set $A$. The set $A$ contains all sets that can be described in less than sixteen words. The above sentence has only $15$ words and describes $A$, so $A$ must be a member of itself.

Now consider the set $R$ of all sets that

**do not**contain themselves as a member. In particular, $F$ is a member of $R$. The question is: Is $R$ a member of itself?Well, if it is, then by definition $R$ consists of sets that do not contain themselves as a member. So $R$ is not a member of $R$. In short, if it is, then it is not.

Conversely, suppose $R$ is not a member of itself. Then since $R$ contains all sets that are not members of themselves, $R$ must be an element of $R$. Thus, if it is not, it is!

This paradox—pointed out the famous philosopher, Bertrand Russell—led to the formalization of set theory. Formally speaking, a ‘set’ and the relation ‘is an element of’ are undefined notions that satisfy certain axioms. However, we can continue to think of a set as a collection of objects. Just make sure that we consider only well defined sets—where we can decide whether any given object is an element of the set or not. That saves us from all Russellian disasters.

## Thursday, October 03, 2002

### Experience Mathematics #16 -- An apple a day

If you study mathematics, then you will have to deal with many statements that contain expressions of the form: If $A$ then $B$ (or, $A$ implies $B$).

Suppose it is true that if you have an Apple a day, then you keep the doctor away. Is it true that if you did not visit the doctor, then you must have had an Apple everyday? Not necessarily. In other words: “if $A$ then $B$” is a true statement, then “if $B$, then $A$” may be false. The statement “if $B$, then $A$” is the

The converse is not to be confused with the

1. An Orange contains the daily requirement of Vitamin C.

2. Having your daily requirement of Vitamin C will keep you healthy.

3. If you are healthy, the doctor will stay away

Then, logic dictates that an Orange a day will keep the doctor away. Unfortunately, an Apple does not contain a lot of Vitamin C.

Suppose it is true that if you have an Apple a day, then you keep the doctor away. Is it true that if you did not visit the doctor, then you must have had an Apple everyday? Not necessarily. In other words: “if $A$ then $B$” is a true statement, then “if $B$, then $A$” may be false. The statement “if $B$, then $A$” is the

**converse**of “if $A$ then $B$”.The converse is not to be confused with the

**contrapositive**of the statement. The contrapositive of “if $A$ then $B$” is: “if not $B$ then not $A$”. Unlike the converse, if a statement is true, its contrapositive is true too. Indeed, either they are both true, or they are both false. For example, suppose that it is true that an Apple a day keeps the doctor away. Now if the doctor comes to visit you, you must not have had an Apple some day. Mathematics contains axioms (that may be regarded as “truths”) together with chains of implications—statements of the form “$A$ implies $B$”, where $A$ and $B$ are mathematical expressions. Suppose your axioms say:1. An Orange contains the daily requirement of Vitamin C.

2. Having your daily requirement of Vitamin C will keep you healthy.

3. If you are healthy, the doctor will stay away

Then, logic dictates that an Orange a day will keep the doctor away. Unfortunately, an Apple does not contain a lot of Vitamin C.

## Friday, September 27, 2002

### Experience Mathematics # 15 : OR and AND

Suppose that your mom says that you can have either an Apple or a Banana. Can you have both? One of the most fundamental rules of logic says that the expression

What if your mom says you can have an Apple

Suppose your mom asks you if you have had an Apple or a Banana. Can you honestly say yes if you have had an Apple and an Orange? The answer is yes. If she asks you if you have had an Apple

Suppose your mom insists that you should not have an Apple. Is it OK to have a Banana? How about Baked Beans? It depends. The alternatives to an Apple allowed by your mom depend on the context. For example, if the alternatives allowed consist of the other fruits in the house, you cannot have baked beans instead of the Apple, but you could have a Banana. However, if the context of discussion is the five servings of fruits and vegetables that you must have every day, then Baked Beans are allowed. In Mathematics, when we refer to a set $A$, then we must specify the universal set $U$ from where the elements of $A$ are picked. Then the complement of $A$ is the set of all the elements that are in $U$ but not in $A$. Then there is no confusion when we claim: $a$ is not an element of $A$. By this statement we mean that $a$ is an element of the complement of $A$.

**either**$A$**or**$B$ is true only if one of $A$ or $B$ is true. That is to say, you cannot have both the Apple and the Banana (assuming you wish to obey your mom.)What if your mom says you can have an Apple

**or**a Banana? In this case, you can have both.Suppose your mom asks you if you have had an Apple or a Banana. Can you honestly say yes if you have had an Apple and an Orange? The answer is yes. If she asks you if you have had an Apple

**and**a Banana, you can answer yes only if you have had both.Suppose your mom insists that you should not have an Apple. Is it OK to have a Banana? How about Baked Beans? It depends. The alternatives to an Apple allowed by your mom depend on the context. For example, if the alternatives allowed consist of the other fruits in the house, you cannot have baked beans instead of the Apple, but you could have a Banana. However, if the context of discussion is the five servings of fruits and vegetables that you must have every day, then Baked Beans are allowed. In Mathematics, when we refer to a set $A$, then we must specify the universal set $U$ from where the elements of $A$ are picked. Then the complement of $A$ is the set of all the elements that are in $U$ but not in $A$. Then there is no confusion when we claim: $a$ is not an element of $A$. By this statement we mean that $a$ is an element of the complement of $A$.

## Tuesday, September 17, 2002

### Experience Mathematics #14 - Uncountable sets

Many of the infinite sets we have encountered are countable. Even numbers, the set of prime numbers, integers and rational numbers, all have the same number of elements as $N$, the set of natural numbers. Are there any infinite sets that have more elements than the natural numbers?

This question was answered by Cantor, who showed that the real numbers outnumber the natural numbers. All the real numbers between $0$ and $1$ have a decimal expansion such as $x=0.13212987\dots$. Cantor showed that all numbers of this form

To return to Cantor’s proof, suppose that you are able to find a one-to-one correspondence between the natural numbers and all the real numbers in the interval $(0,1)$. Let us denote by $x_1$ the number corresponding to $1$; $x_2$, the number corresponding to $2$, and so on. Now consider a number $y$ (between $0$ and $1$) that is different from $x_1$ in the first place after the decimal; different from $x_2$ in the second place after the decimal; and so on. Clearly, $y$ cannot appear in the list, since it is different from all the $x$’s. Thus we have found a real number between $0$ and $1$ that is not in the above correspondence. This contradiction shows that no such correspondence is possible. In other words, the real numbers are

Are there any infinite sets that have more elements than $N$ but less elements than the set of real numbers?

This question was answered by Cantor, who showed that the real numbers outnumber the natural numbers. All the real numbers between $0$ and $1$ have a decimal expansion such as $x=0.13212987\dots$. Cantor showed that all numbers of this form

**cannot**be put into one-to-one correspondence with the set of natural numbers. To be able to understand his proof, find a number that differs from $x$ in the first decimal place. Take any number $y$ with $2$ in the first decimal place. Since $2$ is different from $1$, $y$ differs from $x$ in the first decimal place.To return to Cantor’s proof, suppose that you are able to find a one-to-one correspondence between the natural numbers and all the real numbers in the interval $(0,1)$. Let us denote by $x_1$ the number corresponding to $1$; $x_2$, the number corresponding to $2$, and so on. Now consider a number $y$ (between $0$ and $1$) that is different from $x_1$ in the first place after the decimal; different from $x_2$ in the second place after the decimal; and so on. Clearly, $y$ cannot appear in the list, since it is different from all the $x$’s. Thus we have found a real number between $0$ and $1$ that is not in the above correspondence. This contradiction shows that no such correspondence is possible. In other words, the real numbers are

**uncountable**in number.Are there any infinite sets that have more elements than $N$ but less elements than the set of real numbers?

## Thursday, September 12, 2002

### Experience Mathematics #13 - The cartesian society in Hilbert Hotel

A set S is countable if it can be put in one-to-one correspondence with $N$. Suppose that you are the manager of the Hilbert Hotel, a hotel with a countable number of rooms. Now, even though the hotel is full, when $200$ new guests arrive after lunch at the Restaurant at the End of the Universe, you can accommodate them. All you have to do is to move the guests in Room $1$ to Room $201$, the guests in Room $2$ to Room $202$, etc. In other words, you will move the guests in Room $n$ to Room $200+n$.

Now, suppose the hotel is empty. The members of the Cartesian Society (Motto: We Think, Therefore We Exist!) decide to have a convention. Each member of the Cartesian Society has an identification mark of the form $(a, b)$, where $a$ and $b$ are natural numbers. The chairman of the society is $(1,1)$ and for any two numbers $a$ and $b$, there is a member corresponding to the ordered pair $(a, b)$. Don’t confuse $(2,3)$ with $(3,2)$: they are quite different people. There are many, many members in this society. But all of them can be accommodated in the Hilbert Hotel. Can you find a one-to-one correspondence of the members of the Cartesian Society with the natural numbers?

First write down the ID numbers of all the members of the Cartesian Society in the form of a table. For example, put $(3,5)$ in the third row and the fifth column of the table. Now find a way to “count” them. In other words, assign a natural number to each of them in a systematic fashion.

## Friday, September 06, 2002

### Experience Mathematics #12 -- A part can be equal to the whole!

A set S is countable if it can be put in one-to-one correspondence with $N$. For example, if we take the set of even numbers, we can establish a one-to-one correspondence as follows. $1$ corresponds to $2$, $2$ to $4$, $3$ to $6$, and so on. This shows that the number of even numbers is equal to the number of natural numbers.

This contradictory idea—that a part of an object is equal to the whole—troubled many philosophers. But they got over it, and began to compare the concept of infinity with the concept of God. However, when Biologists made it possible to clone human beings, they have stopped approving of the idea.

The famous mathematician Hilbert told the story of a hotel with an infinite number of rooms. Suppose the Hilbert Hotel is full, but the hotel manager wants to accommodate a guest who arrives suddenly. How does he manage that? Well, he asks the guest in room number $1$ to move to Room $2$, the guest in Room $2$ to move to Room $3$, and so on. Room $1$ becomes empty and is readied for the new guest. Can you figure out how to accommodate $30$ guests, even if the hotel is full?

The famous mathematician Hilbert told the story of a hotel with an infinite number of rooms. Suppose the Hilbert Hotel is full, but the hotel manager wants to accommodate a guest who arrives suddenly. How does he manage that? Well, he asks the guest in room number $1$ to move to Room $2$, the guest in Room $2$ to move to Room $3$, and so on. Room $1$ becomes empty and is readied for the new guest. Can you figure out how to accommodate $30$ guests, even if the hotel is full?

What if a travel agent calls the manager, and says she is sending groups of tourists to the hotel. The numbers of people in the groups are: $3$, $7$, $11$, $15$, and so on. Help the manager come up with the required one-to-one correspondence in these cases, so that he can accommodate all the guests.

## Friday, August 30, 2002

### Experience Mathematics # 11 -- Counting

How can you tell if there are enough chairs in your classroom so that every student has a chair? One way is to count the chairs and the number of students in your class. A simpler way is to ask each student to sit down. If all the students are able to sit down, and no chair is left over, the number of students and chairs is equal.

This fundamental idea is at the heart of mathematics, because it deals with counting. Just like there is a weight that represents a kilogram, there is a unit in mathematics that represents a number $n$. Let $I(n)$ be the set containing the first $n$ natural numbers. The set $I(n)$ is the “unit” that represents the number $n$. For example, the set $A$ with elements $a, b, c, \dots, z$, has $26$ elements because this set can be put in one to one correspondence with $I(26)$.

This fundamental idea is at the heart of mathematics, because it deals with counting. Just like there is a weight that represents a kilogram, there is a unit in mathematics that represents a number $n$. Let $I(n)$ be the set containing the first $n$ natural numbers. The set $I(n)$ is the “unit” that represents the number $n$. For example, the set $A$ with elements $a, b, c, \dots, z$, has $26$ elements because this set can be put in one to one correspondence with $I(26)$.

But what about infinite sets? The set $N$ of natural numbers is a unit for infinite sets. We say a set $S$ is countable if it can be put in one to one correspondence with $N$. It is remarkable that the following subsets of $N$ are countable. Can you find the one to one correspondence between $N$ and these sets?

1. The set of all even numbers.

2. The set with elements $1, 4, 7, 10, \dots$

3. The set of all rational numbers.

Can you show that the set of prime numbers is countable?

When it comes to infinite sets, a part can be equal to the whole.

1. The set of all even numbers.

2. The set with elements $1, 4, 7, 10, \dots$

3. The set of all rational numbers.

Can you show that the set of prime numbers is countable?

When it comes to infinite sets, a part can be equal to the whole.

## Wednesday, August 21, 2002

### Experience Mathematics #10 -- Sets

A fundamental object in mathematics is a

We say that a set $B$ is a subset of a set $A$ if each element of $B$ is also in $A$. Two sets are equal if they are subsets of each other. The empty set is a subset of every set. For example the set of even numbers $\left\{ 2, 4, 6, \dots\right\}$ is a subset of $N$.

Q1. How many subsets does the empty set have? (Hint: There is atleast one subset.)

The members of the set are called its

Let $I(n)$ denote the set containing the first $n$ natural numbers. The set $I(n)$ has n elements.

Q2. List all the subsets of the set $I(1)$. How many subsets does $I(1)$ have?

Q3. List all the subsets of the set $I(2)$. How many subsets does $I(2)$ have?

Q4. List all the subsets of the set $I(3)$. How many subsets does $I(3)$ have?

Suppose you delete $3$ from each subset of $I(3)$. What do you get? Use this idea to do Q5.

Q5. List all the subsets of the set $I(4)$. How many subsets does $I(4)$ have?

Q6. How many subsets does $I(n)$ have? Guess the answer from your experiments above.

If you cannot find a pattern, you must have made a mistake in listing the sets earlier.

**set**. You can think of a set as a collection of objects. We are familiar with the set $N$ of natural numbers. The empty set is a set with no elements.We say that a set $B$ is a subset of a set $A$ if each element of $B$ is also in $A$. Two sets are equal if they are subsets of each other. The empty set is a subset of every set. For example the set of even numbers $\left\{ 2, 4, 6, \dots\right\}$ is a subset of $N$.

Q1. How many subsets does the empty set have? (Hint: There is atleast one subset.)

The members of the set are called its

**elements**.Let $I(n)$ denote the set containing the first $n$ natural numbers. The set $I(n)$ has n elements.

Q2. List all the subsets of the set $I(1)$. How many subsets does $I(1)$ have?

Q3. List all the subsets of the set $I(2)$. How many subsets does $I(2)$ have?

Q4. List all the subsets of the set $I(3)$. How many subsets does $I(3)$ have?

Suppose you delete $3$ from each subset of $I(3)$. What do you get? Use this idea to do Q5.

Q5. List all the subsets of the set $I(4)$. How many subsets does $I(4)$ have?

Q6. How many subsets does $I(n)$ have? Guess the answer from your experiments above.

If you cannot find a pattern, you must have made a mistake in listing the sets earlier.

Subscribe to:
Posts (Atom)