The exact sentence(s) in Gale (1979) stating the Hex/Brouwer fixed-point equivalence

hextopologybrouwer-fixed-point-theoremdavid-galetopological-combinatoricshistory-of-mathematicsquote-verification

This capture directly answers the open item in claim-gale-1979-hex-draw-impossibility-equivalent-to-brouwer-fixed-point and the linked 50-questions/question-verify-gale-1979-hex-brouwer-exact-quote.md: that note recorded only a paraphrase of Gale's equivalence claim, not the exact quoted sentence(s). The primary document was located and fetched directly with extract_pdf (not a search summary or a fetch-and-summarize tool), so the quotes below meet the vault's quote-provenance rule. tls on the fetch reported "verified" — no elevated-suspicion handling needed. Full extracted text: /Users/seek/seek/cache/sources/b62d8b535f0b29a66444d08e418c035f99fbfb713339b5ca96f729ec29e5b857.txt. The mirror hosting the PDF is a French Hex-community site (cijm.org, "by courtesy of Loïc Cellier") reproducing the original JSTOR-scanned journal pages; the original American Mathematical Monthly article itself (behind JSTOR's paywall) was not independently re-fetched, but the scan carries JSTOR's own header confirming volume/issue/page and the original 1979 publication.

Claim: Gale states the paper's explicit purpose is to prove the Hex Theorem and the Brouwer Fixed-Point Theorem equivalent, not merely analogous

Claim type: historical/definitional (what the paper's own stated thesis is) — Tier 3-4 floor would suffice, but this rests on a Tier 1 primary, exceeding the floor.

In the paper's introduction, Gale states the dual purpose of the work directly:

"This paper has therefore the dual purpose of, first, showing the equivalence of the Hex and Brouwer Theorems and, second, introducing the reader to the subject of fixed-point computations."

And earlier in the same paragraph, the specific direction motivating the whole 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, a game which is probably familiar to many mathematicians, cannot end in a draw."

Section 3 of the paper is titled "The Equivalence of the Hex and Brouwer Theorems," and states the goal of that section explicitly: "In this section we will show that it is equivalent to BROUWER FIXED-POINT THEOREM."

source_quote (primary, above three extracts); source_tier: 1

Claim: Gale proves the "Hex implies Brouwer" direction — the no-draw property of Hex implies the Brouwer fixed-point theorem

Claim type: technical-mechanism (a specific proof direction) — Tier 1-2 required; met.

Section 3 opens the constructive direction of the equivalence with:

"We first show, that 'Hex' implies 'Brouwer.' Let f : I2→I2 be given by f(x)=(f1(x)f2(x))."

The proof that follows constructs, for a hypothetical continuous map on the unit square without a fixed point, a labeling of an arbitrarily fine Hex board whose four "faces" would have to be covered without any connected winning path — contradicting the Hex Theorem — and concludes: "By the Hex Theorem, therefore, the sets H and V do not cover Bk, completing the proof."

source_quote (primary, above two extracts); source_tier: 1

Claim: Gale proves the converse direction — "Brouwer implies Hex" — crediting a construction from John Stallings, modified by Michael Todd

Claim type: technical-mechanism + historical/priority (who supplied which half of the proof) — Tier 1-2 required; met.

"The proof that 'Brouwer' implies 'Hex,' based on a suggestion of John Stallings modified by one of Michael Todd, makes use of the fact that the Hex board Bk gives a triangulation of the k × k square I2 in R2."

Gale's own account of the paper's originality, stated in the introduction, attributes the first (Hex-implies-Brouwer) direction to prior informal awareness and to a colleague, and claims only the second direction and the n-dimensional generalization as new:

"I should say that over the years I have heard it asserted in 'cocktail conversation' that the Hex and Brouwer Theorems were equivalent, and my colleague John Stallings has shown me an argument which derives the Hex Theorem from familiar topological facts which are equivalent to the Brouwer Theorem. The proof going in the other direction only occurred to me recently, but in view of its simplicity it may well be that others have been aware of it. The generalization to n dimensions may, however, be new."

This is the priority context the equivalence claim rests on: the Brouwer Fixed-Point Theorem itself is the older, foundational result (L.E.J. Brouwer, 1910s topology) that Gale's paper is proving combinatorially equivalent to a children's board game; Gale is explicit that even the "new" half of his own contribution was anticipated informally and that Stallings had already shown him one full direction of the argument before Gale wrote the paper.

source_quote (primary, above two extracts); source_tier: 1

Further leads

• The paper's bibliographic header (JSTOR scan) gives the full citation: The American Mathematical Monthly, Vol. 86, No. 10 (Dec. 1979), pp. 818-827, published by the Mathematical Association of America — useful for tightening the existing claim-note's source_venue field, which currently lacks volume/issue/page. [unverified-quant — needs primary] is not needed here since this is read directly off the Tier 1 scan itself.
• Section 4 generalizes the Hex Theorem (and its equivalence to Brouwer) to n dimensions and gives a fully constructive combinatorial proof and an explicit "fixed-point chasing" algorithm for finding approximate fixed points of continuous maps — not pursued as a separate claim here, but a natural follow-up capture on the algorithmic/computational side of the paper.
• Gale credits D. Lichtenstein with a separate, purely combinatorial proof that Hex cannot end in a draw and cannot be won by both players ("but not both"), by induction on board size — distinct from the equivalence argument and explicitly noted by Gale as proving a mathematically different result.
• Gale's author footnote states he received his Ph.D. from Princeton in 1949, taught at Brown 1950-1966, and was Professor of Mathematics, Economics, and Operations Research at Berkeley from 1966 — biographical detail, Tier 1 (autobiographical note printed with the article), not pursued as a claim here.
• The paper's introduction notes Hex was "invented by the Danish engineer and poet Piet Hein in 1942 and rediscovered at Princeton by John Nash in 1948" and "produced commercially by Parker Brothers in 1952" — overlaps with existing vault material on Nash and Hex (claim-nash-hex-first-player-win-proof-is-non-constructive); not re-verified as a separate claim here since it is a brief aside in Gale's paper rather than his own researched history (he directs readers to Martin Gardner's 1959 book for the full history).

Entity candidates

• L.E.J. Brouwer — person — the foundational figure whose Fixed-Point Theorem (early 20th-century topology) is the older, established result Gale's paper measures Hex against; the entire equivalence claim is stated relative to Brouwer's theorem, not the other way around.
• David Gale — person — author of the 1979 paper; already the subject of the existing claim-note claim-gale-1979-hex-draw-impossibility-equivalent-to-brouwer-fixed-point.
• John Stallings — person — Gale's Berkeley colleague, credited with first showing him the "Hex implies Brouwer" argument via topological facts equivalent to Brouwer's theorem, and with the original suggestion behind the "Brouwer implies Hex" proof.
• Michael J. Todd — person — modified Stallings' suggestion into the "Brouwer implies Hex" proof used in the paper; also author of the fixed-point-computation reference text Gale cites (The Computation of Fixed Points and Applications, Springer-Verlag, 1976).
• D. Lichtenstein — person — credited with a separate purely combinatorial induction proof that Hex cannot end in a draw and cannot be won by both players.
• Piet Hein — person — credited by Gale as the 1942 inventor of Hex.
• John Nash — person — credited by Gale as having rediscovered Hex at Princeton in 1948; already has vault coverage via claim-nash-hex-first-player-win-proof-is-non-constructive.
• Topological combinatorics — concept — the field this paper is treated (elsewhere in the vault) as a founding text of; worth its own note eventually.