math / data /lean /OAI /NumberTheory /PiExponent /Approximation /AdditiveKernelTransport.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.7 kB
import Mathlib
namespace OAI
namespace PiExponent.AdditiveKernelTransport
variable {A A' B B' : Type*}
[AddCommGroup A] [AddCommGroup A'] [AddCommGroup B] [AddCommGroup B']
theorem equiv_zero (e : A ≃+ B) : e 0 = 0 := map_zero e
def kernelEquiv (e : A ≃+ B) (e' : A' ≃+ B')
(d : A β†’+ A') (D : B β†’+ B') (h : βˆ€ x, e' (d x) = D (e x)) :
d.ker ≃+ D.ker where
toFun c := ⟨e c.val, by
change D (e c.val) = 0
rw [← h, c.property, map_zero]⟩
invFun c := ⟨e.symm c.val, by
change d (e.symm c.val) = 0
apply e'.injective
rw [h, e.apply_symm_apply, map_zero]
exact c.property⟩
left_inv c := Subtype.ext (e.symm_apply_apply c.val)
right_inv c := Subtype.ext (e.apply_symm_apply c.val)
map_add' c b := Subtype.ext (map_add e c.val b.val)
theorem kernelEquiv_val (e : A ≃+ B) (e' : A' ≃+ B')
(d : A β†’+ A') (D : B β†’+ B') (h : βˆ€ x, e' (d x) = D (e x))
(c : d.ker) : (kernelEquiv e e' d D h c).val = e c.val := rfl
theorem transport_primitives {Aβ‚‚ Bβ‚‚ : Type*} [AddCommGroup Aβ‚‚] [AddCommGroup Bβ‚‚]
(eβ‚€ : A ≃+ B) (e₁ : A' ≃+ B') (eβ‚‚ : Aβ‚‚ ≃+ Bβ‚‚)
(dβ‚€ : A β†’+ A') (d₁ : A' β†’+ Aβ‚‚) (Dβ‚€ : B β†’+ B') (D₁ : B' β†’+ Bβ‚‚)
(hβ‚€ : βˆ€ x, e₁ (dβ‚€ x) = Dβ‚€ (eβ‚€ x))
(h₁ : βˆ€ x, eβ‚‚ (d₁ x) = D₁ (e₁ x))
(hp : βˆ€ c, D₁ c = 0 β†’ βˆƒ b, Dβ‚€ b = c) :
βˆ€ c, d₁ c = 0 β†’ βˆƒ b, dβ‚€ b = c := by
intro c hc
have hclosed : D₁ (e₁ c) = 0 := by rw [← h₁, hc, map_zero]
obtain ⟨b, hb⟩ := hp (e₁ c) hclosed
refine ⟨eβ‚€.symm b, e₁.injective ?_⟩
rw [hβ‚€, eβ‚€.apply_symm_apply, hb]
end PiExponent.AdditiveKernelTransport
end OAI