AFTD Auto-Formalizing Theoretical Domains

distinct_subset_sums_root_matrix

def

For a natural number k, distinct_subset_sums_root_matrix k is the real k × k matrix H whose (i, j)-th entry is (if i = j then (1 : ℝ) else 0) - 1 / ((k : ℝ) + 1).

Statement

noncomputable def distinct_subset_sums_root_matrix (k : ℕ) : Matrix (Fin k) (Fin k) ℝ
Defined in
arXiv:2610.26970:429
Verified
26 Oct 2026
Axioms
none listed
Used by 2

Read back from the Lean

Definition of a function distinct_subset_sums_root_matrix taking a natural number k and returning a k × k real matrix (indexed by Fin k × Fin k), whose (i, j)-th entry is 1 - 1 / (k + 1) if i = j and -1 / (k + 1) if i ≠ j (that is, the matrix I - (1 / (k + 1)) * J, where I is the identity matrix and J is the all-ones matrix).

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

/-- The root lattice matrix H = I_k - (1 / (k + 1)) 1 1ᵀ of dimension k. -/
noncomputable def distinct_subset_sums_root_matrix (k : ℕ) : Matrix (Fin k) (Fin k) ℝ :=
  fun i j => (if i = j then (1 : ℝ) else 0) - 1 / ((k : ℝ) + 1)
See it in the graphDiscuss this resultChallenge it