# Difference between revisions of "DHJ(3)"

(Added definition of DHJ(j,k)) |
m (→DHJ(j,k)) |
||

Line 39: | Line 39: | ||

There is also a k-partite version of this definition. If the k vertex sets are all copies of <math>[n]</math>, then we say that K has complexity j if for every <math>E\subset\{1,2,\dots,k\}</math> there is a j-uniform hypergraph <math>J_E</math> such that <math>K</math> consists of all k-tuples <math>(i_1,\dots,i_k)</math> such that for every <math>E\subset\{1,2,\dots,k\}</math> of size j the j-tuple <math>(i_s:s\in E)</math> belongs to <math>J_E.</math> | There is also a k-partite version of this definition. If the k vertex sets are all copies of <math>[n]</math>, then we say that K has complexity j if for every <math>E\subset\{1,2,\dots,k\}</math> there is a j-uniform hypergraph <math>J_E</math> such that <math>K</math> consists of all k-tuples <math>(i_1,\dots,i_k)</math> such that for every <math>E\subset\{1,2,\dots,k\}</math> of size j the j-tuple <math>(i_s:s\in E)</math> belongs to <math>J_E.</math> | ||

− | We can make a similar definition for sequences in <math>[k]^n</math>, or equivalently ordered partitions <math>(U_1,\dots,U_k)</math> of <math>[n]. This time we say that <math>\mathcal{A}</math> has complexity j if there are collections of sets <math>\mathcal{U}_E</math> such that <math>\mathcal{A}</math> consists of all ordered partitions <math>(U_1,\dots,U_k)</math> such that for every <math>E\subset\{1,2,\dots,k\}</math> of size j the ordered sequence of disjoint sets <math>(U_s:s\in E)</math> belongs to <math>\mathcal{U}_E.</math> DHJ(j,k) is the assertion that a subset of <math>[k]^n</math> of complexity j contains a combinatorial line. It is not hard to check that DHJ(k-1,k) is the same as DHJ(j,k). In other words, every subset of <math>[k]^n</math> has complexity at most k-1. | + | We can make a similar definition for sequences in <math>[k]^n</math>, or equivalently ordered partitions <math>(U_1,\dots,U_k)</math> of <math>[n].</math> This time we say that <math>\mathcal{A}</math> has complexity j if there are collections of sets <math>\mathcal{U}_E</math> such that <math>\mathcal{A}</math> consists of all ordered partitions <math>(U_1,\dots,U_k)</math> such that for every <math>E\subset\{1,2,\dots,k\}</math> of size j the ordered sequence of disjoint sets <math>(U_s:s\in E)</math> belongs to <math>\mathcal{U}_E.</math> DHJ(j,k) is the assertion that a subset of <math>[k]^n</math> of complexity j contains a combinatorial line. It is not hard to check that DHJ(k-1,k) is the same as DHJ(j,k). In other words, every subset of <math>[k]^n</math> has complexity at most k-1. |

==== DHJ(2.5) ==== | ==== DHJ(2.5) ==== |

## Revision as of 23:26, 15 February 2009

The **k=3 Density Hales-Jewett theorem** (DHJ(3)) has many equivalent forms.

## Contents

## Versions of DHJ(3)

Let [math][3]^n[/math] be the set of all length [math]n[/math] strings over the alphabet [math]1, 2, 3[/math]. A subset of [math][3]^n[/math] is said to be *line-free* if it contains no combinatorial lines. Let [math]c_n[/math] be the size of the largest line-free subset of [math][3]^n[/math].

**DHJ(3), Version 1**. For every [math]\delta \gt 0[/math] there exists n such that every subset [math]A \subset [3]^n[/math] of density at least [math]\delta[/math] contains a combinatorial line.

**DHJ(3), Version 2**. [math]\lim_{n \rightarrow \infty} c_n/3^n = 0[/math].

(The equivalence of Version 1 and Version 2 is clear.)

**DHJ(3), Version 3**. For every [math]\delta \gt 0[/math] there exists n such that every subset [math]A \subset [3]^n[/math] of equal-slices density at least [math]\delta[/math] contains a combinatorial line.

(For the proof that Version 3 and Version 1 are equivalent, see this page.)

**DHJ(3), Version 4**. For every [math]\delta \gt 0[/math] there exists n such that every collection of pairs (U,V) of disjoint subsets of [n] of cardinality at least [math]\delta 3^n[/math] contains a "corner" [math](U,V), (U \cup D, V), (U, V \cup D)[/math], where U, V, D are disjoint subsets of [math][n][/math] (compare with the corners theorem).

(The equivalence of Version 1 and Version 2 follows by identifying a string [math]x \in [3]^n[/math] with the pair (U,V) consisting of the 1-set and 2-set of x.)

## Variants

One can of course define DHJ(k) for any positive integer k by a similar method. DHJ(1) is trivial, and DHJ(2) follows quickly from Sperner's theorem.

#### DHJ(1,3)

The following variant of DHJ(3) is motivated by the proof of Sperner's theorem. Let [math]\mathcal{U},\mathcal{V}[/math] and [math]\mathcal{W}[/math] be collections of subsets of [math][n].[/math] Define [math]\mathcal{A}(\mathcal{U},\mathcal{V},\mathcal{W})[/math] to be the set of all triples [math](U,V,W),[/math] where [math]U,V,W[/math] are disjoint, and [math]U\in\mathcal{U},V\in\mathcal{V},W\in\mathcal{W}.[/math] These triples are in an obvious one-to-one correspondence with elements of [math][3]^n.[/math]

