Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Use the notation and sunflower convention in the statement of L268. Distinct words give distinct transversal sets. Their sets form a sunflower exactly when every coordinate's symbols are either all equal or all distinct: if a symbol appears in two words, the corresponding point must belong to the common core and hence appear in all the words.
Linear independent representatives
Lemma. Let be subspaces of a finite-dimensional vector space . There are linearly independent vectors , one for each , if and only if
Proof. Necessity follows by counting the selected independent vectors in each sum. For sufficiency, induct on . The cases are immediate. If a nonempty proper set attains equality in (1), apply induction to its subspaces. Their selected vectors form a basis of . In , any collection indexed by spans dimension at least
Induction in the quotient, followed by lifting the selected vectors, completes the choice.
Otherwise every nonempty proper has sum dimension at least . Choose a nonzero , and quotient by its span. For the first subspaces, each nonempty sum loses at most one dimension and still satisfies (1). Select their representatives by induction in the quotient and lift them; together with they are independent.
By repeating each exactly times, the lemma also gives independent representatives from each , all jointly independent, whenever every collection of the original subspaces spans dimension at least times its cardinality. Indeed a collection of repeated indices has at most entries when its distinct indices are .
Contracting an obstructing collection of coordinates
Write and . Let be its coordinate maps, and let
Their sum is : a vector annihilated by every has every coordinate zero and is therefore zero. For , put
Choose maximizing , and among maximizers choose one with least cardinality. Since and , this is a proper subset of . This includes the equality case : if the maximum is zero, the empty set is the chosen maximizer; if it is positive, the full set is not a maximizer.
For every , maximality gives
Apply the lemma in to the images of the for . Choose vectors in those images that are all linearly independent. Define a linear map
by sending to the th standard basis vector, for every , and extend it from these independent vectors to a basis of the quotient. This assignment is consistent even though different selected vectors have the same image. Since is nonempty, is onto.
Compose with the quotient map to obtain . Its dual embeds as an -dimensional subspace of . If then , so . If then , so the dual of is onto and is injective.
For any distinct words in , a zero coordinate map gives one common symbol and an injective coordinate map gives distinct symbols. Thus all transversal sets from form a sunflower, including the case of an empty core. This proves the subspace assertion.
The exponential bound
Let and suppose the affine word family has no -sunflower. With , a dimension at least would supply a -sunflower by the subspace assertion. Any of its members would be a -sunflower, because . Consequently
If and , choose a nonzero . The affine line is a -sunflower: in coordinate it is constant when , and its symbols are distinct when . This is a contradiction, so in this case and .
If , the definition of gives . Equation (3) therefore implies in this case as well. The estimates do not depend on the dimensions of the coordinate spaces.