Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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 L-intersecting family on [n] with L=s has at most i=0s(ni) members

Statement

Let F={F1,,Fm} be an L-intersecting family on [n], where LN is finite with L=s. Then

mi=0s(ni).

Facts & Assumptions

Given: an L-intersecting family F={F1,,Fm} on [n], ordered so that F1Fm, with L=s.

[L1]

The multilinear monomials of total degree at most s span a space of dimension i=0s(ni) on the cube (The functions {0,1}nF obtained from xT with Ts are linearly independent, so they span a space of dimension i=0s(ni)).

[F1]

Proof

technique · direct
1.1

If s>n, then [F1] makes the claimed right-hand side 2n=P([n]), so the bound follows from FP([n]). Hence suppose sn. Work over R, and for each i define fi(x):=L, <Fi(x,vFi). This is a polynomial of total degree at most s.

givenF1
2.1

Evaluating at vFi, [L2] gives vFi,vFi=Fi, so every factor in fi(vFi) is a positive integer and therefore fi(vFi)0.

L2step 1.1
2.2

If j<i, then FiFjL and also FiFjFjFi. Equality with Fi would force FiFj and then Fi=Fj, impossible. So FiFj is an element of L strictly below Fi, and [L2] makes the corresponding factor of fi(vFj) equal to 0.

L2step 1.1
3.1

Let f~i be the multilinear reduction of fi. By the cube-agreement lemma, f~i(vFi)0 and f~i(vFj)=0 for j<i. If icif~i=0 and j is the least index with cj0, evaluation at vFj kills the terms with index larger than j by the vanishing just proved and kills the earlier ones by minimality, leaving cjf~j(vFj)=0, a contradiction. Thus the functions are linearly independent.

step 2.1step 2.2algebra
4.1

Each f~i is multilinear of total degree at most s, so [L1] places all of them in a vector space of dimension i=0s(ni). Since they are independent, there can be at most that many of them. Hence mi=0s(ni).

L1step 3.1

Remarks

  • The ordering by size is the one-sided feature that removes the need for a uniformity hypothesis.

Depends on

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