AFTD Auto-Formalizing Theoretical Domains

lower_ones_matrix_apply_self

theoremverified

The diagonal entries of L are 1.

Statement

theorem lower_ones_matrix_apply_self (n : ℕ) (i : Fin n) : lower_ones_matrix n i i = 1
Source
Sanity lemma for lower_ones_matrix (arXiv:2610.13798).
Verified
13 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • lower_ones_matrixThe n × n lower triangular matrix L over F₂ with all entries on and below the diagonal equal to 1: L_ij = 1 iff j ≤ i.
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…

The proof, explained

The proof unfolds the definition of `lower_ones_matrix` at the diagonal entry (i, i). Because i ≤ i holds reflexively for any index i, the conditional expression if i ≤ i then 1 else 0 simplifies directly to 1.

  1. lower_ones_matrix n i i = 1

    The simplifier unfolds the definition of `lower_ones_matrix`, which evaluates the entry at (i, i) to `if i ≤ i then 1 else 0`. Since the inequality i ≤ i holds by reflexivity, the `if` condition is true, simplifying the expression to 1.

    line 2

      simp [lower_ones_matrix]

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem lower_ones_matrix_apply_self (n : ℕ) (i : Fin n) : lower_ones_matrix n i i = 1 := by  simp [lower_ones_matrix]
See it in the graphDiscuss this resultChallenge it