Frobenius windows in π΄ = D(p) β© D([Ο]) #
Give the Witt vectors π R the (p, [Ο])-adic topology and let π΄ β Spa(π R, π R) be the open
subset D(p) β© D([Ο]) (TauCeti.FarguesFontaine.spaY). At a point v β π΄ the radius
ΞΊ(v) is the ratio log v([Ο]) / log v(p). It is a real number only when v has rank one, so it
is never formed here; instead, for a nonnegative rational q = a / b, the bounds
q β€ ΞΊ(v) :β v([Ο]) ^ b β€ v(p) ^ a,
ΞΊ(v) β€ q :β v(p) ^ a β€ v([Ο]) ^ b
are taken as definitions (IsRadiusLowerBound, IsRadiusUpperBound), and are independent of
the chosen fraction. With the breakpoint c = (p + 1) / 2, which satisfies 1 < c < p, the
Frobenius windows are, for every integer n,
U_n = {v β π΄ : p ^ n β€ ΞΊ(v) β€ c p ^ n},
V_n = {v β π΄ : c p ^ n β€ ΞΊ(v) β€ p ^ (n + 1)}.
They are rational subsets of Spa(π R, π R) and cover π΄. Since Frobenius multiplies the
radius by p, pulling back along it carries U_n into U_(n+1) and V_n into V_(n+1), and
different windows in one family are disjoint. Hence the Frobenius iterates act freely on π΄,
and every window is wandering: it meets none of its Frobenius translates. These are the charts
on which the adic FarguesβFontaine curve π΄ / Ο^β€ is built.
Main definitions #
TauCeti.FarguesFontaine.IsRadiusLowerBound,TauCeti.FarguesFontaine.IsRadiusUpperBound: the order-theoretic boundsq β€ ΞΊ(v)andΞΊ(v) β€ q.TauCeti.FarguesFontaine.windowU,TauCeti.FarguesFontaine.windowV: the windowsU_nandV_n.
Main results #
TauCeti.FarguesFontaine.isRadiusLowerBound_iff_of_eq_div: the lower bound may be read off any fraction representingq; likewise for the upper bound.TauCeti.FarguesFontaine.isRadiusLowerBound_comap_frobenius_iff: Frobenius multiplies the radius byp.TauCeti.FarguesFontaine.exists_isRadiusLowerBound_zpow: every point ofπ΄has radius between consecutive powers ofp.TauCeti.FarguesFontaine.iUnion_windowU_union_windowV: the windows coverπ΄.TauCeti.FarguesFontaine.val_preimage_windowU_mem_spaRationalFamilyand itsVanalogue : the windows are rational subsets.TauCeti.FarguesFontaine.isOpen_val_preimage_windowUand itsVanalogue : the windows are open inπ΄.TauCeti.FarguesFontaine.isCompact_val_preimage_windowUand itsVanalogue : the windows are quasi-compact inπ΄.TauCeti.FarguesFontaine.comap_frobenius_mem_windowU_iffand itsVanalogue : Frobenius shifts the window index by one.TauCeti.FarguesFontaine.frobeniusHomeomorph_zpow_mem_windowU_iffand itsVanalogue : integer Frobenius powers shift the window index by the same integer.TauCeti.FarguesFontaine.disjoint_windowUand itsVanalogue : distinct windows in one family are disjoint.TauCeti.FarguesFontaine.iterate_comap_frobenius_ne: the Frobenius iterates act freely onπ΄.TauCeti.FarguesFontaine.disjoint_image_iterate_comap_frobenius_windowUand itsVanalogue : each window is wandering.
References #
- K. S. Kedlaya, Sheaves, stacks, and shtukas, lecture notes, Arizona Winter School 2017,
Β§3.1, for the two families of windows; there the breakpoint may be any rational number
strictly between
1andp, and only1 < c < pis used here. - L. Fargues and J.-M. Fontaine, Courbes et fibrΓ©s vectoriels en thΓ©orie de Hodge p-adique, AstΓ©risque 406 (2018).
Radius bounds #
The lower radius bound q β€ ΞΊ(v) at a point v of Spv (π R): writing q = a / b in
lowest terms, v([Ο]) ^ b β€ v(p) ^ a. Here ΞΊ(v) stands for the ratio log v([Ο]) / log v(p),
which is not formed; isRadiusLowerBound_iff_of_eq_div reads the bound off any fraction.
Equations
- TauCeti.FarguesFontaine.IsRadiusLowerBound p Ο q v = ((WittVector.teichmuller p) Ο ^ q.den β€α΅₯ βp ^ q.num)
Instances For
The upper radius bound ΞΊ(v) β€ q at a point v of Spv (π R): writing q = a / b in
lowest terms, v(p) ^ a β€ v([Ο]) ^ b. isRadiusUpperBound_iff_of_eq_div reads the bound off any
fraction.
Equations
- TauCeti.FarguesFontaine.IsRadiusUpperBound p Ο q v = (βp ^ q.num β€α΅₯ (WittVector.teichmuller p) Ο ^ q.den)
Instances For
The lower radius bound from any fraction: if q = a / b with b β 0, then
q β€ ΞΊ(v) exactly when v([Ο]) ^ b β€ v(p) ^ a.
The upper radius bound from any fraction: if q = a / b with b β 0, then
ΞΊ(v) β€ q exactly when v(p) ^ a β€ v([Ο]) ^ b.
A point that is not a lower bound q β€ ΞΊ(v) satisfies the upper bound ΞΊ(v) β€ q, since the
value group is linearly ordered.
Frobenius multiplies the radius by p, for lower bounds: q β€ ΞΊ(Ο v) exactly when
q / p β€ ΞΊ(v).
Frobenius multiplies the radius by p, for upper bounds: ΞΊ(Ο v) β€ q exactly when
ΞΊ(v) β€ q / p.
Lower radius bounds are closed downwards on Spa(π R, π R): if q β€ ΞΊ(v) and q' β€ q
then q' β€ ΞΊ(v), since v(p) β€ 1.
Upper radius bounds are closed upwards on Spa(π R, π R): if ΞΊ(v) β€ q and q β€ q'
then ΞΊ(v) β€ q', since v(p) β€ 1.
Separation of radius bounds on π΄: at a point of π΄ with q β€ ΞΊ(v), no q' < q is an
upper bound for ΞΊ(v). This uses 0 < v(p) < 1.
The radius lies between consecutive powers of p: every point of π΄ satisfies
p ^ n β€ ΞΊ(v) β€ p ^ (n + 1) for some integer n.
The windows #
The window U_n = {v β π΄ : p ^ n β€ ΞΊ(v) β€ c p ^ n}, with the breakpoint
c = (p + 1) / 2.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The window V_n = {v β π΄ : c p ^ n β€ ΞΊ(v) β€ p ^ (n + 1)}, with the breakpoint
c = (p + 1) / 2.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Membership in U_n: a point of π΄ with p ^ n β€ ΞΊ(v) β€ c p ^ n.
Membership in V_n: a point of π΄ with c p ^ n β€ ΞΊ(v) β€ p ^ (n + 1).
U_n β π΄.
V_n β π΄.
The windows cover π΄: every point of π΄ lies in some U_n or V_n.
U_n is a rational subset of Spa(π R, π R), for the (p, [Ο])-adic topology.
V_n is a rational subset of Spa(π R, π R), for the (p, [Ο])-adic topology.
Each U window is open in π΄.
Each V window is open in π΄.
Each U window is quasi-compact as a subset of π΄.
Each V window is quasi-compact as a subset of π΄.
Frobenius on the windows #
Disjointness of the U windows: U_m β© U_n = β
for m β n, because
c p ^ m < p ^ (m + 1).
Disjointness of the V windows: V_m β© V_n = β
for m β n, because
p ^ (m + 1) < c p ^ (m + 1).
Frobenius shifts the U windows: pulling a point of U_n back along Frobenius gives a
point of U_(n+1).
Frobenius shifts the V windows: pulling a point of V_n back along Frobenius gives a
point of V_(n+1).
Frobenius shifts the U windows exactly: for perfect R, a point lies in U_n exactly
when its pullback along Frobenius lies in U_(n+1).
Frobenius shifts the V windows exactly: for perfect R, a point lies in V_n exactly
when its pullback along Frobenius lies in V_(n+1).
Iterating Frobenius k times carries U_n into U_(n+k).
Iterating Frobenius k times carries V_n into V_(n+k).
The U windows are wandering: a nontrivial Frobenius iterate moves U_n off itself.
The V windows are wandering: a nontrivial Frobenius iterate moves V_n off itself.
Frobenius acts freely on π΄: no nontrivial Frobenius iterate fixes a point of π΄.
An integer Frobenius translate shifts the index of a U window by that integer.
An integer Frobenius translate shifts the index of a V window by that integer.