Download data/lean/OAI/Computability/PerfectCompleteness/Algebra/EvaluationMatrix.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.44 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/PerfectCompleteness/Algebra/EvaluationMatrix.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/PerfectCompleteness/Algebra/EvaluationMatrix.lean
-
curl -L -o EvaluationMatrix.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/PerfectCompleteness/Algebra/EvaluationMatrix.lean
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 | |