Additional theorems and definitions about the Vector type

This file introduces the infix notation ::ᵥ for Vector.cons.

def Mathlib.Vector.«term_::ᵥ_» : Lean.TrailingParserDescr

If a : α and l : Vector α n, then cons a l, is the vector of length n + 1 whose first element is a and with l as the rest of the list.

Equations

• Mathlib.Vector.«term_::ᵥ_» = Lean.ParserDescr.trailingNode `Mathlib.Vector.term_::ᵥ_ 67 68 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ::ᵥ ") (Lean.ParserDescr.cat `term 67))

instance Mathlib.Vector.instInhabited {n : ℕ} {α : Type u_1} [Inhabited α] : Inhabited (Mathlib.Vector α n)

Equations

• Mathlib.Vector.instInhabited = { default := Mathlib.Vector.ofFn default }

theorem Mathlib.Vector.toList_injective {n : ℕ} {α : Type u_1} : Function.Injective Mathlib.Vector.toList

theorem Mathlib.Vector.ext {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α n} {w : Mathlib.Vector α n} : (∀ (m : Fin n), v.get m = w.get m) → v = w

Two v w : Vector α n are equal iff they are equal at every single index.

instance Mathlib.Vector.zero_subsingleton {α : Type u_1} : Subsingleton (Mathlib.Vector α 0)

The empty Vector is a Subsingleton.

Equations

• ⋯ = ⋯

@[simp]

theorem Mathlib.Vector.cons_val {n : ℕ} {α : Type u_1} (a : α) (v : Mathlib.Vector α n) : ↑(a ::ᵥ v) = a :: ↑v

