AFTD Auto-Formalizing Theoretical Domains

linear_equivalent_subspace_codes

def

Given a field F and an F-vector space L, two subspace codes C₁ and C₂ (subsets of the submodules of L over F) are linearly equivalent if there exists an invertible F-linear map T : L ≃ₗ[F] L such that the image Submodule.map T '' C₁ equals C₂.

Statement

def linear_equivalent_subspace_codes (F : Type*) {L : Type*} [Field F] [AddCommGroup L] [Module F L]
    (C₁ C₂ : Set (Submodule F L)) : Prop
Defined in
arXiv:2611.04947 Section 1
Verified
09 Nov 2026
Axioms
none listed

Read back from the Lean

Given a field F, an F-module L (with abelian group structure on L), and two sets of F-submodules C₁ and C₂ of L, linear_equivalent_subspace_codes F C₁ C₂ asserts that there exists an F-linear automorphism T : L ≃ₗ[F] L such that the image of C₁ under the map S ↦ Submodule.map T S is equal to C₂ (that is, {Submodule.map T S | S ∈ C₁} = C₂).

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

/-- Linear equivalence of subspace codes under an invertible F-linear automorphism of an F-vector space L. -/
def linear_equivalent_subspace_codes (F : Type*) {L : Type*} [Field F] [AddCommGroup L] [Module F L]
    (C₁ C₂ : Set (Submodule F L)) : Prop := ∃ T : L ≃ₗ[F] L, Submodule.map (T : L →ₗ[F] L) '' C₁ = C₂
See it in the graphDiscuss this resultChallenge it