---
title: "Gale's 1979 proof that Hex's no-draw property implies the Brouwer fixed-point theorem uses a covering argument on an arbitrarily fine Hex board"
type: "claim"
status: "seedling"
writer_model: "claude-sonnet-5"
audit_status: "capture-verified — quotes pulled via a direct extract_pdf read of the primary (not a search summary or fetch-and-summarize tool) at capture time 2026-08-03; tls reported verified. Queen's independent re-check not performed in this headless promotion run (no network access, by design). | AUDIT 2026-08-08 (opus-5, cross-model): re-fetched via extract_pdf (tls verified, sha b62d8b53... matching byte-for-byte, 11pp) and read end to end. Both `source_quote` and `source_quote_2` are verbatim and correctly located in §3, and the JSTOR header confirms Vol. 86, No. 10 (Dec. 1979), pp. 818-827. The proof description in the body, however, did not match the proof and has been rewritten; the original wording is preserved in this record. It said Gale opens 'by assuming a continuous map on the unit square without a fixed point', that the board 'cannot be fully covered by the two players' winning regions', and that non-coverage 'taken to the limit as the board's mesh k -> infinity, produces a fixed point... a contradiction of the no-fixed-point assumption'. In the paper this direction is not a proof by contradiction at all: Gale reduces to approximate fixed points by compactness ('From compactness of I2 it suffices to show that for any e>0 there exists x in I2 such that |f(x)-x|<e'), fixes one board with 1/k < delta rather than passing to a limit in k, and partitions vertices into H+, H-, V+, V- by the direction f displaces them — not into players' winning sets, which are what the Hex Theorem is about and are being ruled out here. The contradiction and the fixed-point-free map belong to the converse direction, the subject of the sibling note. Two smaller items in the same rewrite: 'the constructive half' is dropped, since Gale reserves the constructive claim for the n-dimensional Hex proof of §4 and its fixed-point algorithm; and the paper's stated main purpose is now quoted, because it is this direction. | AUDIT 2026-08-29 (claude-fable-5, cross-model, hygiene fix on sight during the audit of moc-knowing-who-wins-without-knowing-how): the MOC's pre-filing adversarial read had caught a word-reordered Gale quote in the MOC itself; this note still carried the same reordering. CORRECTED the body's occurring to him \"only recently\" and the commentary's \"only recently occurred to me\" to the primary's verbatim \"The proof going in the other direction only occurred to me recently\" (per the sibling note's source_quote_2, itself re-confirmed byte-for-byte in the 2026-08-08 opus-5 audit). No other change."
source_url: "https://www.cijm.org/pdf/Jeux_hex/Article_de_David_Gale_By_courtesy_of_Loic_Cellier.pdf"
source_sha: "b62d8b535f0b29a66444d08e418c035f99fbfb713339b5ca96f729ec29e5b857"
source_author: "David Gale"
source_date: "1979-12"
source_title: "The Game of Hex and the Brouwer Fixed-Point Theorem"
source_venue: "The American Mathematical Monthly, Vol. 86, No. 10 (Dec. 1979), pp. 818-827; publisher Mathematical Association of America"
source_quote: "We first show, that 'Hex' implies 'Brouwer.' Let f : I2→I2 be given by f(x)=(f1(x)f2(x))."
source_quote_2: "By the Hex Theorem, therefore, the sets H and V do not cover Bk, completing the proof."
source_tier: 1
provenance: "Promotion from 10-inbox/raw/2026-08-03-pull-the-exact-quoted-sentence-from-gales-1979.md, 2026-08-07"
origin: "batch"
derived_from: "10-inbox/raw/2026-08-03-pull-the-exact-quoted-sentence-from-gales-1979.md"
date_created: "2026-08-07T00:00:00.000Z"
tags: ["hex","topology","brouwer-fixed-point-theorem","david-gale","topological-combinatorics","history-of-mathematics","quote-verification"]
audits: ["2026-08-08 claude-opus-5","2026-08-29 claude-fable-5"]
seek_code_commit: "649b1a4"
---


In Section 3 of "The Game of Hex and the Brouwer Fixed-Point Theorem"
(*The American Mathematical Monthly*, 1979), David Gale opens the first
half of his equivalence proof — "We first show, that 'Hex' implies
'Brouwer.'" — with an approximation argument rather than a proof by
contradiction. Given a continuous $f: I^2 \to I^2$, compactness of the
square reduces the theorem to producing points that move arbitrarily
little: "From compactness of $I^2$ it suffices to show that for any
$\varepsilon > 0$ there exists $x \in I^2$ such that
$|f(x) - x| < \varepsilon$." Uniform continuity supplies a
$\delta < \varepsilon$, and Gale then takes a Hex board $B_k$ fine enough
that $1/k < \delta$ — this is where "arbitrarily fine" enters, as a choice
made per $\varepsilon$, not a limit. The board's vertices are sorted into
four sets $H^+, H^-, V^+, V^-$ by the *direction* $f$ moves them, not by
who owns them: "a vertex $z$ belongs to $H^+, H^-, V^+, V^-$ according as
$z/k$ is moved by $f$ at least $\varepsilon$ units to the right, left, up,
or down." Gale shows $H^+$ and $H^-$ are not contiguous, and likewise
$V^+$ and $V^-$, so no connected subset of $H = H^+ \cup H^-$ meets both
the E and W boundaries and none of $V = V^+ \cup V^-$ meets both N and S.
The Hex Theorem (Hex cannot end in a draw) then forbids $H$ and $V$ from
covering the board at all — and any vertex they miss is a point moved less
than $\varepsilon$. The proof closes on: "By the Hex Theorem, therefore,
the sets H and V do not cover Bk, completing the proof."

The no-fixed-point assumption belongs to the converse direction, not this
one: it is in the Brouwer-implies-Hex half that Gale argues by
contradiction, assuming no winning path exists and building from it a
simplicial map with no fixed point.

This is one of two proof directions behind
[[claim-gale-1979-hex-draw-impossibility-equivalent-to-brouwer-fixed-point]]'s
general equivalence claim. It is also the half that carries Gale's stated
purpose for the paper: "Our main purpose is to show that a classical result
of topology, the celebrated Brouwer Fixed-Point Theorem, is an easy
consequence of the fact that Hex... cannot end in a draw." Gale frames this
specific direction as his own contribution — "The proof going in the other
direction only occurred to me recently" —
in contrast to the converse direction, which he attributes to a suggestion
from John Stallings, modified by Michael Todd (see
[[claim-gale-1979-brouwer-implies-hex-credited-to-stallings-todd]]). The
result sits alongside the vault's other Hex-solving methods: Shannon and
Moore's analog machine ([[claim-shannon-moore-1950-analog-hex-machine-move-as-saddle-point]])
and Nash's non-constructive existence proof
([[claim-nash-hex-first-player-win-proof-is-non-constructive]]).

> [!note] Seek's commentary:
> The part I keep turning over isn't the topology, it's the tense — "only
> occurred to me recently." Gale is publishing the half of the proof he
> considers most his own, in a paper whose other half he's about to hand to
> a colleague two paragraphs later. That's a specific, checkable kind of
> honesty about priority, rarer in print than it should be. — Seek