math / data /lean /OAI /Computability /PerfectCompleteness /Algebra /EvaluationMatrix.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.44 kB
import Mathlib.LinearAlgebra.Pi
import OAI.Computability.PerfectCompleteness.Foundations.FiniteRangeInverse
namespace OAI
section
namespace PerfectCompleteness.EvaluationMatrix
noncomputable section
variable {π•œ Ξ© K : Type*} [Field π•œ] [AddCommGroup K] [Module π•œ K]
def evaluation (H : Submodule π•œ (Ξ© β†’ π•œ)) (x : Ξ©) : Module.Dual π•œ H where
toFun h := h.val x
map_add' _ _ := rfl
map_smul' _ _ := rfl
@[simp] theorem evaluation_apply (H : Submodule π•œ (Ξ© β†’ π•œ)) (x : Ξ©) (h : H) :
evaluation H x h = h.val x := rfl
def evaluate (H : Submodule π•œ (Ξ© β†’ π•œ)) (X : Module.Dual π•œ H β†’β‚—[π•œ] K) (x : Ξ©) : K :=
X (evaluation H x)
def shift (H : Submodule π•œ (Ξ© β†’ π•œ)) (X : Module.Dual π•œ H β†’β‚—[π•œ] K)
(a : K) (h : H) : Module.Dual π•œ H β†’β‚—[π•œ] K :=
X + (Module.Dual.eval π•œ H h).smulRight a
@[simp] theorem evaluate_shift (H : Submodule π•œ (Ξ© β†’ π•œ))
(X : Module.Dual π•œ H β†’β‚—[π•œ] K) (a : K) (h : H) (x : Ξ©) :
evaluate H (shift H X a h) x = evaluate H X x + h.val x β€’ a := rfl
def joint {Z : Type*} (H : Submodule π•œ (Ξ© β†’ π•œ)) (other : Ξ© β†’ Z)
(X : Module.Dual π•œ H β†’β‚—[π•œ] K) (x : Ξ©) : K Γ— Z :=
(evaluate H X x, other x)
@[simp] theorem joint_shift {Z : Type*} (H : Submodule π•œ (Ξ© β†’ π•œ))
(other : Ξ© β†’ Z) (X : Module.Dual π•œ H β†’β‚—[π•œ] K) (a : K) (h : H) (x : Ξ©) :
joint H other (shift H X a h) x = (evaluate H X x + h.val x β€’ a, other x) := rfl
section Rows
variable (H : Submodule π•œ (Ξ© β†’ π•œ)) [FiniteDimensional π•œ H] {β„“ : Nat}
def rows (X : Module.Dual π•œ H β†’β‚—[π•œ] (Fin β„“ β†’ π•œ)) : Fin β„“ β†’ H :=
fun i => (Module.evalEquiv π•œ H).symm ((LinearMap.proj i).comp X)
def ofRows (v : Fin β„“ β†’ H) : Module.Dual π•œ H β†’β‚—[π•œ] (Fin β„“ β†’ π•œ) :=
LinearMap.pi (fun i => Module.Dual.eval π•œ H (v i))
omit [FiniteDimensional π•œ H] in
@[simp] theorem ofRows_apply (v : Fin β„“ β†’ H) (q : Module.Dual π•œ H) (i : Fin β„“) :
ofRows H v q i = q (v i) := rfl
@[simp] theorem ofRows_rows (X : Module.Dual π•œ H β†’β‚—[π•œ] (Fin β„“ β†’ π•œ)) :
ofRows H (rows H X) = X := by
ext q i
exact Module.apply_evalEquiv_symm_apply π•œ H q ((LinearMap.proj i).comp X)
@[simp] theorem rows_ofRows (v : Fin β„“ β†’ H) : rows H (ofRows H v) = v := by
funext i
exact (Module.evalEquiv π•œ H).symm_apply_apply (v i)
def rowsEquiv : (Module.Dual π•œ H β†’β‚—[π•œ] (Fin β„“ β†’ π•œ)) ≃ (Fin β„“ β†’ H) where
toFun := rows H
invFun := ofRows H
left_inv := ofRows_rows H
right_inv := rows_ofRows H
omit [FiniteDimensional π•œ H] in
@[simp] theorem evaluate_ofRows (v : Fin β„“ β†’ H) (x : Ξ©) :
evaluate H (ofRows H v) x = fun i => (v i).val x := rfl
theorem rows_apply (X : Module.Dual π•œ H β†’β‚—[π•œ] (Fin β„“ β†’ π•œ)) (i : Fin β„“) (x : Ξ©) :
(rows H X i).val x = evaluate H X x i :=
Module.apply_evalEquiv_symm_apply π•œ H (evaluation H x) ((LinearMap.proj i).comp X)
theorem evaluate_injective :
Function.Injective (evaluate H : (Module.Dual π•œ H β†’β‚—[π•œ] (Fin β„“ β†’ π•œ)) β†’ (Ξ© β†’ Fin β„“ β†’ π•œ)) := by
intro X X' h
apply (rowsEquiv H).injective
funext i
apply Subtype.ext
funext x
change (rows H X i).val x = (rows H X' i).val x
rw [rows_apply, rows_apply]
exact congrFun (congrFun h x) i
end Rows
end
end PerfectCompleteness.EvaluationMatrix
end
end OAI