Journey into Maths Country : Season 2

The Monty Hall paradox, named after a game show from the 60s, concerns the way in which information acquired during the course of a game modifies (or not) the winning statistics. Theoretically solved, the question is so disturbing to our worldview that it continues to be the subject of passionate debate to this day.

Simpson's Paradox

Statistics seem, almost by their very nature, to convey a positivist message. They are, in fact, a formidable tool in the attempt to master the complexity of the real world... But numerous "biases" threaten any discourse that refers to them without care: an over-simplistic reading of the figures can lead us - for example - to confuse correlation with causation... And more complex phenomena (notably Simpson's paradox) can distort conclusions that seem objective.

Non-Euclidean Geometries

For centuries, geometry was based on Euclid's postulates, which seemed eternal and irrevocable. However, one of the postulates (the fifth) has always seemed "a little less natural" than the others, and hundreds of mathematicians have tried in vain to do without it by deducing it from the other postulates. In the mid-19th century, Bernhard Riemann came up with a novel idea: let's imagine it's false! This was the birth of "non-Euclidean geometries", which would later have major applications in physics.

Planar Tessellations

A tessellation is a way of covering a plane with a repeating pattern... Basically, it's like creating wallpaper. In 1975, Marjorie Rice (1923- 2017), a mother and amateur mathematician, read an article by Martin Gardner in Scientific American that listed ALL possible "pentagonal tessellations" in the plane. A mathematician had just proved that the list was complete. Except that Marjorie, working alone at home, found 4 new ones... The theorem was wrong!

Graph Theory

The question is how to make a network that is both "economical" and "robust" without taking up too much space. This is a theoretical question worked on by the great Russian mathematician Andrey Kolmogorov (1903-1987). But this theoretical question also conditions the way in which we can build a computer network or... a human brain: to be intelligent without having a big head, you need a neural network that is efficient BUT ALSO compact! Mention Szemeredi lemma?

Alicia Boole in the Land of Polytopes

To begin with, there are the five "Platonic solids" beloved of geometers: the cube, the tetrahedron, the octahedron, the dodecahedron and the icosahedron. But why stop at the 3 dimensions of ordinary space? Alicia Boole Stott has devoted her life to finding regular solids in dimension 4... and she's found them! A journey into unsuspected mathematical regions.

The Kepler Conjecture, or How to Store Your Cannonballs

When mathematics tells us the best way to stack oranges... Formulated in 1611, Kepler's conjecture was finally proved by Thomas Hales... in 1998! Using computational methods unorthodox for his colleagues. The certification of mathematical demonstrations is an arduous and tedious process.

Chaos Theory or Order in Disorder

Can the flap of a butterfly's wings in Brazil trigger a tornado in Texas? Behind Edward Lorenz's all-too-famous question lies a mathematical theory of things we'd never imagined before belonged to the land of maths: complex systems like those that describe the weather, or even... human affairs!

Kovaleskaya's Spinning Top or The Best Way to Spin

How do you model the movement of a potato in space? Many a mathematician has struggled with this question. At the end of the 19th century, mathematician Sofia Kovalevskaya finally obtained an important result for determining the motion of a solid around a fixed point, thanks to a very special spinning top. A little expedition to the heart of integrable systems, even if it's a bit dizzying...

Entscheidungsproblem: The End of Mathematics?

Imagine a world where a machine could calculate true and false... Failing that, Church, Herbrand, Gödel and Turing each tried in their own way to determine whether an algorithm could decide whether or not a mathematical assertion could be proved. The Entscheidungsproblem, the decision problem that rocked maths and, in the process, laid the foundations of computer science.