Call [math]\mathcal{A}[/math] a *set of rank 1* if it is of the form [math]\mathcal{A}(\mathcal{U},\mathcal{V},\mathcal{W}).[/math] DHJ(1,3) is the assertion that every dense set of rank 1 contains a combinatorial line. Here is a proof of this assertion if we assume that [math]\mathcal{W}=[2]^n[/math] and we interpret "dense" to mean "dense in the equal-slices measure.

First, choose a random permutation [math]\pi[/math] of [math][n][/math]. Without loss of generality it is the identity. Then the expected number of disjoint quadruples [math](U,V,W)[/math] such that U is an initial segment, W is a final segment, and U, V and W are elements of [math]\mathcal{U},\mathcal{V}[/math] and [math]\mathcal{W}[/math] that partition [math][n][/math] is approximately [math]\delta n^2/2[/math], where [math]\delta[/math] is the equal-slices density of [math]\mathcal{A}[/math]. (The total number of such triples if U, V and W don't have to belong to [math]\mathcal{U},\mathcal{V}[/math] and [math]\mathcal{W}[/math] is roughly [math]n^2/2.)[/math] Therefore, there must exist some fixed set [math]W\in\mathcal{W}[/math] such that the number of such triples [math](U,V,W)[/math] is at least [math]\delta n/2.[/math] In particular, we can find two such triples [math](U_1,V_1,W)[/math] and [math](U_2,V_2,W).[/math] If [math]U_1\subset U_2,[/math] then this gives us the combinatorial line [math](U_1,V_1,W),(U_2,V_2,W),(U_1,V_2,W\cup(U_2\cap V_1)).[/math]

Quite possibly a proof of this kind can be devised that proves the full statement DHJ(1,3).

#### DHJ(j,k)

The statement DHJ(j,k) is motivated by concepts connected with hypergraphs. A k-uniform hypergraph [math]H[/math] could be said to have *complexity* j if there exists a j-uniform hypergraph [math]J[/math] such that [math]H[/math] consists of all sets A of size k with the property that every subset [math]B\subset A[/math] of size j belongs to [math]J.[/math]

There is also a k-partite version of this definition. If the k vertex sets are all copies of [math][n][/math], then we say that K has complexity j if for every [math]E\subset\{1,2,\dots,k\}[/math] there is a j-uniform hypergraph [math]J_E[/math] such that [math]K[/math] consists of all k-tuples [math](i_1,\dots,i_k)[/math] such that for every [math]E\subset\{1,2,\dots,k\}[/math] of size j the j-tuple [math](i_s:s\in E)[/math] belongs to [math]J_E.[/math]

We can make a similar definition for sequences in [math][k]^n[/math], or equivalently ordered partitions [math](U_1,\dots,U_k)[/math] of [math][n].[/math] This time we say that [math]\mathcal{A}[/math] has complexity j if there are collections of sets [math]\mathcal{U}_E[/math] such that [math]\mathcal{A}[/math] consists of all ordered partitions [math](U_1,\dots,U_k)[/math] such that for every [math]E\subset\{1,2,\dots,k\}[/math] of size j the ordered sequence of disjoint sets [math](U_s:s\in E)[/math] belongs to [math]\mathcal{U}_E.[/math] DHJ(j,k) is the assertion that a subset of [math][k]^n[/math] of complexity j contains a combinatorial line. It is not hard to check that DHJ(k-1,k) is the same as DHJ(j,k). In other words, every subset of [math][k]^n[/math] has complexity at most k-1.

#### DHJ(2.5)

DHJ(2.5) is the statement that if [math]A \subset [3]^n[/math] has density [math]\delta[/math], and n is sufficiently large depending on [math]\delta[/math], then there exists a combinatorial line [math]w^0, w^1, w^2[/math] whose first two elements lie in A. This is of course weaker than DHJ(3), which requires that all three elements of the combinatorial line lie in A.

DHJ(2.5) can be deduced from DHJ(2) by partitioning [math][3]^n[/math] into disjoint copies of [math][2]^m[/math] for various values of m; indeed, for each set [math]C \subset [n][/math] of cardinality n-m, we have a copy of [math][2]^m[/math] inside [math][3]^n[/math] formed by considering all the strings which equal 2 at C and equal 0 or 1 elsewhere. By Sperner's theorem or DHJ(2), any of the copies of [math][2]^m[/math] at which A has density at least [math]\delta/2[/math] (say) will contain the first two points of a combinatorial line, if m is sufficiently large depending on [math]\delta[/math]. The remaining values of m only fill up a negligible portion of the cube [math][3]^n[/math], and the claim follows.

#### DHJ(2.6)

DHJ(2.6) is the statement that if [math]A \subset [3]^n[/math] has density [math]\delta[/math], and n is sufficiently large depending on [math]\delta[/math], then there exists r such that for each ij=01,12,23, there exists a combinatorial line [math]w^0, w^1, w^2[/math] with r wildcards whose i and j elements in A. This is of course weaker than DHJ(3), but implies DHJ(2.5).

## Consequences

DHJ(3) implies the IP-Szemerédi theorem, which implies the corners theorem (in both [math]{\Bbb Z}/N{\Bbb Z}[/math] and [math][3]^n[/math]), which in turn implies Roth's theorem (in both [math]{\Bbb Z}/N{\Bbb Z}[/math] and [math][3]^n[/math]).

DHJ(3) also implies the k=3 version of the coloring Hales-Jewett theorem.