bibd_isomorphic
Two balanced incomplete block designs D₁ and D₂ with parameters (v, b, r, k, λ) are isomorphic if there exist a bijection f between their point sets and a bijection g between their block sets such that for every block b₁ and point x, x is in block b₁ in D₁ if and only if f(x) is in block g(b₁) in D₂.
Statement
def bibd_isomorphic {X₁ B₁ X₂ B₂ : Type*} {v b r k lam : ℕ} (D₁ : BIBD X₁ B₁ v b r k lam) (D₂ : BIBD X₂ B₂ v b r k lam) : Prop
- Defined in
- arXiv:2611.05762 Sec. 6.30
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Built on 1
- BIBDA 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;…
- Used by 2
- 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_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
Given two balanced incomplete block designs D₁ (on point type X₁ and block type B₁) and D₂ (on point type X₂ and block type B₂) with the same parameters (v, b, r, k, lam : ℕ), bibd_isomorphic D₁ D₂ is defined as the proposition that there exist bijections f : X₁ ≃ X₂ and g : B₁ ≃ B₂ such that for every block b₁ : B₁ and every point x : X₁, x lies in block b₁ (that is, ∃ j : Fin k, D₁.block_pts b₁ j = x) if and only if f(x) lies in block g(b₁) (that is, ∃ j' : Fin k, D₂.block_pts (g b₁) j' = f x).
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
/-- Isomorphism between two balanced incomplete block designs with parameters (v, b, r, k, λ). -/ def bibd_isomorphic {X₁ B₁ X₂ B₂ : Type*} {v b r k lam : ℕ} (D₁ : BIBD X₁ B₁ v b r k lam) (D₂ : BIBD X₂ B₂ v b r k lam) : Prop := ∃ (f : X₁ ≃ X₂) (g : B₁ ≃ B₂), ∀ (b₁ : B₁) (x : X₁), (∃ j : Fin k, D₁.block_pts b₁ j = x) ↔ (∃ j' : Fin k, D₂.block_pts (g b₁) j' = f x)