INTRODUCING 5 - days-a-week problem solving session for Math Olympiad and ISI Entrance. Learn More

*Presently I am active in learning and teaching mathematics. This series of articles is intended for recording my experiences in this profession.*

Today, in Math Olympiad training session, we discussed paper folding geometry. Historically, art and mathematics of paper folding flourished in Japan where it is popularly known as origami. In the last decade of 19th century, an Indian mathematician from Harvard University wrote a survey paper on this topic. That led to increased activity in this area of mathematics.

In today's class, we discussed the construction of rational numbers by folding a square sheet of paper.

Given a square sheet of paper, mark it's four corners as shown in the diagram below.

Clearly length of AD is 1 unit starting from A (0 point) and ending at D (1 point). Our objective is to mark all rational numbers from 0 to 1, on the line segment AD. But this must be achieved without using a straight edge (by paper folding alone).

It is east to mark the 1/2 point. Place A on D and B on C. A crease will be formed at the middle of this paper. This crease is named EF where F is the desired 1/2 mark on segment AD.

In fact, this trivial technique can be employed to mark off on AD. For example, the point 1/4 can be found easily by placing B on E and A on F and so on.

Tricky part is to find an algorithm to construct given any natural number n. Fortunately, this is not hard either.

Consider the two equations:

Solution to these two equations is

- y=x line is found by folding along diagonal AC
- y = -nx + 1 line is found by folding along BF' where the coordinate of F' is (1/n, 0)

Thus, if we know how to construct 1/n, we found a method to construct . Since we know how to construct 1/2, by induction the rest follows. Following diagram describes construction of (1/3, 1/3).

Finally, we get (1/3, 0) by folding through (1/3, 1/3) and making sure B falls on BC segment and A falls on AD segment. The crease E'F' gives F' which is (1/3, 0) point on AD.

Again by joining BF' we can find (1/4, 1/4) and so on.

One may easily construct any rational between 0 and 1 after all the 1/n's are constructed. To construct a rational number p/q (between 0 and 1), first, construct 1/q, then fold it p times.

In fact, we have technically constructed ALL rational numbers. To construct a rational bigger than 1, just take a bigger square.

The discussion session concluded with a search for a similar algorithm to construct where n is not a perfect square. We noted (without proof or illustration) that this method of geometric construction has a distinct advantage over compass-straight edge construction. Galois Theory confirms that it is impossible to construct cube root of certain numbers using compass and unmarked straightedge. However using paper folding techniques one may achieve that feat quite easily.

Later I was personally working on Algebraic Topology problems. An assignment problem asked this:

After the arduous development of point set topology, my Ph.D. coursework has now turned to relatively more appealing stuff: interaction of algebra and topology. In fact, this portion of the course is in some sense 'easier' than the initial program. We are following Aspects in Topology by Christenson.

The main objective of algebraic topology is, in author's words: answer topological questions by translating them into algebraic ones.

The author begins quickly by introducing Fundamental Group (or first homotopy group).

**1.1 Loop:**X be a topological space and be a point in it. Loop f based at is a continuous map from I (closed interval [0,1] equipped with the subspace topology from euclidean space) to X such that

Visually speaking a loop is NOT exactly what 'sounds' like. Note that in the figure below f(I) 'looks' like a loop, where f **is **the loop. There is no way to 'visualize' the function (or loop). Often we visualize it's image only.

Next, we develop equivalence classes of the family of loops. Such an equivalence relation is induced by the notion of 'homotopy'. A loop f is homotopic to another loop g if one's image can be continuously shrunk to the image of the other. An illustration is given in the following image:

To formalize the idea, we develop a series of easy definitions and theorems.

*Notation:*

- All functions handled hereafter are continuous and the word 'continuous function' coincides with 'map'.
- I =[0,1] with the usual topology.

**1.2 Topological Pair:**(X, A) is a topological pair (X is a space, A is its subspace)**1.3 Mapping of Pairs:**f : (X, A) --> (Y, B) such that**1.4 Homotopy Relative to A:**such that F(x, 0) = f(x), F(x, 1) = g(x), F(a, t) = f(a) = g(a) (for all a contained in A and all t in [0,1] ).**1.5**f ~ g (mod A) or f ~ g (if A is null) expresses the above situation in short. We say f is relatively homotopic to g mod A

(This diagram is partly inspired by author, though I have added little tidbits. It should self-explanatory)

**1.6 C**((X, A), (Y, B)) is the family of continuous functions from X to Y that maps A inside B.**1.7 Theorem: Relative Homotopy (mod A) is an equivalence relation on****C**((X, A), (Y, B))- Proof: f, g, h be three elements.
**Reflexive:**f ~ f. Set F(x, t) = f(x) for all t in [0,1]**Symmetric:**Say f~g. The there is a homotopy F. Define homotopy F'(x, t) = F(x, 1-t) (the process keeps f(A) freeze).**Transitive:**Say f~g and g~h. Then there are homotopies R and S, such that R(x, t) maps f to g (rather their images) and S(x, t) maps g to h. We construct homotopy T as:

T(x, t) = R(x, 2t) for .

T(x, t) = S(x, 2t-1) for

Clearly T does everything that we need it do. We have to check continuity. Note that R(x, 1/2) = S(x, 1/2) = g(x). Hence, T is continuous by**Map Gluing Theorem**

- Proof: f, g, h be three elements.
**1.8 Map Gluing Theorem (Recap):**Suppose A and B are closed subsets of a topological space J. Let Y be an arbitrary space. be continuous functions such that . Then the function defined by

h(x) = f(x) if x in A

g(x) if x in B

is continuous.**Application in above context:**Here

Set A = {0,1}, X = [0,1], Y to be an arbitrary space and B = {y}. Clearly all maps from (X, A) to (Y, B) are the loops that we discussed earlier.

We know that equivalence relation on a set (in this case set of loops), creates equivalence classes. We will write the equivalence class of 'f' as [f].

Next, we want to impose a group structure on the family of equivalence classes (of loops ). Hence, we need:

- A binary operation (between equivalence classes of loops) that is associative
- An identity element

Both of these are achieved very easily and in an obvious way:

**1.9 Binary Operation:**[f].[g] = [f*g], where (f*g)(t) = f(2t) if and g(2t -1) if (again the map gluing theorem is in action to ensure continuity). Note that unlike function composition we first perform f and then perform g.**1.10 Binary operation defined in 1.9 is well defined.**Say f ~ f' and g ~ g'. We want to show f*g ~ f'*g'. We will create the obvious homotopy mapping f*g to f'*g'

*(to be continued)*

Advanced Mathematical Science. Taught by olympians, researchers and true masters of the subject.

JOIN TRIAL
Google