Graham–Rothschild theorem

Key takeaways

Graham–Rothschild theorem belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Graham–Rothschild theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Graham–Rothschild theorem from memory before moving on to harder problems.

Reference excerpt

In mathematics, the Graham–Rothschild theorem is a theorem that applies Ramsey theory to combinatorics on words and combinatorial cubes. It is named after Ronald Graham and Bruce Lee Rothschild, who published its proof in 1971. Through the work of Graham, Rothschild, and Klaus Leeb in 1972, it became part of the foundations of structural Ramsey theory. A special case of the Graham–Rothschild theorem motivates the definition of Graham's number, a number that was popularized by Martin Gardner in Scientific American and listed in the Guinness Book of World Records as the largest number ever appearing in a mathematical proof.

Background The theorem involves sets of strings, all having the same length n {\displaystyle n} , over a finite alphabet, together with a group acting on the alphabet. A combinatorial cube is a subset of strings determined by constraining some positions of the string to contain a fixed letter of the alphabet, and by constraining other pairs of positions to be equal to each other or to be related to each other by the group action. This determination can be specified more formally by means of a labeled parameter word, a string with wildcard characters in the positions that are not constrained to contain a fixed letter and with additional labels describing which wildcard characters must be equal or related by the group action. The dimension of the combinatorial cube is the number of free choices that can be made for these wildcard characters. A combinatorial cube of dimension one is called a combinatorial line. For instance, in the game of tic-tac-toe, the nine cells of a tic-tac-toe board can be specified by strings of length two over the three-symbol alphabet {1,2,3} (the Cartesian coordinates of the cells), and the winning lines of three cells form combinatorial lines. Horizontal lines are obtained by fixing the y {\displaystyle y} -coordinate (the second position of the length-two string) and letting the x {\displaystyle x} -coordinate be chosen freely, and vertical lines are obtained by fixing the x {\displaystyle x} -coordinate and letting the y {\displaystyle y} -coordinate be chosen freely. The two diagonal lines of the tic-tac-toe board can be specified by a parameter word with two wildcard characters that are either constrained to be equal (for the main diagonal) or constrained to be related by a group action that swaps the 1 and 3 characters (for the antidiagonal). The set of all combinatorial cubes of dimension d {\displaystyle d} , for strings of length n {\displaystyle n} over an alphabet A {\displaystyle A} with group action G {\displaystyle G} , is denoted [ A , G ] ( n d ) {\displaystyle [A,G]{\tbinom {n}{d}}} . A subcube of a combinatorial cube is another combinatorial cube of smaller dimension that forms a subset of the set of strings in the larger combinatorial cube. The subcubes of a combinatorial cube can also be described by a natural composition action on parameter words, obtained by substituting the symbols of one parameter word for the wildcards of another.

Statement With the notation above, the Graham–Rothschild theorem takes as parameters an alphabet A {\displaystyle A} , group action G {\displaystyle G} , finite number of colors r {\displaystyle r} , and two dimensions of combinatorial cubes m {\displaystyle m} and k {\displaystyle k} with m > k {\displaystyle m>k} . It states that, for every combination of A {\displaystyle A} , G {\displaystyle G} , r {\displaystyle r} , m {\displaystyle m} , and k {\displaystyle k} , there exists a string length n ≥ m {\displaystyle n\geq m} such that, if each combinatorial cube in [ A , G ] ( n k ) {\displaystyle [A,G]{\tbinom {n}{k}}} is assigned one of r {\displaystyle r} colors, then there exists a combinatorial cube in [ A , G ] ( n m ) {\displaystyle [A,G]{\tbinom {n}{m}}} all of whose k {\displaystyle k} -dimensional subcubes are assigned the same color. An infinitary version of the Graham–Rothschild theorem is also known.

Applications The special case of the Graham–Rothschild theorem with m = 1 {\displaystyle m=1} , k = 0 {\displaystyle k=0} , and the trivial group action is the Hales–Jewett theorem, stating that if all long-enough strings over a given alphabet are colored, then there exists a monochromatic combinatorial line.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Graham–Rothschild theorem

Start with the simplest possible case. Write down what Graham–Rothschild theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Graham–Rothschild theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Graham–Rothschild theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Graham–Rothschild theorem

In research: Graham–Rothschild theorem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Graham–Rothschild theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Graham–Rothschild theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Combinatorics on words, Ramsey theory, Theorems in combinatorics, so understanding it makes those chapters shorter.
In everyday life: Look for Graham–Rothschild theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Graham–Rothschild theorem in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Graham–Rothschild theorem means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Graham–Rothschild theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Graham–Rothschild theorem in simple terms?

In mathematics, the Graham–Rothschild theorem is a theorem that applies Ramsey theory to combinatorics on words and combinatorial cubes. It is named after Ronald Graham and Bruce Lee Rothschild, who published its proof in 1971.

Why does Graham–Rothschild theorem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Graham–Rothschild theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Graham–Rothschild theorem.