Shifting sequences
Content created by Jonathan Prieto-Cubides, Fredrik Bakke and Egbert Rijke.
Created on 2022-09-15.
Last modified on 2023-06-08.
module foundation.shifting-sequences where
Idea
Given a sequence f : ℕ → A
and an element a : A
we define
shift-ℕ a f : ℕ → A
by
shift-ℕ a f zero-ℕ := a
shift-ℕ a f (succ-ℕ n) := f n
Definition
shift-ℕ : {l : Level} {A : UU l} (a : A) (f : ℕ → A) → ℕ → A shift-ℕ a f zero-ℕ = a shift-ℕ a f (succ-ℕ n) = f n
Recent changes
- 2023-06-08. Fredrik Bakke. Remove empty
foundation
modules and replace them by their core counterparts (#644). - 2023-05-16. Fredrik Bakke. Swap from
md
totext
code blocks (#622). - 2023-03-14. Fredrik Bakke. Remove all unused imports (#502).
- 2023-03-13. Jonathan Prieto-Cubides. More maintenance (#506).
- 2023-03-10. Fredrik Bakke. Additions to
fix-import
(#497).