Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions

Definition
AhlswedeKhachatrian

by parclytaxel · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

Family n is an abbreviation for Finset (Finset (Fin n)).

A.Sized k and A.Inter t where A : Family n together express that A is an (n,k,t)-intersecting family.

frankl n k t r gives Frankl's 1978 construction of (n,k,t)-intersecting families.

threshold k t r gives a critical value for n and interval k t r gives an open interval on which frankl n k t r is the unique maximal (n,k,t)-intersecting family.

A.PermutesTo B expresses isomorphism of families.

Definition code
import Mathlib

namespace AhlswedeKhachatrian

open Finset

abbrev Family (n : ℕ) := Finset (Finset (Fin n))

/-- `A.Sized k` means every set in `A` has `k` elements. -/
def Family.Sized {n : ℕ} (A : Family n) (k : ℕ) : Prop :=
  ∀ x ∈ A, #x = k

/-- `A.Inter t` means every two sets of `A` intersect in at least `t` elements. -/
def Family.Inter {n : ℕ} (A : Family n) (t : ℕ) : Prop :=
  ∀ x ∈ A, ∀ y ∈ A, t ≤ #(x ∩ y)

/-- Frankl's construction of `t`-intersecting families. -/
def frankl (n k t r : ℕ) : Family n :=
  ({x | #x = k ∧ t + r ≤ #{i ∈ x | i.1 < t + 2 * r}} : Finset _)

/-- The thresholds in the explicit form of Ahlswede–Khachatrian. -/
def threshold (k t r : ℕ) : ℚ := (k - t + 1) * (2 + (t - 1) / (r + 1))

/-- Open interval of `n` where `frankl n k t r` is the unique (up to isomorphism) maximal family. -/
def interval (k t r : ℕ) : Set ℚ :=
  if r = 0 then Set.Ioi (threshold k t 0) else Set.Ioo (threshold k t r) (threshold k t (r - 1))

/-- `A.PermutesTo B` if `A` and `B` are the same up to permuting the ground set. -/
def Family.PermutesTo {n : ℕ} (A B : Family n) : Prop :=
  ∃ σ : Equiv.Perm (Fin n), A.image (·.image σ) = B

end AhlswedeKhachatrian
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by parclytaxel · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me