7-colour theorem on the torus | Euler characteristic #2

preview_player
Показать описание


Files for download:

We only need 4 colours to colour any map on a plane. What if we want to colour a map on a torus? Turns out we need 7 colours, but why? The 7-colour theorem was proved way earlier than the 4-colour one, but why? A torus seems to be more complicated than a plane! Find out by watching this video.

Sources / Further reading:

(3) Heawood’s original paper is this: Heawood, P. J. (1890). "Map colour theorem". Quarterly Journal of Mathematics. 24: 332–338.

However, I can’t find it online, and couldn’t verify myself whether he actually proved the 7-colour theorem in this 1890 paper. The sources below (papers from 1950s to 60s) claimed that Heawood did this in the 1890 paper:

(4) The proof itself:

[Lecture notes on Part II Graph theory in 2021, using p. 34-35]

[Lecture notes for same course in 2007, but less detailed, p. 27-28]

(6) Vihart’s video on the 7-colour theorem, showing it is possible but not proving it:

This channel is meant to showcase interesting but underrated maths (and physics) topics and approaches, either with completely novel topics, or a well-known topic with a novel approach. If the novel approach resonates better with you, great! But the videos have never meant to be pedagogical - in fact, please please PLEASE do NOT use YouTube videos to learn a subject.

Video chapters:
00:00 Introduction
02:38 Degree sum = 2E
04:05 3F ≤ 2E
06:46 The proof - minimal example
09:33 Combining inequalities
13:22 Is the bound sharp?
15:09 My #SoMEpi favourites

Other than commenting on the video, you are very welcome to fill in a Google form linked below, which helps me make better videos by catering for your math levels:

If you want to know more interesting Mathematics, stay tuned for the next video!

SUBSCRIBE and see you in the next video!

If you are wondering how I made all these videos, even though it is stylistically similar to 3Blue1Brown, I don't use his animation engine Manim, but I use PowerPoint, GeoGebra, and (sometimes) Mathematica to produce the videos.

Social media:

For my contact email, check my About page on a PC.

See you next time!
Рекомендации по теме
Комментарии
Автор

Originally, I combined the previous video and this one, and found that it was probably too long, and so I split it up. The next video is also related to Euler characteristic - can you guess what it is?

mathemaniac
Автор

Puzzle: how to color to minimize population loss if all blue countries turn into water

.
Автор

the fact that that formula still "works" in the case g = 0 is one of the freakiest things in all of math

johnchessant
Автор

Thanks, I now know I can get a perfect 7 icing distribution on my donuts.

bridgeon
Автор

This four-color problem becoming easier to prove/disprove when you move from a flat surface to a torus reminds me of how the goat grazing problem got easier when you increase dimensions to the 3D analog with the tethered bird. It seems like some math problems have a tendency of becoming simpler when you increase dimensions.

NotSomeJustinWithoutAMoustache
Автор

The 7-color theorem for a torus really shows how fascinating math can get when we explore surfaces beyond the plane! It’s incredible that proving it is simpler than the 4-color theorem. Studying concepts like this alongside tools like SolutionInn has really helped me understand the beauty of topology and geometry.

Blingsss
Автор

This is something I've been curious about for a while, so thanks for the (relatively) simple explanation. The torus is topologically the same as a parallelogram if the parallelogram is joined to itself at the edges to form an infinitely repeating pattern. It's fairly simple to color a hexagonal tiling of the plane in a repeating pattern so that each hexagon and its six neighbors are all different colors. The pattern is repeating, so it can mapped to a torus and the resulting graph is the complete graph on seven vertices, thus proving that 7 colors are necessary.

rdbury
Автор

when I saw the title, I immediately thought, it can't be easy to do the impossible of proving a false statement

kaidatong
Автор

I'm actually kind of surprised by how simple the proof is in this case (as long as you're willing to black box some stuff about Euler characteristic, at least)! Good work as always.

convergentseries
Автор

Ah, so that's why our maps aren't projected onto a torus; you need way more colours.

inciaradible
Автор

The Heawood characteristic applying to a plane is simultaneously awesome and a great reminder of why learning math is a lot more than memorizing results

flyingbicycles
Автор

Man please keep up this good work. Your videos really do help in understanding mathematics and what's happening visually!

thehyperfinestructure
Автор

So beautiful. Hoping for more videos.
To step onto the path of knowledge and this is what a beautiful path. To share the joy of knowing with others and this is what a beautiful feeling.
May God bless your lives.

Khashayarissi-obyj
Автор

Excellent video as always. And thanks for the shoutout!

mostly_mental
Автор

This was excellent, the math is well above my understanding truly but we are getting closer to understanding our realm, this was great.

Magnelibra
Автор

Loved the shoutout at the end. I have been looking for mathy (and ML-y) channels for a while. Found some amazing ones off of SOME-x submissions. Maybe a list of small channels with high quality content would be an amazing resource for the community :)

mynamemywish
Автор

Ive just started the video, so i dont know where this is going to go, but i wanted to respond to the statement "a torus seems more complicated than the plane, yet the 7 color theorem was proved so much earlier than the 4 color theorem." Ive found this phenomenon in math more than a couple times: what may initially seem like additional complexity is actually additional structure you can kind of "grab onto" when proving a statement about that object. This isnt always the case, but id bet its happening here.

kruksog
Автор

Including the ocean, it is not possible to do the 4 color theorem on a map, because or saint martin
France, Netherlands, Belgium, Germany, and the Sea all border eachother, requiring 5 colors (france and netherlands border on saint martin)

cubefromblender
Автор

Question: Why is 4-color theorem easier on the torus?

Answer: because it is false.

TheOneMaddin
Автор

can we redraw torus graph in term of knots?

DeathSugar
welcome to shbcf.ru