Witt vectors over a domain #

This file builds to the proof WittVector.instIsDomain, an instance that says if R is an integral domain, then so is 𝕎 R. It depends on the API around iterated applications of WittVector.verschiebung and WittVector.frobenius found in Identities.lean.

The proof sketch goes as follows: any nonzero $x$ is an iterated application of $V$ to some vector $w_x$ whose 0th component is nonzero (WittVector.verschiebung_nonzero). Known identities (WittVector.iterate_verschiebung_mul) allow us to transform the product of two such $x$ and $y$ to the form $V^{m+n}\left(F^n(w_x) \cdot F^m(w_y)\right)$, the 0th component of which must be nonzero.

Main declarations #

WittVector.iterate_verschiebung_mul_coeff : an identity from [Haze09]
WittVector.instIsDomain

The `shift` operator #

source

def WittVector.shift {p : ℕ} {R : Type u_1} (x : WittVector p R) (n : ℕ) :

WittVector p R

WittVector.verschiebung translates the entries of a Witt vector upward, inserting 0s in the gaps. WittVector.shift does the opposite, removing the first entries. This is mainly useful as an auxiliary construction for WittVector.verschiebung_nonzero.

Equations

x.shift n = { coeff := fun (i : ℕ) => x.coeff (n + i) }

Instances For

source

theorem WittVector.shift_coeff {p : ℕ} {R : Type u_1} (x : WittVector p R) (n k : ℕ) :

(x.shift n).coeff k = x.coeff (n + k)

source

theorem WittVector.verschiebung_shift {p : ℕ} {R : Type u_1} [hp : Fact (Nat.Prime p)] [CommRing R] (x : WittVector p R) (k : ℕ) (h : ∀ i < k + 1, x.coeff i = 0) :

verschiebung (x.shift k.succ) = x.shift k

source

theorem WittVector.eq_iterate_verschiebung {p : ℕ} {R : Type u_1} [hp : Fact (Nat.Prime p)] [CommRing R] {x : WittVector p R} {n : ℕ} (h : ∀ i < n, x.coeff i = 0) :

x = (⇑verschiebung)^[n] (x.shift n)

source

theorem WittVector.verschiebung_nonzero {p : ℕ} {R : Type u_1} [hp : Fact (Nat.Prime p)] [CommRing R] {x : WittVector p R} (hx : x ≠ 0) :

∃ (n : ℕ) (x' : WittVector p R), x'.coeff 0 ≠ 0 ∧ x = (⇑verschiebung)^[n] x'