Zulip Chat Archive
Stream: Is there code for X?
Topic: Completeness of Rn
Apurva Nakade (Dec 03 2023 at 14:37):
Do we have a proof of the completeness of $R^n$?
The closest thing I found was docs#euclidean_space.inner_product_space
Apurva Nakade (Dec 03 2023 at 14:38):
(Why is the docs link not working? :thinking: )
Yaël Dillies (Dec 03 2023 at 14:38):
Yaël Dillies (Dec 03 2023 at 14:39):
Apurva Nakade said:
(Why is the docs link not working? :thinking: )
docs3#euclidean_space.inner_product_space
Apurva Nakade (Dec 03 2023 at 14:40):
Great, thanks! I was searching in the wrong file.
Apurva Nakade (Dec 03 2023 at 14:56):
Is there a simple way to have the following instance:
import Mathlib.Topology.UniformSpace.Pi
import Mathlib.Analysis.InnerProductSpace.PiL2
variable {n : Type*} [Fintype n]
instance : CompleteSpace (n → ℝ) := inferInstance
instance : CompleteSpace (EuclideanSpace ℝ n) := inferInstance
noncomputable instance : InnerProductSpace ℝ (EuclideanSpace ℝ n) := inferInstance
noncomputable instance : InnerProductSpace ℝ (n → ℝ) := inferInstance --error
Apurva Nakade (Dec 03 2023 at 14:57):
I can work with EuclideanSpace
but simp
doesn't like it much.
Nvm, I can make EuclideanSpace
work.
Yaël Dillies (Dec 03 2023 at 15:01):
Not really, no. It would equip n → ℝ
with the euclidean norm, and this conflicts with the infinity norm we have by default.
Apurva Nakade (Dec 03 2023 at 15:05):
Thanks again! I'll stick with EuclideanSpace
then.
Last updated: Dec 20 2023 at 11:08 UTC