complete_uniform_hypergraph_schmidt_rank_one_one_two
The rank over the rationals of the 2 by 2 matrix with entries (-1)^(Nat.choose (i + j) 2) for i, j ∈ {0, 1} is equal to 2.
Statement
theorem complete_uniform_hypergraph_schmidt_rank_one_one_two : Matrix.rank (fun (i : Fin 2) (j : Fin 2) => (-1 : ℚ) ^ (Nat.choose (i.val + j.val) 2)) = 2
- Formalizes
- OP-1672
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- complete_uniform_hypergraph_schmidt_rank_k_twoFor any positive integers a and b, the rank over the rationals of the (a + 1) by (b + 1) matrix with entries (-1)^(Nat.choose (i + j) 2)…
Read back from the Lean
The rank over the rational numbers $\mathbb{Q}$ of the $2 \times 2$ matrix (indexed by $\mathrm{Fin}(2) \times \mathrm{Fin}(2)$) whose $(i, j)$-th entry is $(-1)^{\binom{i + j}{2}}$ is equal to $2$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem specializes a general formula for the rational rank of hypergraph intersection matrices when the parameter k equals 2. Setting the dimension parameters to a = 1 and b = 1 in complete_uniform_hypergraph_schmidt_rank_k_two immediately gives that the 2 × 2 matrix has rank 2, with the required bounds 1 ≤ 1 discharged by reflexivity.
The rational rank of the 2 × 2 matrix with entries (-1)^((i + j) choose 2) for i, j ∈ {0, 1} is 2.
This is an immediate specialization of the general result complete_uniform_hypergraph_schmidt_rank_k_two with parameters a = 1 and b = 1. The side conditions 1 ≤ a and 1 ≤ b both reduce to 1 ≤ 1, which hold by reflexivity of ≤ (le_rfl). Since a + 1 = 2 and b + 1 = 2, the matrix is indexed by Fin 2 × Fin 2, matching the goal.
uses
complete_uniform_hypergraph_schmidt_rank_k_two,le_rflMatrix.rank (fun (i : Fin 2) (j : Fin 2) => (-1 : ℚ) ^ (Nat.choose (i.val + j.val) 2)) = 2 := complete_uniform_hypergraph_schmidt_rank_k_two 1 1 le_rfl le_rfl
complete_uniform_hypergraph_schmidt_rank_k_two- For integers a, b ≥ 1, the (a + 1) × (b + 1) matrix with entries (-1)^((i + j) choose 2) has rank 2 over the rationals.
le_rfl- The inequality relation ≤ is reflexive: a ≤ a for every element a in a preorder.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- For a = 1, b = 1, and k = 2, the 2 x 2 matrix has rational rank 2. -/theorem complete_uniform_hypergraph_schmidt_rank_one_one_two : Matrix.rank (fun (i : Fin 2) (j : Fin 2) => (-1 : ℚ) ^ (Nat.choose (i.val + j.val) 2)) = 2 := complete_uniform_hypergraph_schmidt_rank_k_two 1 1 le_rfl le_rfl