AFTD Auto-Formalizing Theoretical Domains

AffineForm

structure

An affine linear form parameterized by a type F and an arity m : ℕ consists of a constant term c0 : F and a tuple of linear coefficients c : Fin m → F.

Statement

structure AffineForm (F : Type*) (m : ℕ)
Defined in
arXiv:2610.37677, Section 1.1
Verified
30 Oct 2026
Axioms
none listed
Used by 6
  • ncabp_eval_poly_zero_directionGiven a field F, natural numbers m, S, R, a matrix tuple T : Fin m → Matrix (Fin R) (Fin R) F, and an ncABP A : NcABP F m S such that…
  • ncabp_eval_polyGiven a commutative semiring F, parameters m, S : ℕ, and an ncABP A : NcABP F m S, ncabp_eval_poly A is the polynomial in FreeAlgebra F…
  • is_ncabp_hitting_tupleGiven a field F and natural numbers m, S, R, a tuple of matrices T : Fin m → Matrix (Fin R) (Fin R) F is an ncABP hitting tuple if for…
  • affine_form_to_free_algebraGiven a commutative semiring F, a natural number m, and an affine form a : AffineForm F m, affine_form_to_free_algebra a is the element of…
  • ncabp_matrixGiven a commutative semiring F, parameters m, S : ℕ, and an ncABP A : NcABP F m S, ncabp_matrix A is the transition matrix in Matrix (Fin…
  • NcABPAn affine noncommutative algebraic branching program (ncABP) parameterized by a type F with zero and parameters m, S : ℕ consists of a…

Read back from the Lean

AffineForm F m is a structure parameterized by a type F and a natural number m. It consists of: 1. c0 : F, a scalar/constant term in F. 2. c : Fin m → F, a tuple (function from Fin m to F) of $m$ coefficients in F.

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

/-- An affine linear form parameterized by type F and arity m. -/
structure AffineForm (F : Type*) (m : ℕ) where
  c0 : F
  c : Fin m → F
See it in the graphDiscuss this resultChallenge it