# Correlation with a 1-set implies correlation with a subspace

## Introduction

The aim of this article is to present a proof of a result that forms part of an attempt to model a proof of DHJ(3) on the proof by Ajtai and Szemerédi of the corners theorem. If $\mathcal{B}$ is a subset of $[3]^n$ then let us call it a 1-set if there exists a collection $\mathcal{U}$ of subsets of $[n]$ such that $\mathcal{B}=\{(U,V,W):U\in\mathcal{U}\}.$ Note that we have also used the phrase 1-set in a different sense: if $x\in[3]^n$ then the 1-set of x is the set of all i such that $x_i=1.$ Thus, a 1-set is a collection $\mathcal{B}$ of sequences such that whether or not x belongs to $\mathcal{B}$ depends only on the 1-set of x. If you understood that last sentence, then you should have no difficulty coping with the fact that the phrase "1-set" has two meanings, one a function applied to sequences and the other a property of sets of sequences.

The result to be proved here is that if $\mathcal{A}$ is a subset of $[3]^n$ of density $\delta$ and $\mathcal{B}$ is a 1-set of density $\beta\gt0$ such that $|\mathcal{A}\cap\mathcal{B}|\geq(\delta+\eta)|\mathcal{B}|,$ then there is an m-dimensional combinatorial subspace S of $[3]^n$ such that $|\mathcal{A}\cap S|\geq(\delta+\eta/2)|S|.$ In loose terms, correlation with a 1-set implies correlation with a subspace. Of course, there is some dependence of m on $\delta,\eta,\beta$ and n: ultimately what we care about is that for fixed $\delta,\eta$ and $\beta$ m should tend to infinity with n.

## Motivation

The reason for being interested in this problem is that it is the natural analogue of the first step of Ajtai and Szemerédi in their proof of the corners theorem. See the article about their proof, and in particular the section entitled "Where next?" for more details about why this is.

## The proof

Since this article was started, the intended proof has changed somewhat. It can now be found as (an easy consequence of) Step 2 on this page.