int_to_euclidean
deforiginal
The canonical embedding of an integer vector z ∈ ℤ^n into the Euclidean space ℝ^n.
Statement
noncomputable def int_to_euclidean (n : ℕ) (z : Fin n → ℤ) : EuclideanSpace ℝ (Fin n)
- Related work
- folklore
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Used by 7
- view_obstruction_offset_botThe offset of the zero subspace is zero: δ_⊥^2 = 0.
- view_obstruction_offsetThe offset δ_U^2 of a linear subspace U in ℝ^n, defined as the infimum over integer vectors z ∈ ℤ^n of the squared norm of the orthogonal…
- is_rational_subspaceA linear subspace U in ℝ^n is rational if it is the real span of a set of integer vectors.
- view_obstruction_offset_le_ray_distOffset lower bound: for any linear subspace U ⊆ ℝ^n and any integer direction vector v ∈ ℤ^n orthogonal to U (v ∈ U^⊥), the…
- view_obstruction_ray_distThe view-obstruction squared distance d_n(v) for an integer direction vector v, defined as the infimum over t ∈ ℝ of the squared distance…
- is_rational_subspace_botThe zero subspace ⊥ of ℝ^n is a rational subspace.
- view_obstruction_ray_dist_absFor every integer vector v in ℤ^n with no zero coordinate, the view-obstruction distance d_n(|v|) equals d_n(v).
Read back from the Lean
Given a natural number n and an integer-valued function z : Fin n → ℤ, int_to_euclidean n z is defined as the element of EuclideanSpace ℝ (Fin n) obtained by coercing each component of z to ℝ and applying the canonical equivalence (EuclideanSpace.equiv (Fin n) ℝ).symm.
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
/-- Embed an integer vector into Euclidean space ℝ^n. -/ noncomputable def int_to_euclidean (n : ℕ) (z : Fin n → ℤ) : EuclideanSpace ℝ (Fin n) := (EuclideanSpace.equiv (Fin n) ℝ).symm (fun i => (z i : ℝ))