the game of hex and the brouwer fixed-point theorem
TRANSCRIPT
![Page 1: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/1.jpg)
FMIS
Functional & Molecular
Imaging System Lab
http://rals.snu.ac.kr/nm
The Game of Hex
and
the Brouwer Fixed-Point Theorem
TAEHEE LEE
(School of Electrical and Computer Engineering
& Mathematical Sciences)
![Page 2: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/2.jpg)
FMIS
Good News :)
Takes less than 1 hour
and Main Idea is attractive
(Written in English for 2 Post-Docs)
![Page 3: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/3.jpg)
FMIS
Bad News
Because It’s content is far from
what we have learned in this course,
Need to get some Background
Information
![Page 4: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/4.jpg)
FMIS
OBJECTIVE
Hex Theorem
=
Brouwer Fixed-Point Theorem
![Page 5: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/5.jpg)
FMIS
Contents
1. Hex?
2. Brower Fixed-Point Theorem?
3. =?
![Page 6: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/6.jpg)
FMIS
What is Hex?
2 Player Board game
• Marking hexagon with X or O alternatively
• Marking a connected set of tiles meeting the boundary regions X~X’ (or O~O’)
![Page 7: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/7.jpg)
FMIS
What is Hex?
• Neither player has won
• But the X-player has a
sure win in 3 moves
• Red curve is called X-path
Who is the winner?
![Page 8: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/8.jpg)
FMIS
What is Hex?
• Yes! It can never end in a draw
Is there always winner?
![Page 9: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/9.jpg)
FMIS
Hex Theorem
If every tile of the Hex board is marked either x or o, then there is either
1) an x-path connecting regions X and X’
2) or an o-path connecting regions O and O’
Is there always winner?
![Page 10: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/10.jpg)
FMIS
Hex Theorem
SO?
• funny analogy gives you some insight
PROOF?
• Rigorous proof is not provided here
![Page 11: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/11.jpg)
FMIS
Hex Theorem
ANALOGY
• X is trying to build a dam
by putting down stones
• O is compared to flowing
water
![Page 12: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/12.jpg)
FMIS
Hex Theorem
• X can succeed in blocking water(X WIN)
• Or NOT (O WIN)
In the End?
There could be ONLY TWO cases
BUT NOT BOTH
![Page 13: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/13.jpg)
FMIS
Brouwer Fixed-Point Theorem
Basic Theorem in Topology
Let f be a continuous mapping
from the unit square I² into itself.
Then there exists x∈ I²
such that f(x) = x
![Page 14: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/14.jpg)
FMIS
Some Notations
Sorry!
Wait For a Moment!
![Page 15: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/15.jpg)
FMIS
Graphical Representation
5 X 5 Hex Board
N, S, E, W : Set of Vertices z = (z1, z2) of Bk
z2 = k, z2 = 0, z1 = k, z1 = 0
![Page 16: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/16.jpg)
FMIS
Revision of Hex Theorem
If every tile of the Hex board is marked either x or o, then there is either
1) an x-path connecting regions X and X’
2) or an o-path connecting regions O and O’
Let Bk be covered by two sets H and V. Then either
1) H contains a connected set meeting E and W
2) V contains a connected set Meeting N and S
![Page 17: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/17.jpg)
FMIS
Then? (B)
Two Theorems are equivalent! Let Bk be covered by two sets H and V. Then either
1) H contains a connected set meeting E and W
2) V contains a connected set Meeting N and S
Let f be a continuous mapping
from the unit square I² into itself.
Then there exists x∈ I² such that f(x) = x
![Page 18: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/18.jpg)
FMIS
“Hex” Implies “Brouwer”
Sorry!
Wait For a Moment!
![Page 19: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/19.jpg)
FMIS
“Hex” Implies “Brouwer”
Four subsets H+, H-, V+, V- of Bk
Claim : H and V Can’t Cover Bk
Disjoint
Not Contiguous
Disjoint
Not Contiguous
![Page 20: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/20.jpg)
FMIS
“Hex” Implies “Brouwer”
Let Bk be covered by two sets H and V. Then either
1) H contains a connected set meeting E and W
2) V contains a connected set Meeting N and S
If two conditions below are satisfied
1) H contains no connected set meeting E and W
2) V contains no connected set Meeting N and S
Two Sets H and V cannot covered Bk
Contraposition
![Page 21: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/21.jpg)
FMIS
“Brouwer” Implies “Hex”
Each point of I² is uniquely expressible as convex combination
of some set of vertices, all of which are adjacent
f : Bk → R can be extended to f’ : Ik² → R
![Page 22: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/22.jpg)
FMIS
“Brouwer” Implies “Hex”
Proof is by contradiction
(We assumes that there is no H path from E to W and no V path
from N to S)
(→ There is NO FIXED POINT in some function f)
Partitioning Bk by H and V
1) W’ = Vertices connected to W by H path
E’ = H – W’
2) S’ = Vertices connected to S by V path
N’ = V – S’
Disjoint
Not Contiguous
Disjoint
Not Contiguous
![Page 23: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/23.jpg)
FMIS
“Brouwer” Implies “Hex”
W’ = Vertices connected to W by H path
E’ = H – W’
(We assumes that there is
no H path from E to W and no V path from N to S)
Define mapping f : Bk → Bk
Extend to all of Ik² and We can see that f has NO FIXED POINT
Need to Check
f is in Bk
Disjoint
Not Contiguous
![Page 24: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/24.jpg)
FMIS
“Brouwer” Implies “Hex”
Define mapping f : Bk → Bk
Extend to all of Ik² and We can see that f has NO FIXED POINT
Disjoint
Not Contiguous
Disjoint
Not Contiguous
![Page 25: The Game of Hex and the Brouwer Fixed-Point Theorem](https://reader030.vdocuments.net/reader030/viewer/2022012015/615a4214a51306731510678c/html5/thumbnails/25.jpg)
FMIS
Thank You!