BIBD
A structure BIBD parameterized by types X and B and natural numbers v, b, r, k, lam, with fields: card_points asserting Nat.card X = v; card_blocks asserting Nat.card B = b; incomplete asserting k < v; block_pts assigning to each block b_idx : B an indexed map Fin k → X; block_inj asserting that block_pts b_idx is injective for each b_idx : B; replication asserting that for every point x : X, the Nat.card of the subtype of blocks b_idx : B containing x (satisfying ∃ j : Fin k, block_pts b_idx j = x) equals r; and balance asserting that for every pair of distinct points x, y : X, the Nat.card of the subtype of blocks b_idx : B containing both x and y equals lam.
Statement
structure BIBD (X B : Type*) (v b r k lam : ℕ)
- Defined in
- arXiv:2611.05762 Def 6.2.1
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Used by 4
- bibd_isomorphic_of_block_clique_graph_isoOP-1148: if two BIBDs D₁, D₂ with the same parameters (v, b, r, k, λ) on finite block sets have isomorphic modified block-clique graphs…
- bibd_block_clique_graphThe modified block-clique graph K_v^*(D) of a balanced incomplete block design D with parameters (v, b, r, k, λ) is the simple graph on…
- bibd_isomorphicTwo balanced incomplete block designs D₁ and D₂ with parameters (v, b, r, k, λ) are isomorphic if there exist a bijection f between their…
- bibd_isomorphic_of_block_clique_graph_iso_of_three_leRecoverability of a BIBD from its modified block-clique graph when the block size k is at least 3: if two BIBDs D₁, D₂ with the same…
Read back from the Lean
A structure BIBD parameterized by types X (points) and B (blocks) and natural numbers v, b, r, k, and lam. An instance consists of:
1. card_points: the cardinality of X (via Nat.card) is v.
2. card_blocks: the cardinality of B (via Nat.card) is b.
3. incomplete: the block size is strictly less than the number of points (k < v).
4. block_pts: a function assigning to each block b_idx : B a map from Fin k to X.
5. block_inj: for every block b_idx : B, the map block_pts b_idx is injective (so each block contains k distinct points).
6. replication: for every point x : X, the number of blocks b_idx : B containing x (i.e. for which there exists j : Fin k with block_pts b_idx j = x) is r.
7. balance: for all pairs of distinct points x, y : X (with x ≠ y), the number of blocks b_idx : B containing both x and y (i.e. there exist j, j' : Fin k such that block_pts b_idx j = x and block_pts b_idx j' = y) is lam.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A balanced incomplete block design (BIBD) with parameters (v, b, r, k, λ). -/ structure BIBD (X B : Type*) (v b r k lam : ℕ) where card_points : Nat.card X = v card_blocks : Nat.card B = b incomplete : k < v block_pts : B → Fin k → X block_inj : ∀ b_idx : B, Function.Injective (block_pts b_idx) replication : ∀ x : X, Nat.card {b_idx : B // ∃ j : Fin k, block_pts b_idx j = x} = r balance : ∀ ⦃x y : X⦄, x ≠ y → Nat.card {b_idx : B // (∃ j : Fin k, block_pts b_idx j = x) ∧ (∃ j' : Fin k, block_pts b_idx j' = y)} = lam