How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
An -intersecting family on with has at most members
Statement
Let be an -intersecting family on , where is finite with . Then
Facts & Assumptions
Given: an -intersecting family on , ordered so that , with .
The multilinear monomials of total degree at most span a space of dimension on the cube (The functions obtained from with are linearly independent, so they span a space of dimension ).
Over , incidence vectors satisfy ( is the image of in ; over it is or according to the parity of ).
The power set of has elements, and when ( for finite , The set of -element subsets and the binomial coefficient ).
Proof
If , then [F1] makes the claimed right-hand side , so the bound follows from . Hence suppose . Work over , and for each define This is a polynomial of total degree at most .
Evaluating at , [L2] gives , so every factor in is a positive integer and therefore .
If , then and also . Equality with would force and then , impossible. So is an element of strictly below , and [L2] makes the corresponding factor of equal to .
Let be the multilinear reduction of . By the cube-agreement lemma, and for . If and is the least index with , evaluation at kills the terms with index larger than by the vanishing just proved and kills the earlier ones by minimality, leaving , a contradiction. Thus the functions are linearly independent.
Each is multilinear of total degree at most , so [L1] places all of them in a vector space of dimension . Since they are independent, there can be at most that many of them. Hence .
Remarks
- The ordering by size is the one-sided feature that removes the need for a uniformity hypothesis.
Depends on
- $L$-intersecting families
- $\widetilde f$ is multilinear, agrees with $f$ at every point of $\{0,1\}^{n}$, is degree-nonincreasing when nonzero, and is the unique multilinear polynomial with that agreement
- The functions $\{0,1\}^{n}\to F$ obtained from $x_T$ with $\lvert T\rvert\le s$ are linearly independent, so they span a space of dimension $\sum_{i=0}^{s}\binom{n}{i}$
- The incidence vector $v_A\in F^{n}$ of a subset $A\subseteq[n]$ over a stated field
- $\langle v_A,v_B\rangle$ is the image of $\lvert A\cap B\rvert$ in $F$; over $\mathbb{F}_2$ it is $0$ or $1$ according to the parity of $\lvert A\cap B\rvert$
- Monomials, coefficients, degree in each variable and total degree in $F[x_1,\dots,x_n]$
- The set $[A]^{k}$ of $k$-element subsets and the binomial coefficient $\binom{n}{k} := \lvert [n]^{k}\rvert$
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
Used by
Dependency tree · two levels
47 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, §4.3 (standard reference, not scraped)
- J. Matousek, Thirty-three Miniatures, Miniature 17 (standard reference, not scraped)