theorem Mathlib.Vector.eq_cons_iff {n : ℕ} {α : Type u_1} (a : α) (v : Mathlib.Vector α n.succ) (v' : Mathlib.Vector α n) : v = a ::ᵥ v' ↔ v.head = a ∧ v.tail = v'

theorem Mathlib.Vector.ne_cons_iff {n : ℕ} {α : Type u_1} (a : α) (v : Mathlib.Vector α n.succ) (v' : Mathlib.Vector α n) : v ≠ a ::ᵥ v' ↔ v.head ≠ a ∨ v.tail ≠ v'

theorem Mathlib.Vector.exists_eq_cons {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n.succ) : ∃ (a : α) (as : Mathlib.Vector α n), v = a ::ᵥ as

@[simp]

theorem Mathlib.Vector.toList_ofFn {α : Type u_1} {n : ℕ} (f : Fin n → α) : (Mathlib.Vector.ofFn f).toList = List.ofFn f

@[simp]

theorem Mathlib.Vector.mk_toList {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) (h : v.toList.length = n) : ⟨v.toList, h⟩ = v

@[simp]

theorem Mathlib.Vector.length_val {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) : (↑v).length = n

@[simp]

theorem Mathlib.Vector.toList_map {n : ℕ} {α : Type u_1} {β : Type u_2} (v : Mathlib.Vector α n) (f : α → β) : (Mathlib.Vector.map f v).toList = List.map f v.toList

@[simp]

theorem Mathlib.Vector.head_map {n : ℕ} {α : Type u_1} {β : Type u_2} (v : Mathlib.Vector α (n + 1)) (f : α → β) : (Mathlib.Vector.map f v).head = f v.head

@[simp]

theorem Mathlib.Vector.tail_map {n : ℕ} {α : Type u_1} {β : Type u_2} (v : Mathlib.Vector α (n + 1)) (f : α → β) : (Mathlib.Vector.map f v).tail = Mathlib.Vector.map f v.tail

theorem Mathlib.Vector.get_eq_get {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) (i : Fin n) : v.get i = v.toList.get (Fin.cast ⋯ i)

@[simp]

theorem Mathlib.Vector.get_replicate {n : ℕ} {α : Type u_1} (a : α) (i : Fin n) : (Mathlib.Vector.replicate n a).get i = a

@[simp]

theorem Mathlib.Vector.get_map {n : ℕ} {α : Type u_1} {β : Type u_2} (v : Mathlib.Vector α n) (f : α → β) (i : Fin n) : (Mathlib.Vector.map f v).get i = f (v.get i)

@[simp]

theorem Mathlib.Vector.map₂_nil {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) : Mathlib.Vector.map₂ f Mathlib.Vector.nil Mathlib.Vector.nil = Mathlib.Vector.nil

@[simp]

theorem Mathlib.Vector.map₂_cons {n : ℕ} {α : Type u_1} {β : Type u_2} {γ : Type u_3} (hd₁ : α) (tl₁ : Mathlib.Vector α n) (hd₂ : β) (tl₂ : Mathlib.Vector β n) (f : α → β → γ) : Mathlib.Vector.map₂ f (hd₁ ::ᵥ tl₁) (hd₂ ::ᵥ tl₂) = f hd₁ hd₂ ::ᵥ Mathlib.Vector.map₂ f tl₁ tl₂

@[simp]

theorem Mathlib.Vector.get_ofFn {α : Type u_1} {n : ℕ} (f : Fin n → α) (i : Fin n) : (Mathlib.Vector.ofFn f).get i = f i

@[simp]

theorem Mathlib.Vector.ofFn_get {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) : Mathlib.Vector.ofFn v.get = v

def Equiv.vectorEquivFin (α : Type u_2) (n : ℕ) : Mathlib.Vector α n ≃ (Fin n → α)

The natural equivalence between length-n vectors and functions from Fin n.

Equations

• Equiv.vectorEquivFin α n = { toFun := Mathlib.Vector.get, invFun := Mathlib.Vector.ofFn, left_inv := ⋯, right_inv := ⋯ }

theorem Mathlib.Vector.get_tail {n : ℕ} {α : Type u_1} (x : Mathlib.Vector α n) (i : Fin (n - 1)) : x.tail.get i = x.get ⟨↑i + 1, ⋯⟩

@[simp]

theorem Mathlib.Vector.get_tail_succ {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n.succ) (i : Fin n) : v.tail.get i = v.get i.succ

@[simp]

theorem Mathlib.Vector.tail_val {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n.succ) : ↑v.tail = (↑v).tail

@[simp]

theorem Mathlib.Vector.tail_nil {α : Type u_1} : Mathlib.Vector.nil.tail = Mathlib.Vector.nil

The tail of a nil vector is nil.

@[simp]

theorem Mathlib.Vector.singleton_tail {α : Type u_1} (v : Mathlib.Vector α 1) : v.tail = Mathlib.Vector.nil

The tail of a vector made up of one element is nil.

@[simp]

theorem Mathlib.Vector.tail_ofFn {α : Type u_1} {n : ℕ} (f : Fin n.succ → α) : (Mathlib.Vector.ofFn f).tail = Mathlib.Vector.ofFn fun (i : Fin n) => f i.succ

@[simp]

theorem Mathlib.Vector.toList_empty {α : Type u_1} (v : Mathlib.Vector α 0) : v.toList = []

@[simp]

theorem Mathlib.Vector.toList_singleton {α : Type u_1} (v : Mathlib.Vector α 1) : v.toList = [v.head]

The list that makes up a Vector made up of a single element, retrieved via toList, is equal to the list of that single element.

@[simp]

theorem Mathlib.Vector.empty_toList_eq_ff {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α (n + 1)) : v.toList.isEmpty = false

theorem Mathlib.Vector.not_empty_toList {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α (n + 1)) : ¬v.toList.isEmpty = true

@[simp]

theorem Mathlib.Vector.map_id {α : Type u_1} {n : ℕ} (v : Mathlib.Vector α n) : Mathlib.Vector.map id v = v

Mapping under id does not change a vector.

theorem Mathlib.Vector.nodup_iff_injective_get {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α n} : v.toList.Nodup ↔ Function.Injective v.get

theorem Mathlib.Vector.head?_toList {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n.succ) : v.toList.head? = some v.head

def Mathlib.Vector.reverse {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) : Mathlib.Vector α n

Reverse a vector.

Equations

• v.reverse = ⟨v.toList.reverse, ⋯⟩

theorem Mathlib.Vector.toList_reverse {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α n} : v.reverse.toList = v.toList.reverse

The List of a vector after a reverse, retrieved by toList is equal to the List.reverse after retrieving a vector's toList.

@[simp]

theorem Mathlib.Vector.reverse_reverse {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α n} : v.reverse.reverse = v

@[simp]

theorem Mathlib.Vector.get_zero {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n.succ) : v.get 0 = v.head

@[simp]

theorem Mathlib.Vector.head_ofFn {α : Type u_1} {n : ℕ} (f : Fin n.succ → α) : (Mathlib.Vector.ofFn f).head = f 0

theorem Mathlib.Vector.get_cons_zero {n : ℕ} {α : Type u_1} (a : α) (v : Mathlib.Vector α n) : (a ::ᵥ v).get 0 = a

@[simp]

theorem Mathlib.Vector.get_cons_nil {α : Type u_1} {ix : Fin 1} (x : α) : (x ::ᵥ Mathlib.Vector.nil).get ix = x

Accessing the nth element of a vector made up of one element x : α is x itself.

@[simp]

theorem Mathlib.Vector.get_cons_succ {n : ℕ} {α : Type u_1} (a : α) (v : Mathlib.Vector α n) (i : Fin n) : (a ::ᵥ v).get i.succ = v.get i

def Mathlib.Vector.last {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α (n + 1)) : α

The last element of a Vector, given that the vector is at least one element.

Equations

• v.last = v.get (Fin.last n)

theorem Mathlib.Vector.last_def {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α (n + 1)} : v.last = v.get (Fin.last n)

The last element of a Vector, given that the vector is at least one element.

theorem Mathlib.Vector.reverse_get_zero {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α (n + 1)} : v.reverse.head = v.last

The last element of a vector is the head of the reverse vector.

def Mathlib.Vector.scanl {n : ℕ} {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) (v : Mathlib.Vector α n) : Mathlib.Vector β (n + 1)

Construct a Vector β (n + 1) from a Vector α n by scanning f : β → α → β from the "left", that is, from 0 to Fin.last n, using b : β as the starting value.

Equations

• Mathlib.Vector.scanl f b v = ⟨List.scanl f b v.toList, ⋯⟩

@[simp]

theorem Mathlib.Vector.scanl_nil {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) : Mathlib.Vector.scanl f b Mathlib.Vector.nil = b ::ᵥ Mathlib.Vector.nil

Providing an empty vector to scanl gives the starting value b : β.

@[simp]

theorem Mathlib.Vector.scanl_cons {n : ℕ} {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) (v : Mathlib.Vector α n) (x : α) : Mathlib.Vector.scanl f b (x ::ᵥ v) = b ::ᵥ Mathlib.Vector.scanl f (f b x) v

The recursive step of scanl splits a vector x ::ᵥ v : Vector α (n + 1) into the provided starting value b : β and the recursed scanl f b x : β as the starting value.

This lemma is the cons version of scanl_get.

@[simp]

theorem Mathlib.Vector.scanl_val {n : ℕ} {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) {v : Mathlib.Vector α n} : ↑(Mathlib.Vector.scanl f b v) = List.scanl f b ↑v

The underlying List of a Vector after a scanl is the List.scanl of the underlying List of the original Vector.

@[simp]

theorem Mathlib.Vector.toList_scanl {n : ℕ} {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) (v : Mathlib.Vector α n) : (Mathlib.Vector.scanl f b v).toList = List.scanl f b v.toList

The toList of a Vector after a scanl is the List.scanl of the toList of the original Vector.

@[simp]

theorem Mathlib.Vector.scanl_singleton {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) (v : Mathlib.Vector α 1) : Mathlib.Vector.scanl f b v = b ::ᵥ f b v.head ::ᵥ Mathlib.Vector.nil

The recursive step of scanl splits a vector made up of a single element x ::ᵥ nil : Vector α 1 into a Vector of the provided starting value b : β and the mapped f b x : β as the last value.

@[simp]

theorem Mathlib.Vector.scanl_head {n : ℕ} {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) (v : Mathlib.Vector α n) : (Mathlib.Vector.scanl f b v).head = b

The first element of scanl of a vector v : Vector α n, retrieved via head, is the starting value b : β.

@[simp]

theorem Mathlib.Vector.scanl_get {n : ℕ} {α : Type u_1} {β : Type u_2} (f : β → α → β) (b : β) (v : Mathlib.Vector α n) (i : Fin n) : (Mathlib.Vector.scanl f b v).get i.succ = f ((Mathlib.Vector.scanl f b v).get i.castSucc) (v.get i)

For an index i : Fin n, the nth element of scanl of a vector v : Vector α n at i.succ, is equal to the application function f : β → α → β of the castSucc i element of scanl f b v and get v i.

This lemma is the get version of scanl_cons.

def Mathlib.Vector.mOfFn {m : Type u → Type u_2} [Monad m] {α : Type u} {n : ℕ} : (Fin n → m α) → m (Mathlib.Vector α n)

Monadic analog of Vector.ofFn. Given a monadic function on Fin n, return a Vector α n inside the monad.

Equations

• Mathlib.Vector.mOfFn x_2 = pure Mathlib.Vector.nil
• Mathlib.Vector.mOfFn f = do let a ← f 0 let v ← Mathlib.Vector.mOfFn fun (i : Fin n) => f i.succ pure (a ::ᵥ v)

theorem Mathlib.Vector.mOfFn_pure {m : Type u_2 → Type u_3} [Monad m] [LawfulMonad m] {α : Type u_2} {n : ℕ} (f : Fin n → α) : (Mathlib.Vector.mOfFn fun (i : Fin n) => pure (f i)) = pure (Mathlib.Vector.ofFn f)

def Mathlib.Vector.mmap {m : Type u → Type u_2} [Monad m] {α : Type u_3} {β : Type u} (f : α → m β) {n : ℕ} : Mathlib.Vector α n → m (Mathlib.Vector β n)

Apply a monadic function to each component of a vector, returning a vector inside the monad.

Equations

• Mathlib.Vector.mmap f x_2 = pure Mathlib.Vector.nil
• Mathlib.Vector.mmap f xs = do let h' ← f xs.head let t' ← Mathlib.Vector.mmap f xs.tail pure (h' ::ᵥ t')

@[simp]

theorem Mathlib.Vector.mmap_nil {m : Type u_2 → Type u_3} [Monad m] {α : Type u_4} {β : Type u_2} (f : α → m β) : Mathlib.Vector.mmap f Mathlib.Vector.nil = pure Mathlib.Vector.nil

@[simp]

theorem Mathlib.Vector.mmap_cons {m : Type u_2 → Type u_3} [Monad m] {α : Type u_4} {β : Type u_2} (f : α → m β) (a : α) {n : ℕ} (v : Mathlib.Vector α n) : Mathlib.Vector.mmap f (a ::ᵥ v) = do let h' ← f a let t' ← Mathlib.Vector.mmap f v pure (h' ::ᵥ t')

def Mathlib.Vector.inductionOn {α : Type u_1} {C : {n : ℕ} → Mathlib.Vector α n → Sort u_2} {n : ℕ} (v : Mathlib.Vector α n) (nil : C Mathlib.Vector.nil) (cons : {n : ℕ} → {x : α} → {w : Mathlib.Vector α n} → C w → C (x ::ᵥ w)) : C v

Define C v by induction on v : Vector α n.

This function has two arguments: nil handles the base case on C nil, and cons defines the inductive step using ∀ x : α, C w → C (x ::ᵥ w).

It is used as the default induction principle for the induction tactic.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Mathlib.Vector.inductionOn_nil {α : Type u_1} {C : {n : ℕ} → Mathlib.Vector α n → Sort u_2} (nil : C Mathlib.Vector.nil) (cons : {n : ℕ} → {x : α} → {w : Mathlib.Vector α n} → C w → C (x ::ᵥ w)) : (Mathlib.Vector.nil.inductionOn nil fun {n : ℕ} {x : α} {w : Mathlib.Vector α n} => cons) = nil

@[simp]

theorem Mathlib.Vector.inductionOn_cons {α : Type u_1} {C : {n : ℕ} → Mathlib.Vector α n → Sort u_2} {n : ℕ} (x : α) (v : Mathlib.Vector α n) (nil : C Mathlib.Vector.nil) (cons : {n : ℕ} → {x : α} → {w : Mathlib.Vector α n} → C w → C (x ::ᵥ w)) : ((x ::ᵥ v).inductionOn nil fun {n : ℕ} {x : α} {w : Mathlib.Vector α n} => cons) = cons (v.inductionOn nil fun {n : ℕ} {x : α} {w : Mathlib.Vector α n} => cons)

def Mathlib.Vector.inductionOn₂ {n : ℕ} {α : Type u_1} {β : Type u_2} {C : {n : ℕ} → Mathlib.Vector α n → Mathlib.Vector β n → Sort u_4} (v : Mathlib.Vector α n) (w : Mathlib.Vector β n) (nil : C Mathlib.Vector.nil Mathlib.Vector.nil) (cons : {n : ℕ} → {a : α} → {b : β} → {x : Mathlib.Vector α n} → {y : Mathlib.Vector β n} → C x y → C (a ::ᵥ x) (b ::ᵥ y)) : C v w

Define C v w by induction on a pair of vectors v : Vector α n and w : Vector β n.

Equations

• One or more equations did not get rendered due to their size.

def Mathlib.Vector.inductionOn₃ {n : ℕ} {α : Type u_1} {β : Type u_2} {γ : Type u_3} {C : {n : ℕ} → Mathlib.Vector α n → Mathlib.Vector β n → Mathlib.Vector γ n → Sort u_4} (u : Mathlib.Vector α n) (v : Mathlib.Vector β n) (w : Mathlib.Vector γ n) (nil : C Mathlib.Vector.nil Mathlib.Vector.nil Mathlib.Vector.nil) (cons : {n : ℕ} → {a : α} → {b : β} → {c : γ} → {x : Mathlib.Vector α n} → {y : Mathlib.Vector β n} → {z : Mathlib.Vector γ n} → C x y z → C (a ::ᵥ x) (b ::ᵥ y) (c ::ᵥ z)) : C u v w

Define C u v w by induction on a triplet of vectors u : Vector α n, v : Vector β n, and w : Vector γ b.

Equations

• One or more equations did not get rendered due to their size.

def Mathlib.Vector.casesOn {α : Type u_1} {m : ℕ} {motive : {n : ℕ} → Mathlib.Vector α n → Sort u_4} (v : Mathlib.Vector α m) (nil : motive Mathlib.Vector.nil) (cons : {n : ℕ} → (hd : α) → (tl : Mathlib.Vector α n) → motive (hd ::ᵥ tl)) : motive v

Define motive v by case-analysis on v : Vector α n.

Equations

• Mathlib.Vector.casesOn v nil cons = v.inductionOn nil fun (x : ℕ) (hd : α) (tl : Mathlib.Vector α x) (x_1 : motive tl) => cons hd tl

def Mathlib.Vector.casesOn₂ {α : Type u_1} {β : Type u_2} {m : ℕ} {motive : {n : ℕ} → Mathlib.Vector α n → Mathlib.Vector β n → Sort u_4} (v₁ : Mathlib.Vector α m) (v₂ : Mathlib.Vector β m) (nil : motive Mathlib.Vector.nil Mathlib.Vector.nil) (cons : {n : ℕ} → (x : α) → (y : β) → (xs : Mathlib.Vector α n) → (ys : Mathlib.Vector β n) → motive (x ::ᵥ xs) (y ::ᵥ ys)) : motive v₁ v₂

Define motive v₁ v₂ by case-analysis on v₁ : Vector α n and v₂ : Vector β n.

Equations

• Mathlib.Vector.casesOn₂ v₁ v₂ nil cons = v₁.inductionOn₂ v₂ nil fun (x : ℕ) (x_1 : α) (y : β) (xs : Mathlib.Vector α x) (ys : Mathlib.Vector β x) (x_2 : motive xs ys) => cons x_1 y xs ys

def Mathlib.Vector.casesOn₃ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {m : ℕ} {motive : {n : ℕ} → Mathlib.Vector α n → Mathlib.Vector β n → Mathlib.Vector γ n → Sort u_4} (v₁ : Mathlib.Vector α m) (v₂ : Mathlib.Vector β m) (v₃ : Mathlib.Vector γ m) (nil : motive Mathlib.Vector.nil Mathlib.Vector.nil Mathlib.Vector.nil) (cons : {n : ℕ} → (x : α) → (y : β) → (z : γ) → (xs : Mathlib.Vector α n) → (ys : Mathlib.Vector β n) → (zs : Mathlib.Vector γ n) → motive (x ::ᵥ xs) (y ::ᵥ ys) (z ::ᵥ zs)) : motive v₁ v₂ v₃

Define motive v₁ v₂ v₃ by case-analysis on v₁ : Vector α n, v₂ : Vector β n, and v₃ : Vector γ n.

Equations

• One or more equations did not get rendered due to their size.

def Mathlib.Vector.toArray {n : ℕ} {α : Type u_1} : Mathlib.Vector α n → Array α

Cast a vector to an array.

Equations

• x.toArray = match x with | ⟨xs, property⟩ => cast ⋯ (List.toArray xs)

def Mathlib.Vector.insertNth {n : ℕ} {α : Type u_1} (a : α) (i : Fin (n + 1)) (v : Mathlib.Vector α n) : Mathlib.Vector α (n + 1)

v.insertNth a i inserts a into the vector v at position i (and shifting later components to the right).

Equations

• Mathlib.Vector.insertNth a i v = ⟨List.insertNth (↑i) a ↑v, ⋯⟩

theorem Mathlib.Vector.insertNth_val {n : ℕ} {α : Type u_1} {a : α} {i : Fin (n + 1)} {v : Mathlib.Vector α n} : ↑(Mathlib.Vector.insertNth a i v) = List.insertNth (↑i) a ↑v

@[simp]

theorem Mathlib.Vector.eraseIdx_val {n : ℕ} {α : Type u_1} {i : Fin n} {v : Mathlib.Vector α n} : ↑(Mathlib.Vector.eraseIdx i v) = (↑v).eraseIdx ↑i

@[deprecated Mathlib.Vector.eraseIdx_val]

theorem Mathlib.Vector.removeNth_val {n : ℕ} {α : Type u_1} {i : Fin n} {v : Mathlib.Vector α n} : ↑(Mathlib.Vector.eraseIdx i v) = (↑v).eraseIdx ↑i

Alias of Mathlib.Vector.eraseIdx_val.

theorem Mathlib.Vector.eraseIdx_insertNth {n : ℕ} {α : Type u_1} {a : α} {v : Mathlib.Vector α n} {i : Fin (n + 1)} : Mathlib.Vector.eraseIdx i (Mathlib.Vector.insertNth a i v) = v

@[deprecated Mathlib.Vector.eraseIdx_insertNth]

theorem Mathlib.Vector.removeNth_insertNth {n : ℕ} {α : Type u_1} {a : α} {v : Mathlib.Vector α n} {i : Fin (n + 1)} : Mathlib.Vector.eraseIdx i (Mathlib.Vector.insertNth a i v) = v

Alias of Mathlib.Vector.eraseIdx_insertNth.

theorem Mathlib.Vector.eraseIdx_insertNth' {n : ℕ} {α : Type u_1} {a : α} {v : Mathlib.Vector α (n + 1)} {i : Fin (n + 1)} {j : Fin (n + 2)} : Mathlib.Vector.eraseIdx (j.succAbove i) (Mathlib.Vector.insertNth a j v) = Mathlib.Vector.insertNth a (i.predAbove j) (Mathlib.Vector.eraseIdx i v)

@[deprecated Mathlib.Vector.eraseIdx_insertNth']

theorem Mathlib.Vector.removeNth_insertNth' {n : ℕ} {α : Type u_1} {a : α} {v : Mathlib.Vector α (n + 1)} {i : Fin (n + 1)} {j : Fin (n + 2)} : Mathlib.Vector.eraseIdx (j.succAbove i) (Mathlib.Vector.insertNth a j v) = Mathlib.Vector.insertNth a (i.predAbove j) (Mathlib.Vector.eraseIdx i v)

Alias of Mathlib.Vector.eraseIdx_insertNth'.

theorem Mathlib.Vector.insertNth_comm {n : ℕ} {α : Type u_1} (a : α) (b : α) (i : Fin (n + 1)) (j : Fin (n + 1)) (h : i ≤ j) (v : Mathlib.Vector α n) : Mathlib.Vector.insertNth b j.succ (Mathlib.Vector.insertNth a i v) = Mathlib.Vector.insertNth a i.castSucc (Mathlib.Vector.insertNth b j v)

def Mathlib.Vector.set {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) (i : Fin n) (a : α) : Mathlib.Vector α n

set v n a replaces the nth element of v with a.

Equations

• v.set i a = ⟨(↑v).set (↑i) a, ⋯⟩

@[simp]

theorem Mathlib.Vector.toList_set {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) (i : Fin n) (a : α) : (v.set i a).toList = v.toList.set (↑i) a

@[simp]

theorem Mathlib.Vector.get_set_same {n : ℕ} {α : Type u_1} (v : Mathlib.Vector α n) (i : Fin n) (a : α) : (v.set i a).get i = a

theorem Mathlib.Vector.get_set_of_ne {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α n} {i : Fin n} {j : Fin n} (h : i ≠ j) (a : α) : (v.set i a).get j = v.get j

theorem Mathlib.Vector.get_set_eq_if {n : ℕ} {α : Type u_1} {v : Mathlib.Vector α n} {i : Fin n} {j : Fin n} (a : α) : (v.set i a).get j = if i = j then a else v.get j

theorem Mathlib.Vector.sum_set {n : ℕ} {α : Type u_1} [AddMonoid α] (v : Mathlib.Vector α n) (i : Fin n) (a : α) : (v.set i a).toList.sum = (Mathlib.Vector.take (↑i) v).toList.sum + a + (Mathlib.Vector.drop (↑i + 1) v).toList.sum

theorem Mathlib.Vector.prod_set {n : ℕ} {α : Type u_1} [Monoid α] (v : Mathlib.Vector α n) (i : Fin n) (a : α) : (v.set i a).toList.prod = (Mathlib.Vector.take (↑i) v).toList.prod * a * (Mathlib.Vector.drop (↑i + 1) v).toList.prod

theorem Mathlib.Vector.sum_set' {n : ℕ} {α : Type u_1} [AddCommGroup α] (v : Mathlib.Vector α n) (i : Fin n) (a : α) : (v.set i a).toList.sum = v.toList.sum + -v.get i + a

theorem Mathlib.Vector.prod_set' {n : ℕ} {α : Type u_1} [CommGroup α] (v : Mathlib.Vector α n) (i : Fin n) (a : α) : (v.set i a).toList.prod = v.toList.prod * (v.get i)⁻¹ * a

def Mathlib.Vector.traverse {n : ℕ} {F : Type u → Type u} [Applicative F] {α : Type u} {β : Type u} (f : α → F β) : Mathlib.Vector α n → F (Mathlib.Vector β n)

Apply an applicative function to each component of a vector.

Equations

• Mathlib.Vector.traverse f x = match x with | ⟨v, Hv⟩ => cast ⋯ (Mathlib.Vector.traverseAux f v)

@[simp]

theorem Mathlib.Vector.traverse_def {n : ℕ} {F : Type u → Type u} [Applicative F] {α : Type u} {β : Type u} (f : α → F β) (x : α) (xs : Mathlib.Vector α n) : Mathlib.Vector.traverse f (x ::ᵥ xs) = Seq.seq (Mathlib.Vector.cons <$> f x) fun (x : Unit) => Mathlib.Vector.traverse f xs

theorem Mathlib.Vector.id_traverse {n : ℕ} {α : Type u} (x : Mathlib.Vector α n) : Mathlib.Vector.traverse pure x = x

theorem Mathlib.Vector.comp_traverse {n : ℕ} {F : Type u → Type u} {G : Type u → Type u} [Applicative F] [Applicative G] [LawfulApplicative G] {α : Type u} {β : Type u} {γ : Type u} (f : β → F γ) (g : α → G β) (x : Mathlib.Vector α n) : Mathlib.Vector.traverse (Functor.Comp.mk ∘ Functor.map f ∘ g) x = Functor.Comp.mk (Mathlib.Vector.traverse f <$> Mathlib.Vector.traverse g x)

theorem Mathlib.Vector.traverse_eq_map_id {n : ℕ} {α : Type u_1} {β : Type u_1} (f : α → β) (x : Mathlib.Vector α n) : Mathlib.Vector.traverse (pure ∘ f) x = pure (Mathlib.Vector.map f x)

theorem Mathlib.Vector.naturality {n : ℕ} {F : Type u → Type u} {G : Type u → Type u} [Applicative F] [Applicative G] [LawfulApplicative F] [LawfulApplicative G] (η : ApplicativeTransformation F G) {α : Type u} {β : Type u} (f : α → F β) (x : Mathlib.Vector α n) : (fun {α : Type u} => η.app α) (Mathlib.Vector.traverse f x) = Mathlib.Vector.traverse ((fun {α : Type u} => η.app α) ∘ f) x

instance Mathlib.Vector.instTraversableFlipNat {n : ℕ} : Traversable (flip Mathlib.Vector n)

Equations

• Mathlib.Vector.instTraversableFlipNat = Traversable.mk (@Mathlib.Vector.traverse n)

instance Mathlib.Vector.instLawfulTraversableFlipNat {n : ℕ} : LawfulTraversable (flip Mathlib.Vector n)

Equations

• ⋯ = ⋯

@[simp]

theorem Mathlib.Vector.replicate_succ {α : Type u_1} {n : ℕ} (val : α) : Mathlib.Vector.replicate (n + 1) val = val ::ᵥ Mathlib.Vector.replicate n val

@[simp]

theorem Mathlib.Vector.get_append_cons_zero {α : Type u_1} {m : ℕ} {n : ℕ} (xs : Mathlib.Vector α n) (ys : Mathlib.Vector α m) {x : α} : ((x ::ᵥ xs).append ys).get ⟨0, ⋯⟩ = x

@[simp]

theorem Mathlib.Vector.get_append_cons_succ {α : Type u_1} {m : ℕ} {n : ℕ} (xs : Mathlib.Vector α n) (ys : Mathlib.Vector α m) {x : α} {i : Fin (n + m)} {h : ↑i + 1 < n.succ + m} : ((x ::ᵥ xs).append ys).get ⟨↑i + 1, h⟩ = (xs.append ys).get i

@[simp]

theorem Mathlib.Vector.append_nil {α : Type u_1} {n : ℕ} (xs : Mathlib.Vector α n) : xs.append Mathlib.Vector.nil = xs

@[simp]

theorem Mathlib.Vector.get_map₂ {α : Type u_2} {β : Type u_3} {n : ℕ} {γ : Type u_1} (v₁ : Mathlib.Vector α n) (v₂ : Mathlib.Vector β n) (f : α → β → γ) (i : Fin n) : (Mathlib.Vector.map₂ f v₁ v₂).get i = f (v₁.get i) (v₂.get i)

@[simp]

theorem Mathlib.Vector.mapAccumr_cons {α : Type u_2} {n : ℕ} (xs : Mathlib.Vector α n) : ∀ {α_1 : Type} {β : Type u_1} {f : α → α_1 → α_1 × β} {x : α} {s : α_1}, Mathlib.Vector.mapAccumr f (x ::ᵥ xs) s = let r := Mathlib.Vector.mapAccumr f xs s; let q := f x r.1; (q.1, q.2 ::ᵥ r.2)

@[simp]

theorem Mathlib.Vector.mapAccumr₂_cons {α : Type} {β : Type} {n : ℕ} (xs : Mathlib.Vector α n) (ys : Mathlib.Vector β n) : ∀ {α_1 β_1 : Type} {f : α → β → α_1 → α_1 × β_1} {x : α} {y : β} {s : α_1}, Mathlib.Vector.mapAccumr₂ f (x ::ᵥ xs) (y ::ᵥ ys) s = let r := Mathlib.Vector.mapAccumr₂ f xs ys s; let q := f x y r.1; (q.1, q.2 ::ᵥ r.2)