AFTD Auto-Formalizing Theoretical Domains

is_local_unitary

def

For a finite set of parties each with a finite dimension type d p, a unitary matrix U on the product index type (p : Parties) → d p over ℂ is a local unitary if there exists a family of unitary matrices u p in Matrix.unitaryGroup (d p) ℂ such that the matrix entry U x y equals the product over all p of (u p) (x p) (y p).

Statement

def is_local_unitary {Parties : Type*} [Fintype Parties] [DecidableEq Parties] {d : Parties → Type*} [∀ p, Fintype (d p)] [∀ p, DecidableEq (d p)] (U : Matrix.unitaryGroup ((p : Parties) → d p) ℂ) : Prop
Defined in
arXiv:2611.16921 Sec II.1
Verified
13 Nov 2026
Axioms
none listed

Read back from the Lean

Let Parties be a finite type with decidable equality, and let d : Parties → Type* assign to each party a finite type with decidable equality. For a unitary matrix U with rows and columns indexed by (p : Parties) → d p over the complex numbers ℂ, is_local_unitary U asserts that there exists a family of unitary matrices u assigning to each p : Parties a unitary matrix u p (indexed by d p with entries in ℂ) such that the matrix U is the tensor product of the u p; that is, for all rows x and columns y in (p : Parties) → d p, the (x, y) entry of U equals the product over all p : Parties of the (x p, y p) entry of u p.

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

/-- A unitary matrix on the product basis of a multipartite system is local if it is the Kronecker/tensor product of unitary matrices on the subsystems. -/
def is_local_unitary {Parties : Type*} [Fintype Parties] [DecidableEq Parties] {d : Parties → Type*} [∀ p, Fintype (d p)] [∀ p, DecidableEq (d p)] (U : Matrix.unitaryGroup ((p : Parties) → d p) ℂ) : Prop := ∃ u : ∀ p, Matrix.unitaryGroup (d p) ℂ, U.1 = fun x y => ∏ p, (u p).1 (x p) (y p)
See it in the graphDiscuss this resultChallenge it