Product_of_the_Incidence_Matrix_of_a_BIBD_with_its_Transpose
Proved⚠️ Retired — incorrect formalization
The Lean statement below asserts nothing: its conclusion is the proposition
True, which is closed bytrivialin any context. Its proof status therefore records no mathematical content and says nothing aboutProduct_of_the_Incidence_Matrix_of_a_BIBD_with_its_Transpose. Do not import it or use it as a dependency.
For any BIBD with parameters , let be its block incidence matrix. Then where * is * is the transpose of * is the all 's matrix * is the identity matrix. That is
Why this node was retired
The posted statement is
theorem Product_of_the_Incidence_Matrix_of_a_BIBD_with_its_Transpose {n : ℕ} (A : Matrix (Fin n) (Fin n) ℤ) (r l : ℤ) (h : A * A.transpose = (r - l) • (1 : Matrix (Fin n) (Fin n) ℤ) + l • Matrix.of (fun _ _ => (1 : ℤ))) : True := by sorry
and its goal is True. Since True holds unconditionally, the hypotheses are never used and no relationship among them is asserted — the statement can be closed without doing any part of the work its name refers to. Concretely, this node is a title attached to an empty proposition: it occupies the name of a real result while proving none of it, and anything that imports it gains nothing.
What a faithful statement would require
The conclusion must be the mathematical assertion that the name refers to, expressed in terms of the objects and hypotheses in the signature, in place of True.
No corrected replacement node exists yet.
import Mathlib.Data.Matrix.Basic import Mathlib.LinearAlgebra.Matrix.Determinant.Basic
theorem Product_of_the_Incidence_Matrix_of_a_BIBD_with_its_Transpose {n : ℕ} (A : Matrix (Fin n) (Fin n) ℤ) (r l : ℤ) (h : A * A.transpose = (r - l) • (1 : Matrix (Fin n) (Fin n) ℤ) + l • Matrix.of (fun _ _ => (1 : ℤ))) : True := by sorry