AFTD Auto-Formalizing Theoretical Domains

comparison_eval_matrix

def

The real evaluation matrix of F_2 on strict orders, with rows indexed by the permutations x of Fin n (strict orders given by ranks) and columns by comparison_feature2 n: its entry at (x, i) is phi_2(x) i. Its kernel is the evaluation kernel of F_2 (coefficient vectors c with <phi_2(x), c> = 0 for every strict order x).

Statement

def comparison_eval_matrix (n : ℕ) : Matrix (Equiv.Perm (Fin n)) (comparison_feature2 n) ℝ
Defined in
arXiv:2610.34762 (Quantum ordinal selection with two comparisons), Section 3.1, the notation before Lemma 1
Verified
08 Nov 2026
Axioms
none listed
Built on 2
  • comparison_phi2The real quadratic evaluation vector phi_2(x) : comparison_feature2 n → ℝ of a strict order x (a permutation of Fin n giving the ranks):…
  • comparison_feature2The type indexing the orthonormal coordinate basis of the formal quadratic feature space F_2 = span{1, d_e, d_e d_f}: the sum type of…
Used by 4

Read back from the Lean

For a natural number n, comparison_eval_matrix n is defined as the matrix with real entries whose rows are indexed by permutations x : Equiv.Perm (Fin n) and whose columns are indexed by comparison_feature2 n, where the entry at row x and column i is comparison_phi2 x i.

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 real evaluation matrix of F_2 on strict orders, with rows indexed by the permutations x of Fin n (strict orders given by ranks) and columns by comparison_feature2 n: its entry at (x, i) is phi_2(x) i. Its kernel is the evaluation kernel of F_2 (coefficient vectors c with <phi_2(x), c> = 0 for every strict order x). -/
def comparison_eval_matrix (n : ℕ) : Matrix (Equiv.Perm (Fin n)) (comparison_feature2 n) ℝ :=
  Matrix.of fun x i => comparison_phi2 x i
See it in the graphDiscuss this resultChallenge it