1020.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 10 curated AI-written annotations and 7190 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 71 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. The bulk source-derived expansion was generated mechanically from pinned source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the quoted source prose. On 2026-10-17 the mechanically generated source-comment annotations of the Formal Conjectures, Carleson, FLT, PFR, CompFiles, Mathematics in Lean and Theorem Proving in Lean overlays were regenerated by the same generator after three corrections made in a Claude Sonnet 5.5 session: titles no longer cut a sentence inside mathematics or end on a dangling word, workflow markers are removed from the quoted prose, and declaration names follow the scanner's namespace resolution. The boilerplate step line was dropped, and comments that were only a row of dashes no longer yield annotations. No new prose was written and no human review is claimed.

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Formal Conjectures paper, arXiv v1

2 declarations, 1 contain sorry, 0 declared as axioms

Erdős Problem 1020

References:

erdosproblems.com/1020
[BDE76] Bollobás, B. and Daykin, D. E. and Erdős, P., Sets of independent edges of a hypergraph. Quart. J. Math. Oxford Ser. (2) (1976), 25--32.
[Er65d] Erdős, P., A problem on independent {$r$}-tuples. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. (1965), 93--95.
[ErGa59] Erdős, P. and Gallai, T., On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. (1959), 337-356 (unbound insert).
[FLM12] Frankl, Peter and Łuczak, Tomasz and Mieczkowska, Katarzyna, On matchings in hypergraphs. Electron. J. Combin. (2012), Paper 42, 5.
[FRR12] Frankl, Peter and Rödl, Vojtech and Ruciński, Andrzej, On the maximum number of edges in a triple system not containing a disjoint family of a given size. Combin. Probab. Comput. (2012), 141--148.
[Fr17] Frankl, Peter, Proof of the {E}rdős matching conjecture in a new range. Israel J. Math. (2017), 421--430.
[Fr87] Frankl, Peter, The shifting technique in extremal set theory. (1987), 81--110.
[HLS12] Huang, Hao and Loh, Po-Shen and Sudakov, Benny, The size of a hypergraph and its matching number. Combin. Probab. Comput. (2012), 442--450.
[Kl68] Kleitman, Daniel J., Maximal number of subsets of a finite set no {$k$} of which are pairwise disjoint. J. Combinatorial Theory (1968), 157--163.
[KoKu23] Kolupaev, Dmitriy and Kupavskii, Andrey, Erdős matching conjecture for almost perfect matchings. Discrete Math. (2023), Paper No. 113304, 9.
[LuMi14] Łuczak, Tomasz and Mieczkowska, Katarzyna, On {E}rdős' extremal problem on matchings in hypergraphs. J. Combin. Theory Ser. A (2014), 178--194.

Imports (1)

FormalConjecturesUtil

def Erdos1020.f The maximum number of edges in an r-uniform hypergraph on n vertices containing no matching of size k (i.e. no k pairwise vertex-disjoint edges) line 55 source
Source documentation
The maximum number of edges in an r-uniform hypergraph on n vertices containing no matching of size k (i.e. no k pairwise vertex-disjoint edges).

standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Nat
Proof uses: Hypergraph.extremalNumber, Finset, Fin, Not, Finset.HasHypergraphMatching
```
noncomputable def f (n r k : ℕ) : ℕ :=
…
```
theorem Erdos1020.erdos_1020 Let $f(n;r,k)$ be the maximal number of edges in an $r$-uniform hypergraph which contains no set of $k$ many independent edges sorry line 73 source
Source documentation
Let $f(n;r,k)$ be the maximal number of edges in an $r$-uniform hypergraph which contains no set of $k$ many independent edges.
For all $r\geq 3$, $$f(n;r,k)=\max\left(\binom{rk-1}{r}, \binom{n}{r}-\binom{n-k+1}{r}\right).$$
Note: the source states the formula with no range on n or k, but some restriction is needed: e.g. for r = 3, k = 2, n = 4 no two disjoint triples fit in 4 vertices, so the left-hand side is 4.choose 3 = 4 while the right-hand side is 5.choose 3 = 10. We require k ≥ 1 and n ≥ r*k - 1: this is the smallest n accommodating the construction counted by the first term (all r-subsets of a fixed (r*k - 1)-set), and at n = r*k - 1 the equality holds trivially, since the complete r-uniform hypergraph has no k-matching. The source's commentary likewise calls the case n < k*r trivial.

depends on sorry what this means
Statement uses: Nat, LE.le, OfNat.ofNat, LT.lt, HSub.hSub, HMul.hMul, Eq, Erdos1020.f, Max.max, Nat.choose, HAdd.hAdd
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
20 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem erdos_1020 (r : ℕ) (hr : 3 ≤ r) (n k : ℕ) (hk : 0 < k)
    (hrk : r * k - 1 ≤ n) :
    f n r k = max ((r * k - 1).choose r)
      (n.choose r - (n - k + 1).choose r) := by
…
```
Mentions: Erdos1020.f