\newcommand{\cat}[1]{\mathsf{#1}}

\newcommand{\Sets}[0]{{\mathsf{Set}}}
\newcommand{\Set}[0]{{\mathsf{Set}}}
\newcommand{\sets}[0]{{\mathsf{Set}}}
\newcommand{\set}{{\mathsf{Set} }}
\newcommand{\Poset}[0]{\mathsf{Poset}}
\newcommand{\GSets}[0]{{G\dash\mathsf{Set}}}
\newcommand{\Groups}[0]{{\mathsf{Group}}}
\newcommand{\Grp}[0]{{\mathsf{Grp}}}

% Modifiers
\newcommand{\fn}[0]{{\mathsf{fn}}}
\newcommand{\smooth}[0]{{\mathsf{sm}}}
\newcommand{\Aff}[0]{{\mathsf{Aff}}}
\newcommand{\Ab}[0]{{\mathsf{Ab}}}
\newcommand{\Assoc}[0]{\mathsf{Assoc}}
\newcommand{\Ch}[0]{\mathsf{Ch}}
\newcommand{\Coh}[0]{{\mathsf{Coh}}}
\newcommand{\Comm}[0]{\mathsf{Comm}}
\newcommand{\Cor}[0]{{\mathsf{Cor}}}
\newcommand{\Fin}[0]{{\mathsf{Fin}}}
\newcommand{\Free}[0]{\mathsf{Free}}
\newcommand{\Perf}[0]{\mathsf{Perf}}
\newcommand{\Unital}[0]{\mathsf{Unital}}
\newcommand{\eff}[0]{\mathsf{eff}}
\newcommand{\derivedcat}[1]{\mathbf{D} {#1} }
\newcommand{\Cx}[0]{\mathsf{Ch}}
\newcommand{\Stable}[0]{\mathsf{Stab}}
\newcommand{\ChainCx}[1]{\mathsf{Ch}\qty{ #1 } }
\newcommand{\Vect}[0]{{ \mathsf{Vect} }}


% Rings
\newcommand{\Fieldsover}[1]{{ \mathsf{Fields}_{#1} }}
\newcommand{\Field}[0]{\mathsf{Field}}
\newcommand{\Ring}[0]{\mathsf{Ring}}
\newcommand{\CRing}[0]{\mathsf{CRing}}
\newcommand{\DedekindDomain}[0]{\mathsf{DedekindDom}}

% Modules
\newcommand{\modr}[0]{{\mathsf{Mod}\dash\mathsf{R}}}
\newcommand{\modsleft}[1]{\mathsf{#1}\dash\mathsf{Mod}}
\newcommand{\modsright}[1]{\mathsf{Mod}\dash\mathsf{#1}}
\newcommand{\mods}[1]{{\mathsf{#1}\dash\mathsf{Mod}}}
\newcommand{\bimod}[2]{(\mathsf{#1}, \mathsf{#2})\dash\mathsf{biMod}}
\newcommand{\Mod}[0]{{\mathsf{Mod}}}

\newcommand{\zmod}[0]{{\mathbb{Z}\dash\mathsf{Mod}}}
\newcommand{\rmod}[0]{{\mathsf{R}\dash\mathsf{Mod}}}
\newcommand{\kmod}[0]{{\mathsf{k}\dash\mathsf{Mod}}}
\newcommand{\gmod}[0]{{\mathsf{G}\dash\mathsf{Mod}}}
\newcommand{\grMod}[0]{{\mathsf{grMod}}}
\newcommand{\gr}[0]{{\mathsf{gr}\,}}
\newcommand{\mmod}[0]{{\dash\mathsf{Mod}}}
\newcommand{\Rep}[0]{{\mathsf{Rep}}}

% Vector Spaces and Bundles
\newcommand{\VectBundle}[0]{{ \Bun_{\GL_r} }}
\newcommand{\VectBundlerk}[1]{{ \Bun_{\GL_{#1}} }}
\newcommand{\VectSp}[0]{{ \VectSp }}
\newcommand{\VectBun}[0]{{ \VectBundle }}
\newcommand{\VectBunrk}[1]{{ \VectBundlerk{#1} }}


% Algebras
\newcommand{\alg}[0]{\mathsf{Alg}}
\newcommand{\Alg}[0]{{\mathsf{Alg}}}
\newcommand{\scalg}[0]{\mathsf{sCAlg}}
\newcommand{\cAlg}[0]{{\mathsf{cAlg}}}
\newcommand{\calg}[0]{\mathsf{CAlg}}
\newcommand{\liegmod}[0]{{\mathfrak{g}\dash\mathsf{Mod}}}
\newcommand{\liealg}[0]{{\mathsf{Lie}\dash\mathsf{Alg}}}
\newcommand{\kalg}[0]{{\mathsf{Alg}_{/k} }}
\newcommand{\kAlg}[0]{{\mathsf{Alg}_{/k} }}
\newcommand{\kSch}[0]{{\mathsf{Sch}_{/k}}}
\newcommand{\rAlg}[0]{{\mathsf{Alg}_{/R}}}
\newcommand{\ralg}[0]{{\mathsf{Alg}_{/R}}}
\newcommand{\CCalg}[0]{{\mathsf{Alg}_{\mathbb{C}} }}
\newcommand{\cdga}[0]{{\mathsf{cdga} }}

% Schemes and Sheaves
\newcommand{\Ringedspace}[0]{\mathsf{RingSp}}
\newcommand{\DCoh}[0]{{\mathsf{DCoh}}}
\newcommand{\QCoh}[0]{{\mathsf{QCoh}}}
\newcommand{\Cov}[0]{{\mathsf{Cov}}}
\newcommand{\sch}[0]{{\mathsf{Sch}}}
\newcommand{\presh}[0]{ \underset{ \mathsf{pre} } {\mathsf{Sh} }}
\newcommand{\Descent}[0]{{\mathsf{Descent}}}
\newcommand{\Desc}[0]{{\mathsf{Desc}}}
\newcommand{\FFlat}[0]{{\mathsf{FFlat}}}
\newcommand{\Perv}[0]{\mathsf{Perv}}
\newcommand{\smsch}[0]{{ \smooth\Sch }}
\newcommand{\Sch}[0]{{\mathsf{Sch}}}
\newcommand{\Schf}[0]{{\mathsf{Schf}}}
\newcommand{\Sh}[0]{{\mathsf{Sh}}}
\newcommand{\St}[0]{{\mathsf{Stack}}}
\newcommand{\Vark}[0]{{\mathsf{Var}_{/k} }}
\newcommand{\Var}[0]{{\mathsf{Var}}}

% Homotopy
\newcommand{\CW}[0]{{\mathsf{CW}}}
\newcommand{\sSet}[0]{{\mathsf{sSet}}}
\newcommand{\ssets}[0]{\mathsf{sSet}}
\newcommand{\hoTop}[0]{{\mathsf{hoTop}}}
\newcommand{\hoType}[0]{{\mathsf{hoType}}}
\newcommand{\ho}[0]{{\mathsf{ho}}}
\newcommand{\SHC}[0]{{\mathsf{SHC}}}
\newcommand{\SH}[0]{{\mathsf{SH}}}
\newcommand{\Spaces}[0]{{\mathsf{Spaces}}}
\newcommand{\Spectra}[0]{{\mathsf{Sp}}}
\newcommand{\Sp}[0]{{\mathsf{Sp}}}
\newcommand{\Top}[0]{{\mathsf{Top}}}

% Infty Cats
\newcommand{\Finset}[0]{{\mathsf{FinSet}}}
\newcommand{\Cat}[0]{\mathsf{Cat}}
\newcommand{\Grpd}[0]{{\mathsf{Grpd}}}
\newcommand{\inftyGrpd}[0]{{\infty\dash\mathsf{Grpd}}}
\newcommand{\Fun}[0]{{\mathsf{Fun}}}
\newcommand{\Kan}[0]{{\mathsf{Kan}}}
\newcommand{\Monoid}[0]{\mathsf{Mon}}

% New?
\newcommand{\Prism}[0]{\mathsf{Prism}}
\newcommand{\Solid}[0]{\mathsf{Solid}}
\newcommand{\WCart}[0]{\mathsf{WCart}}

% Motivic
\newcommand{\Torsor}[1]{{\mathsf{#1}\dash\mathsf{Torsor}}}
\newcommand{\Torsorleft}[1]{{\mathsf{#1}\dash\mathsf{Torsor}}}
\newcommand{\Torsorright}[1]{{\mathsf{Torsor}\dash\mathsf{#1} }}
\newcommand{\Quadform}[0]{{\mathsf{QuadForm}}}
\newcommand{\HI}[0]{{\mathsf{HI}}}
\newcommand{\DM}[0]{{\mathsf{DM}}}
\newcommand{\hoA}[0]{{\mathsf{ho}_*^{\scriptstyle \AA^1}}}

% Unsorted
\newcommand{\FGL}[0]{\mathsf{FGL}}
\newcommand{\FI}[0]{{\mathsf{FI}}}
\newcommand{\Fuk}[0]{{\mathsf{Fuk}}}
\newcommand{\Lag}[0]{{\mathsf{Lag}}}
\newcommand{\Mfd}[0]{{\mathsf{Mfd}}}
\newcommand{\Riem}[0]{\mathsf{Riem}}
\newcommand{\Wein}[0]{{\mathsf{Wein}}}
\newcommand{\dgens}[1]{\gens{\gens{ #1 }}}
\newcommand{\ctz}[1]{\, {\converges{{#1} \to\infty}\longrightarrow 0} \, }
\newcommand{\conj}[1]{{\overline{{#1}}}}
\newcommand{\complex}[1]{{#1}_{*}}

\newcommand{\floor}[1]{{\left\lfloor #1 \right\rfloor}}
\newcommand{\fourier}[1]{\widehat{#1}}
\newcommand{\embedsvia}[1]{\xhookrightarrow{#1}}
\newcommand{\openimmerse}[0]{\underset{\scriptscriptstyle O}{\hookrightarrow}}
\newcommand{\weakeq}[0]{\underset{\scriptscriptstyle W}{\rightarrow}}

\newcommand{\fromvia}[1]{\xleftarrow{#1}}
\newcommand{\generators}[1]{\left\langle{#1}\right\rangle}
\newcommand{\gens}[1]{\left\langle{#1}\right\rangle}
\newcommand{\globsec}[1]{{\mathsf{\Gamma}\qty{#1} }}

\newcommand{\equalsbecause}[1]{\overset{#1}{=}}
\newcommand{\congbecause}[1]{\overset{#1}{\cong}}
\newcommand{\congas}[1]{\underset{#1}{\cong}}
\newcommand{\isoas}[1]{\underset{#1}{\cong}}
\newcommand{\addbase}[1]{{ {}_{\pt} }}
\newcommand{\ideal}[1]{\mathcal{#1}}
\newcommand{\adjoin}[1]{ { \left[ {#1} \right] } }
\newcommand{\powerseries}[1]{ { \left[ {#1} \right] } }
\newcommand{\htyclass}[1]{ { \left[ {#1} \right] } }
\newcommand{\formalpowerseries}[1]{ { \left[\left[ {#1} \right] \right] } }
\newcommand{\formalseries}[1]{ { \left[\left[ {#1} \right] \right] } }
\newcommand{\qtext}[1]{{\quad \operatorname{#1} \quad}}
\newcommand{\abs}[1]{{\left\lvert {#1} \right\rvert}}
\newcommand{\stack}[1]{\mathclap{\substack{ #1 }}} 

\newcommand\TAF{ \mathrm{TAF} }
\newcommand\TMF{ \mathrm{TMF} }

\newcommand{\BO}[0]{{\operatorname{BO}}}
\newcommand{\BP}[0]{{\operatorname{BP}}}
\newcommand{\BU}[0]{{\operatorname{BU}}}

\newcommand{\MO}[0]{{\operatorname{MO}}}
\newcommand{\MSO}[0]{{\operatorname{MSO}}}
\newcommand{\MSpin}[0]{{\operatorname{MSpin}}}
\newcommand{\MSp}[0]{{\operatorname{MSpin}}}
\newcommand{\MString}[0]{{\operatorname{MString}}}
\newcommand{\MStr}[0]{{\operatorname{MString}}}
\newcommand{\MU}[0]{{\operatorname{MU}}}


\newcommand{\KO}[0]{{\operatorname{KO}}}
\newcommand{\KU}[0]{{\operatorname{KU}}}

\newcommand{\smashprod}[0]{\wedge}

\newcommand{\ku}[0]{{\operatorname{ku}}}
\newcommand{\hofib}[0]{{\operatorname{hofib}}}
\newcommand{\hocofib}[0]{{\operatorname{hocofib}}}
\newcommand*\dif{\mathop{}\!\operatorname{d}}
\newcommand*{\horzbar}{\rule[.5ex]{2.5ex}{0.5pt}}
\newcommand*{\vertbar}{\rule[-1ex]{0.5pt}{2.5ex}}
\newcommand\Fix{ \mathrm{Fix} }
\newcommand\Kahler[0]{\operatorname{Kähler}}
\newcommand\Prinbun{\mathrm{Bun}^{\mathrm{prin}}}
\newcommand\aug{\fboxsep=-\fboxrule\!\!\!\fbox{\strut}\!\!\!}
\newcommand\compact[0]{\operatorname{cpt}}
\newcommand\hyp[0]{{\operatorname{hyp}}}
\newcommand\jan{\operatorname{Jan}}
\newcommand\kbar{ { \bar{k} } }
\newcommand\ksep{ { k\sep } }
\newcommand\mypound{\scalebox{0.8}{\raisebox{0.4ex}{\#}}}
\newcommand\rref{\operatorname{RREF}}
\newcommand{\Tatesymbol}{\operatorname{TateSymb}}
\newcommand\taf{ \mathrm{taf} }
\newcommand\tilt[0]{ { \flat } }
\newcommand\tmf{ \mathrm{tmf} }
\newcommand\vecc[2]{\textcolor{#1}{\textbf{#2}}}
\newcommand{\Af}[0]{{\mathbb{A}}}
\newcommand{\Ag}[0]{{\mathcal{A}_g}}
\newcommand{\Ahat}[0]{\hat{ \operatorname{A}}_g }
\newcommand{\Ann}[0]{\operatorname{Ann}}
\newcommand{\Arg}[0]{\operatorname{Arg}}
\newcommand{\Art}[0]{\operatorname{Art}}
\newcommand{\BB}[0]{{\mathbb{B}}}
\newcommand{\Betti}[0]{{\operatorname{Betti}}}
\newcommand{\CC}[0]{{\mathbb{C}}}
\newcommand{\CF}[0]{\operatorname{CF}}
\newcommand{\CH}[0]{{\operatorname{CH}}}
\newcommand{\CP}[0]{{\mathbb{CP}}}
\newcommand{\CY}{{ \text{CY} }}
\newcommand{\Cl}[0]{{ \operatorname{Cl}} }
\newcommand{\Crit}[0]{\operatorname{Crit}}
\newcommand{\DD}[0]{{\mathbb{D}}}
\newcommand{\DSt}[0]{{ \operatorname{DSt}}}
\newcommand{\Def}{\operatorname{Def} }
\newcommand{\Diffeo}[0]{{\operatorname{Diffeo}}}
\newcommand{\Diff}[0]{\operatorname{Diff}}
\newcommand{\Disjoint}[0]{\displaystyle\coprod}
\newcommand{\Disk}[0]{{\operatorname{Disk}}}
\newcommand{\Dist}[0]{\operatorname{Dist}}
\newcommand{\Div}[0]{\operatorname{Div}}
\newcommand{\EE}[0]{{\mathbb{E}}}
\newcommand{\EKL}[0]{{\mathrm{EKL}}}
\newcommand{\EO}[0]{{\operatorname{EO}}}
\newcommand{\Emb}[0]{{\operatorname{Emb}}}
\newcommand{\minor}[0]{{\operatorname{minor}}}
\newcommand{\Et}{\text{Ét}}
\newcommand{\trace}{\operatorname{tr}}
\newcommand{\Extpower}[0]{\bigwedge\nolimits}
\newcommand{\Extalgebra}[0]{\bigwedge\nolimits}
\newcommand{\Extalg}[0]{\Extalgebra}
\newcommand{\Extprod}[0]{\bigwedge\nolimits}
\newcommand{\Ext}{\operatorname{Ext} }
\newcommand{\FFbar}[0]{{ \bar{ \mathbb{F}} }}
\newcommand{\FFpn}[0]{{\mathbb{F}_{p^n}}}
\newcommand{\FFp}[0]{{\mathbb{F}_p}}
\newcommand{\FF}[0]{{\mathbb{F}}}
\newcommand{\FS}{{ \text{FS} }}
\newcommand{\Fil}[0]{{\operatorname{Fil}}}
\newcommand{\Flat}[0]{{\operatorname{Flat}}}
\newcommand{\Fpbar}[0]{\bar{\mathbb{F}_p}}
\newcommand{\Fpn}[0]{{\mathbb{F}_{p^n} }}
\newcommand{\Fppf}[0]{\mathrm{\operatorname{Fppf}}}
\newcommand{\Fp}[0]{{\mathbb{F}_p}}
\newcommand{\Frac}[0]{\operatorname{Frac}}
\newcommand{\GF}[0]{{\mathbb{GF}}}
\newcommand{\GG}[0]{{\mathbb{G}}}
\newcommand{\GL}[0]{\operatorname{GL}}
\newcommand{\GW}[0]{{\operatorname{GW}}}
\newcommand{\Gal}[0]{{ \mathsf{Gal}} }
\newcommand{\Gl}[0]{\operatorname{GL}}
\newcommand{\Gr}[0]{{\operatorname{Gr}}}
\newcommand{\HC}[0]{{\operatorname{HC}}}
\newcommand{\HFK}[0]{\operatorname{HFK}}
\newcommand{\HF}[0]{\operatorname{HF}}
\newcommand{\HHom}{\mathscr{H}\kern-2pt\operatorname{om}}
\newcommand{\HH}[0]{{\mathbb{H}}}
\newcommand{\HP}[0]{{\operatorname{HP}}}
\newcommand{\HT}[0]{{\operatorname{HT}}}
\newcommand{\HZ}[0]{{H\mathbb{Z}}}
\newcommand{\Hilb}[0]{\operatorname{Hilb}}
\newcommand{\Homeo}[0]{{\operatorname{Homeo}}}
\newcommand{\Honda}[0]{\mathrm{\operatorname{Honda}}}
\newcommand{\Hsh}{{ \mathcal{H} }}
\newcommand{\Id}[0]{\operatorname{Id}}
\newcommand{\Inn}[0]{{\operatorname{Inn}}}
\newcommand{\Intersect}[0]{\displaystyle\bigcap}
\newcommand{\JCF}[0]{\mathrm{JCF}}
\newcommand{\Jac}[0]{\operatorname{Jac}}
\newcommand{\KK}[0]{{\mathbb{K}}}
\newcommand{\KH}[0]{ \K^{\scriptscriptstyle \mathrm{H}} }
\newcommand{\KMW}[0]{ \K^{\scriptscriptstyle \mathrm{MW}} }
\newcommand{\KMimp}[0]{ \hat{\K}^{\scriptscriptstyle \mathrm{M}} }
\newcommand{\KM}[0]{ \K^{\scriptstyle\mathrm{M}} }
\newcommand{\Kah}[0]{{ \operatorname{Kähler} } }
\newcommand{\LC}[0]{{\mathrm{LC}}}
\newcommand{\LL}[0]{{\mathbb{L}}}
\newcommand{\Lie}[0]{\operatorname{Lie}}
\newcommand{\Log}[0]{\operatorname{Log}}
\newcommand{\MCG}[0]{{\operatorname{MCG}}}
\newcommand{\MM}[0]{{\mathcal{M}}}
\newcommand{\MW}[0]{\operatorname{MW}}
\newcommand{\Mat}[0]{\operatorname{Mat}}
\newcommand{\Mor}[0]{\operatorname{Mor}}
\newcommand{\NN}[0]{{\mathbb{N}}}
\newcommand{\NS}[0]{{\operatorname{NS}}}
\newcommand{\OO}[0]{{\mathcal{O}}}
\newcommand{\OP}[0]{{\mathbb{OP}}}
\newcommand{\OX}[0]{{\mathcal{O}_X}}
\newcommand{\Obs}{\operatorname{Obs} }
\newcommand{\Ob}[0]{{\operatorname{Ob}}}
\newcommand{\Op}[0]{{\operatorname{Op}}}
\newcommand{\Orb}[0]{{\mathrm{Orb}}}
\newcommand{\Orth}[0]{{\operatorname{O}}}
\newcommand{\Out}[0]{{\operatorname{Out}}}
\newcommand{\PD}[0]{\mathrm{PD}}
\newcommand{\PGL}[0]{\operatorname{PGL}}
\newcommand{\PP}[0]{{\mathbb{P}}}
\newcommand{\PSL}[0]{{\operatorname{PSL}}}
\newcommand{\Pic}[0]{{\operatorname{Pic}}}
\newcommand{\Pin}[0]{{\operatorname{Pin}}}
\newcommand{\Places}[0]{{\operatorname{Places}}}
\newcommand{\Presh}[0]{\presh}
\newcommand{\QHB}[0]{\operatorname{QHB}}
\newcommand{\QHS}[0]{\operatorname{QHS}}
\newcommand{\QQpadic}[0]{{ \QQ_p }}
\newcommand{\QQ}[0]{{\mathbb{Q}}}
\newcommand{\Quot}[0]{\operatorname{Quot}}
\newcommand{\RP}[0]{{\mathbb{RP}}}
\newcommand{\RR}[0]{{\mathbb{R}}}
\newcommand{\Rat}[0]{\operatorname{Rat}}
\newcommand{\Rees}[0]{{\operatorname{Rees}}}
\newcommand{\Reg}[0]{\operatorname{Reg}}
\newcommand{\Ric}[0]{\operatorname{Ric}}
\newcommand{\SF}[0]{\operatorname{SF}}
\newcommand{\SL}[0]{{\operatorname{SL}}}
\newcommand{\SNF}[0]{\mathrm{SNF}}
\newcommand{\SO}[0]{{\operatorname{SO}}}
\newcommand{\SP}[0]{{\operatorname{SP}}}
\newcommand{\SU}[0]{{\operatorname{SU}}}
\newcommand{\Sgn}[0]{{ \Sigma_{g, n} }}
\newcommand{\Sing}[0]{{\operatorname{Sing}}}
\newcommand{\Sm}[0]{{\operatorname{Sm}}}
\newcommand{\SpSp}[0]{{\mathbb{S}}}
\newcommand{\Spec}[0]{\operatorname{Spec}}
\newcommand{\Spf}[0]{\operatorname{Spf}}
\newcommand{\Spinc}[0]{\mathrm{Spin}^{{c} }}
\newcommand{\Spin}[0]{{\operatorname{Spin}}}
\newcommand{\Sq}[0]{\operatorname{Sq}}
\newcommand{\Stab}[0]{{\operatorname{Stab}}}
\newcommand{\Sum}[0]{ \displaystyle\sum }
\newcommand{\Syl}[0]{{\operatorname{Syl}}}
\newcommand{\Sym}[0]{\operatorname{Sym}}
\newcommand{\Tensor}[0]{\bigotimes}
\newcommand{\Tor}[0]{\operatorname{Tor}}
\newcommand{\Tr}[0]{\operatorname{Tr}}
\newcommand{\Ug}[0]{{\mathcal{U}(\mathfrak{g}) }}
\newcommand{\Uh}[0]{{\mathcal{U}(\mathfrak{h}) }}
\newcommand{\Union}[0]{\displaystyle\bigcup}
\newcommand{\U}[0]{{\operatorname{U}}}
\newcommand{\Wedge}[0]{\bigwedge}
\newcommand{\Wittvectors}[0]{{\mathbb{W}}}
\newcommand{\ZHB}[0]{\operatorname{ZHB}}
\newcommand{\ZHS}[0]{\mathbb{Z}\operatorname{HS}}
\newcommand{\ZZG}[0]{{\mathbb{Z}G}}
\newcommand{\ZZH}[0]{{\mathbb{Z}H}}
\newcommand{\ZZlocal}[1]{{ \ZZ_{\hat{#1}} }}
\newcommand{\ZZpadic}[0]{{ \ZZ_p }}
\newcommand{\ZZ}[0]{{\mathbb{Z}}}
\newcommand{\Zar}[0]{{\mathrm{Zar}}}
\newcommand{\ZpZ}[0]{\mathbb{Z}/p}
\newcommand{\abuts}[0]{\Rightarrow}
\newcommand{\ab}[0]{{\operatorname{ab}}}
\newcommand{\actsonl}[0]{\curvearrowleft}
\newcommand{\actson}[0]{\curvearrowright}
\newcommand{\adjoint}[0]{\leftrightarrows}
\newcommand{\adj}[0]{\operatorname{adj}}
\newcommand{\ad}[0]{\operatorname{ad}}
\newcommand{\afp}[0]{A_{/\FF_p}}
\newcommand{\annd}[0]{{\operatorname{ and }}}
\newcommand{\ann}[0]{\operatorname{Ann}}
\newcommand{\arccot}[0]{\operatorname{arccot}}
\newcommand{\arccsc}[0]{\operatorname{arccsc}}
\newcommand{\arcsec}[0]{\operatorname{arcsec}}
\newcommand{\aut}[0]{\operatorname{Aut}}
\newcommand{\bP}[0]{\operatorname{bP}}
\newcommand{\barz}{\bar{z} }
\newcommand{\bbm}[0]{{\mathbb{M}}}
\newcommand{\bd}[0]{{\del}}
\newcommand{\bigast}[0]{{\mathop{\text{\Large $\ast$}}}}
\newcommand{\bmgn}[0]{{ \bar{\mathcal{M}}_{g, n} }}
\newcommand{\bundle}[1]{\mathcal{#1}}
\newcommand{\Bun}{{\mathsf{Bun}}}
\newcommand{\bung}{{\mathsf{Bun}_G}}
\newcommand{\by}[0]{\times}
\newcommand{\candim}[0]{\operatorname{candim}}
\newcommand{\chp}[0]{\operatorname{ch. p}}
\newcommand{\ch}[0]{\operatorname{ch}}
\newcommand{\cl}[0]{{ \operatorname{cl}} }
\newcommand{\codim}[0]{\operatorname{codim}}
\newcommand{\cohdim}[0]{\operatorname{cohdim}}
\newcommand{\coim}[0]{\operatorname{coim}}
\newcommand{\coker}[0]{\operatorname{coker}}
\newcommand{\cok}[0]{\operatorname{coker}}
\newcommand{\cone}[0]{\operatorname{cone}}
\newcommand{\conjugate}[1]{{\overline{{#1}}}}
\newcommand{\connectsum}[0]{\mathop{ \Large\mypound }}
\newcommand{\const}[0]{{\operatorname{const.}}}
\newcommand{\converges}[1]{\overset{#1}}
\newcommand{\convolve}[0]{\ast}
\newcommand{\correspond}[1]{\theset{\substack{#1}}}
\newcommand{\covers}[0]{\rightrightarrows}
\newcommand{\covol}[0]{\operatorname{covol}}
\newcommand{\cpt}[0]{{ \operatorname{compact} } }
\newcommand{\crit}[0]{\operatorname{crit}}
\newcommand{\cross}[0]{\times}
\newcommand{\dR}[0]{\mathrm{dR}}
\newcommand{\dV}{\,dV}
\newcommand{\dash}[0]{{\hbox{-}}}
\newcommand{\da}[0]{\coloneqq}
\newcommand{\ddd}[2]{{\frac{d #1}{d #2}\,}}
\newcommand{\ddim}[0]{\operatorname{ddim}}
\newcommand{\ddt}{\tfrac{\dif}{\dif t}}
\newcommand{\ddx}{\tfrac{\dif}{\dif x}}
\newcommand{\dd}[2]{{\frac{\partial #1}{\partial #2}\,}}
\newcommand{\decreasesto}[0]{\searrow}
\newcommand{\definedas}[0]{\coloneqq}
\newcommand{\del}[0]{{\partial}}
\newcommand{\diagonal}[1]{\Delta}
\newcommand{\diag}[0]{\operatorname{diag}}
\newcommand{\diam}[0]{{\operatorname{diam}}}
\newcommand{\diff}[0]{\operatorname{Diff}}
\newcommand{\directlim}[0]{\varinjlim}
\newcommand{\discriminant}[0]{{\Delta}}
\newcommand{\disc}[0]{{\operatorname{disc}}}
\newcommand{\disjoint}[0]{{\textstyle\coprod}}
\newcommand{\dist}[0]{\operatorname{dist}}
\newcommand{\dlog}[0]{\operatorname{dLog}}
\newcommand{\dmu}{\,d\mu}
\newcommand{\dom}[0]{\operatorname{dom}}
\newcommand{\dr}{\,dr}
\newcommand{\ds}{\,ds}
\newcommand{\dtheta}{\,d\theta}
\newcommand{\dt}{\,dt}
\newcommand{\dual}[0]{ {}^{ \vee }}
\newcommand{\du}{\,du}
\newcommand{\dw}{\,dw}
\newcommand{\dxi}{\,d\xi}
\newcommand{\dx}{\,dx}
\newcommand{\dy}{\,dy}
\newcommand{\dzbar}{\,d\bar{z} }
\newcommand{\dzeta}{\,d\zeta}
\newcommand{\dz}{\,dz}
\newcommand{\embeds}[0]{\hookrightarrow}
\newcommand{\eo}[0]{{\operatorname{eo}}}
\newcommand{\eps}[0]{{\varepsilon}}
\newcommand{\essdim}[0]{\operatorname{essdim}}
\newcommand{\et}{\text{ét}}
\newcommand{\eul}[0]{{\operatorname{eul}}}
\newcommand{\evalfrom}[0]{\Big|}
\newcommand{\ext}{\operatorname{Ext} }
\newcommand{\ff}[0]{\operatorname{ff}}
\newcommand{\fppf}[0]{\mathrm{\operatorname{fppf}}}
\newcommand{\fpqc}[0]{\mathrm{\operatorname{fpqc}}}
\newcommand{\fp}[0]{\operatorname{fp}}
\newcommand{\fqr}[0]{{\mathbb{F}_{q^r}}}
\newcommand{\fq}[0]{{\mathbb{F}_{q}}}
\newcommand{\freeprod}[0]{\ast}
\newcommand{\from}[0]{\leftarrow}
\newcommand{\gal}[0]{{ \operatorname{Gal}} }
\newcommand{\gl}[0]{{\mathfrak{gl}}}
\newcommand{\gp}[0]{ {\operatorname{gp} } }
\newcommand{\grad}[0]{\operatorname{grad}}
\newcommand{\grdim}[0]{{\operatorname{gr\,dim}}}
\newcommand{\height}[0]{\operatorname{ht}}
\newcommand{\homotopic}[0]{\simeq}
\newcommand{\id}[0]{\operatorname{id}}
\newcommand{\im}[0]{\operatorname{im}}
\newcommand{\increasesto}[0]{\nearrow}
\newcommand{\inftycat}[0]{{ \underset{\infty}{ \Cat}  }}
\newcommand{\injectivelim}[0]{\varinjlim}
\newcommand{\injects}[0]{\hookrightarrow}
\newcommand{\inner}[2]{{\left\langle {#1},~{#2} \right\rangle}}
\newcommand{\interior}[0]{^\circ}
\newcommand{\intersect}[0]{\cap}
\newcommand{\into}[0]{\to}
\newcommand{\inverselim}[0]{\varprojlim}
\newcommand{\inv}[0]{^{-1}}
\newcommand{\ip}[2]{{\left\langle {#1},~{#2} \right\rangle}}
\newcommand{\isomorphic}{{ \, \mapsvia{\sim}\, }}
\newcommand{\iso}{{ \isomorphic  }}
\newcommand{\kG}[0]{{kG}}
\newcommand{\kfq}[0]{K_{/\mathbb{F}_q}}
\newcommand{\kk}[0]{{\mathbb{k}}}
\newcommand{\ko}[0]{{\operatorname{ko}}}
\newcommand{\krulldim}[0]{\operatorname{krulldim}}
\newcommand{\ks}[0]{\operatorname{ks}}
\newcommand{\kxn}[0]{k[x_1, \cdots, x_{n}]}
\newcommand{\kx}[1]{k[x_1, \cdots, x_{#1}]}
\newcommand{\lci}[0]{\mathrm{lci}}
\newcommand{\lcm}[0]{\operatorname{lcm}}
\newcommand{\liealgk}[0]{{ \liealg_{/k} }}
\newcommand{\lieb}[0]{{\mathfrak{b}}}
\newcommand{\lied}[0]{{\mathfrak{d}}}
\newcommand{\lief}[0]{{\mathfrak{f}}}
\newcommand{\liegl}[0]{{\mathfrak{gl}}}
\newcommand{\lieg}[0]{{\mathfrak{g}}}
\newcommand{\lieh}[0]{{\mathfrak{h}}}
\newcommand{\liel}[0]{{\mathfrak{l}}}
\newcommand{\lien}[0]{{\mathfrak{n}}}
\newcommand{\lieo}[0]{{\mathfrak{o}}}
\newcommand{\lier}[0]{{\mathfrak{r}}}
\newcommand{\liesl}[0]{{\mathfrak{sl}}}
\newcommand{\lieso}[0]{{\mathfrak{so}}}
\newcommand{\liesp}[0]{{\mathfrak{sp}}}
\newcommand{\liet}[0]{{\mathfrak{t}}}
\newcommand{\lieu}[0]{{\mathfrak{u}}}
\newcommand{\lk}[0]{\operatorname{lk}}
\newcommand{\loc}[0]{{\mathsf{loc}}}
\newcommand{\mTHH}[0]{{\operatorname{THH}}}
\newcommand{\mHH}[0]{{\operatorname{HH}}}
\newcommand{\TCH}[0]{{\operatorname{TCH}}}
\newcommand{\TC}[0]{{\operatorname{TC}}}
\newcommand{\THC}[0]{{\operatorname{THC}}}
\newcommand{\THoH}[0]{{\operatorname{THH}}}
\newcommand{\HoH}[0]{{\operatorname{HH}}}
\newcommand{\TP}[0]{{\operatorname{TP}}}
\newcommand{\TT}[0]{{\mathbb{T}}}
\newcommand{\mapscorrespond}[2]{\mathrel{\operatorname*{\rightleftharpoons}_{#2}^{#1}}}
\newcommand{\mapstofrom}[0]{\rightleftharpoons}
\newcommand{\mapstovia}[1]{\xmapsto{#1}}
\newcommand{\mapsvia}[1]{\xrightarrow{#1}}
\newcommand{\injectsvia}[1]{\xhookrightarrow{#1}}
\newcommand{\injectsfromvia}[1]{\xhookleftarrow{#1}}
\newcommand{\maps}[0]{\operatorname{Maps}}
\newcommand{\mat}[0]{\operatorname{Mat}}
\newcommand{\maxspec}[0]{{\operatorname{maxSpec}}}
\newcommand{\mcTop}[0]{\mathcal{T}\mathsf{op}}
\newcommand{\mca}[0]{{\mathcal{A}}}
\newcommand{\mcb}[0]{{\mathcal{B}}}
\newcommand{\mcc}[0]{{\mathcal{C}}}
\newcommand{\mcd}[0]{{\mathcal{D}}}
\newcommand{\mce}[0]{{\mathcal{E}}}
\newcommand{\mcf}[0]{{\mathcal{F}}}
\newcommand{\mcg}[0]{{\mathcal{G}}}
\newcommand{\mch}[0]{{\mathcal{H}}}
\newcommand{\mci}[0]{{\mathcal{I}}}
\newcommand{\mcj}[0]{{\mathcal{J}}}
\newcommand{\mck}[0]{{\mathcal{K}}}
\newcommand{\mcl}[0]{{\mathcal{L}}}
\newcommand{\mcm}[0]{{\mathcal{M}}}
\newcommand{\mcp}[0]{{\mathcal{P}}}
\newcommand{\mcs}[0]{{\mathcal{S}}}
\newcommand{\mct}[0]{{\mathcal{T}}}
\newcommand{\mcu}[0]{{\mathcal{U}}}
\newcommand{\mcv}[0]{{\mathcal{V}}}
\newcommand{\mcx}[0]{{\mathcal{X}}}
\newcommand{\mcz}[0]{{\mathcal{Z}}}
\newcommand{\mfa}[0]{{\mathfrak{a}}}
\newcommand{\mfb}[0]{{\mathfrak{b}}}
\newcommand{\mfc}[0]{{\mathfrak{c}}}
\newcommand{\mff}[0]{{\mathfrak{f}}}
\newcommand{\mfi}[0]{{\mathfrak{I}}}
\newcommand{\mfm}[0]{{\mathfrak{m}}}
\newcommand{\mfn}[0]{{\mathfrak{n}}}
\newcommand{\mfp}[0]{{\mathfrak{p}}}
\newcommand{\mfq}[0]{{\mathfrak{q}}}
\newcommand{\mfr}[0]{{\mathfrak{r}}}
\newcommand{\mfs}[0]{{\mathfrak{s}}}
\newcommand{\mgn}[0]{{ \mathcal{M}_{g, n} }}
\newcommand{\minpoly}[0]{{\operatorname{minpoly}}}
\newcommand{\mltext}[1]{\left\{\begin{array}{c}#1\end{array}\right\}}
\newcommand{\mm}[0]{{\mathfrak{m}}}
\newcommand{\mot}[0]{{ \mathrm{mot}} }
\newcommand{\cell}[0]{{ \mathrm{cell}} }
\newcommand{\mspec}[0]{\operatorname{mSpec}}
\newcommand{\ms}[0]{\xrightarrow{\sim}}
\newcommand{\multinomial}[1]{\left(\!\!{#1}\!\!\right)}
\newcommand{\mult}[0]{{\operatorname{mult}}}
\newcommand{\mveq}[0]{{\mapsvia{\sim}}} 
\newcommand{\mviso}[0]{{\mapsvia{\sim}}} 
\newcommand{\nd}[0]{\operatorname{nd}}
\newcommand{\nilrad}[1]{{\sqrt{0_{#1}} }}
\newcommand{\nil}[0]{{\operatorname{nil}}}
\newcommand{\noeth}[0]{\mathrm{Noeth}}
\newcommand{\nonzero}[0]{^{\bullet}}
\newcommand{\normalneq}{\mathrel{\reflectbox{$\trianglerightneq$}}}
\newcommand{\normal}[0]{{~\trianglelefteq~}}
\newcommand{\norm}[1]{{\left\lVert {#1} \right\rVert}}
\newcommand{\notimplies}[0]{\centernot\implies}
\newcommand{\onto}[0]{\twoheadhthtarrow}
\newcommand{\open}[1]{\overset{\circ}{#1}}
\newcommand{\op}[0]{^{\operatorname{op}}}
\newcommand{\ord}[0]{{\operatorname{Ord}}}
\newcommand{\oriented}[0]{{ \operatorname{oriented} } }
\newcommand{\orr}[0]{{\operatorname{ or }}}
\newcommand{\padic}[0]{p\dash\text{adic}}
\newcommand{\pic}[0]{{\operatorname{Pic}}}
\newcommand{\pnorm}[2]{{\left\lVert {#1} \right\rVert}_{#2}}
\newcommand{\poly}[0]{\mathrm{poly}}
\newcommand{\prim}[0]{{\operatorname{prim}}}
\newcommand{\projectivelim}[0]{\varprojlim}
\newcommand{\pr}[0]{{\operatorname{pr}}}
\newcommand{\pt}[0]{{\operatorname{pt}}}
\newcommand{\qc}[0]{{\operatorname{qc}}}
\newcommand{\qst}[0]{{\quad \operatorname{such that} \quad}}
\newcommand{\rank}[0]{\operatorname{rank}}
\newcommand{\realpart}[1]{{\mathcal{Re}({#1})}}
\newcommand{\red}[0]{{ \text{red} }}
\newcommand{\reg}[0]{\mathrm{reg}}
\newcommand{\reldim}[0]{\operatorname{reldim}}
\newcommand{\restrictionof}[2]{ {\left.{{#1}} \right|_{{#2}} } }
\newcommand{\rk}[0]{{\operatorname{rank}}}
\newcommand{\rotate}[2]{{\style{display: inline-block; transform: rotate(#1deg)}{#2}}}
\newcommand{\ro}[2]{{ \left.{{#1}} \right|_{{#2}} }}
\newcommand{\selfmap}[0]{{\circlearrowleft}}
\newcommand{\semidirect}[0]{\rtimes}
\newcommand{\sep}[0]{{ {}^{ \operatorname{sep} } }}
\newcommand{\sgn}[0]{\operatorname{sgn}}
\newcommand{\shom}{ {\mathcal{H}}\kern-0.5pt{\operatorname{om}}}
\newcommand{\signature}[0]{\operatorname{sig}}
\newcommand{\sign}[0]{\operatorname{sign}}
\newcommand{\sing}[0]{{\operatorname{Sing}}}
\newcommand{\slope}[0]{{\mathrm{slope}}}
\newcommand{\smts}[1]{\setminus\theset{#1}}
\newcommand{\smz}[0]{\setminus\theset{0}}
\newcommand{\sm}[0]{\setminus}
\newcommand{\spanof}[0]{{\operatorname{span}}}
\newcommand{\spec}[0]{\operatorname{Spec}}
\newcommand{\stab}[0]{{\operatorname{Stab}}}
\newcommand{\stirlingfirst}[2]{\genfrac{[}{]}{0pt}{}{#1}{#2}}
\newcommand{\stirling}[2]{\genfrac\{\}{0pt}{}{#1}{#2}}
\newcommand{\st}[0]{{~\mathrel{\Big|}~}}
\newcommand{\supp}[0]{{\operatorname{supp}}}
\newcommand{\surjectsvia}[2][]{ \xrightarrow[#1]{#2} { \mathrel{\mkern-16mu}\rightarrow }\, }
\newcommand{\surjects}[0]{\twoheadrightarrow}
\newcommand{\syl}[0]{{\operatorname{Syl}}}
\newcommand{\sym}[0]{\operatorname{Sym}}
\newcommand{\td}[0]{\mathrm{td}}
\newcommand{\tensor}[0]{\otimes}
\newcommand{\tgn}[0]{{ \mathcal{T}_{g, n} }}
\newcommand{\theset}[1]{\left\{{#1}\right\}}
\newcommand{\thetaref}[0]{{ \theta_{\mathrm{Ref} } }}
\newcommand{\thevector}[1]{{\left[ {#1} \right]}}
\newcommand{\thinrank}[0]{T_n\dash\operatorname{rank}}
\newcommand{\too}[1]{{\xrightarrow{#1}}}
\newcommand{\tors}[0]{{\operatorname{tors}}}
\newcommand{\tor}[0]{\operatorname{Tor}}
\newcommand{\transverse}[0]{\pitchfork}
\newcommand{\trdeg}[0]{\operatorname{trdeg}}
\newcommand{\trianglerightneq}{\mathrel{\ooalign{\raisebox{-0.5ex}{\reflectbox{\rotatebox{90}{$\nshortmid$}}}\cr$\triangleright$\cr}\mkern-3mu}}
\newcommand{\tr}[0]{{\mathrm{tr}}}
\newcommand{\tspt}[0]{{\{\operatorname{pt}\}}}
\newcommand{\ts}[1]{\left\{{#1}\right\}}
\newcommand{\tv}[1]{{\left[ {#1} \right]}}
\newcommand{\txand}[0]{{\operatorname{ and }}}
\newcommand{\txor}[0]{{\operatorname{ or }}}
\newcommand{\txt}[1]{{\operatorname{ {#1} }}}
\newcommand{\type}[0]{{\operatorname{type}}}
\newcommand{\uniformlyconverges}[0]{\rightrightarrows}
\newcommand{\union}[0]{\cup}
\newcommand{\unital}[0]{{\operatorname{unital}}}
\newcommand{\units}[0]{^{\times}}
\newcommand{\up}[0]{\uparrow}
\newcommand{\vhat}[1]{\widehat{ \vector{#1} }}
\newcommand{\vol}[0]{\operatorname{vol}}
\newcommand{\wait}[0]{{-}}
\newcommand{\wedgeprod}[0]{\vee}
\newcommand{\wt}[0]{{\operatorname{wt}}}
\newcommand{\zar}[0]{{\mathrm{zar}}}
\newcommand{\zbar}{\bar{z} }
\newcommand{\zlnz}[0]{\mathbb{Z}/\ell^n\mathbb{Z}}
\newcommand{\zlz}[0]{\mathbb{Z}/\ell\mathbb{Z}}
\newcommand{\znz}[0]{\mathbb{Z}/n\mathbb{Z}}
\newcommand{\zpz}[0]{\mathbb{Z}/p\mathbb{Z}}

\renewcommand{\AA}[0]{{\mathbb{A}}}
\renewcommand{\SS}[0]{{\mathbb{S}}}
\renewcommand{\bar}[1]{\mkern 1.5mu\overline{\mkern-1.5mu#1\mkern-1.5mu}\mkern 1.5mu}
\renewcommand{\det}{\operatorname{det}}
\renewcommand{\div}[0]{\operatorname{Div}}
\renewcommand{\hat}[1]{\widehat{#1}}
\renewcommand{\labelitemiii}{$\diamondsuit$}
\renewcommand{\labelitemiv}{$\diamondsuit$}
\renewcommand{\mid}[0]{\mathrel{\Big|}}
\renewcommand{\mod}{\pmod}
\renewcommand{\qed}[0]{\hfill\blacksquare}
\renewcommand{\too}[0]{\longrightarrow}
\renewcommand{\vector}[1]{\mathbf{#1}}

\DeclareMathOperator*{\eq}{=}
\DeclareMathOperator*{\hocolim}{hocolim}
\DeclareMathOperator{\Aut}{Aut}
\DeclareMathOperator{\BiHol}{BiHol}
\DeclareMathOperator{\Bl}{Bl}
\DeclareMathOperator{\Br}{Br}
\DeclareMathOperator{\Curv}{Curv}
\DeclareMathOperator{\Deck}{Deck}
\DeclareMathOperator{\Der}{Der}
\DeclareMathOperator{\Endo}{End}
\DeclareMathOperator{\Exists}{\exists}
\DeclareMathOperator{\Forall}{\forall}
\DeclareMathOperator{\Forget}{Forget}
\DeclareMathOperator{\Frame}{Frame}
\DeclareMathOperator{\Frob}{Frob}
\DeclareMathOperator{\Fr}{Fr}
\DeclareMathOperator{\Griff}{Griff}
\DeclareMathOperator{\Hol}{Hol}
\DeclareMathOperator{\Hom}{Hom}
\DeclareMathOperator{\Ind}{Ind}
\DeclareMathOperator{\Isom}{Isom}
\DeclareMathOperator{\Ld}{{\mathbb{L} }}
\DeclareMathOperator{\Maps}{Maps}
\DeclareMathOperator{\Map}{Maps}
\DeclareMathOperator{\OFrame}{OFrame}
\DeclareMathOperator{\Prin}{Prin}
\DeclareMathOperator{\Proj}{Proj}
\DeclareMathOperator{\RHom}{\mathbb{R}Hom}
\DeclareMathOperator{\Rad}{Rad}
\DeclareMathOperator{\Rd}{{\mathbb{R} }}
\DeclareMathOperator{\Res}{Res}
\DeclareMathOperator{\Suspendpinf}{{\Sigma_+^\infty}}
\DeclareMathOperator{\Symb}{Symb}
\DeclareMathOperator{\Taut}{Taut}
\DeclareMathOperator{\Th}{Th}
\DeclareMathOperator{\Triv}{Triv}
\DeclareMathOperator{\UFrame}{UFrame}
\DeclareMathOperator{\coInd}{coInd}
\DeclareMathOperator{\codom}{codom}
\DeclareMathOperator{\coh}{coh}
\DeclareMathOperator{\coind}{coInd}
\DeclareMathOperator{\coinfl}{coinf}
\DeclareMathOperator{\colspace}{colspace}
\DeclareMathOperator{\cores}{cores}
\DeclareMathOperator{\hd}{Head}
\DeclareMathOperator{\hilb}{Hilb}
\DeclareMathOperator{\ind}{ind}
\DeclareMathOperator{\infl}{inf}
\DeclareMathOperator{\len}{len}
\DeclareMathOperator{\nullity}{nullspace}
\DeclareMathOperator{\nullspace}{nullspace}
\DeclareMathOperator{\per}{per}
\DeclareMathOperator{\prin}{prin}
\DeclareMathOperator{\projection}{Proj}
\DeclareMathOperator{\proj}{proj}
\DeclareMathOperator{\range}{range}
\DeclareMathOperator{\res}{res}
\DeclareMathOperator{\rowspace}{rowspace}
\DeclareMathOperator{\soc}{Soc}
\DeclareMathOperator{\submfds}{SubMfds}

\newcommand{\Suchthat}[0]{\middle\vert}
\newcommand{\suchthat}[0]{{~\mathrel{\Big|}~}}
\newcommand{\delbar}[0]{{ \bar{\del}}}

\newcommand{\contains}[0]{\supseteq}
\newcommand{\containing}[0]{\supseteq}
\newcommand{\iscontainedin}[0]{\supseteq}

\newcommand{\rad}[1]{\sqrt{#1}}
\newcommand{\thecat}[1]{\mathbf{#1}}
\newcommand{\sheaf}[1]{\operatorname{\mathcal{#1}}}
\newcommand{\rightderive}[0]{{\mathbf{R}}}

\newcommand\rrarrows{\rightrightarrows}
\newcommand\rrrarrows{
    \mathrel{\substack{\textstyle\rightarrow\\[-0.6ex]
        \textstyle\rightarrow \\[-0.6ex]
        \textstyle\rightarrow}}
}



\newcommand\ul[1]{\underline{#1}}
\newcommand\constantsheaf[1]{\underline{#1}}
\newcommand\holomorphic[0]{\text{holo}}
\newcommand\std[0]{\text{std}}
\newcommand\Mero[0]{\operatorname{Mero}}
\newcommand\even[0]{\text{even}}
\newcommand\odd[0]{\text{odd}}
\newcommand\hodgestar[0]{\star}
\newcommand\dirac[0]{\mkern-3mu \not{ \partial} }
\newcommand\laplacian[0]{\Delta}
\newcommand\Laplacian[0]{\Delta}
\newcommand\stardstar[0]{\hodgestar {d} \mkern-5mu \hodgestar}
\newcommand\covariant[0]{\nabla}
\newcommand\ol[1]{\overline{#1}}
\newcommand\univcover[1]{\overline{#1}}
\newcommand\closure[1]{\overline{#1}}
\newcommand\fps[1]{{\left[\left[ #1 \right]\right]  }}
\newcommand\laurent[1]{{\left(\left( #1 \right)\right)  }}
\newcommand\capprod{\frown}
\newcommand\cupprod{\smile}
\newcommand\Path{\mathcal{P}}
\newcommand\gradient{\nabla}

\newcommand\cechH[0]{{\check{H}}}
\newcommand\Hc[0]{{\check{H}}}
\newcommand\Cc[0]{{\check{C}}}
\newcommand\cupp[0]{\smile}
\newcommand\capp[0]{\frown}
\newcommand\sig[0]{\operatorname{sig}}
\newcommand\ev[0]{\operatorname{ev}}
\newcommand\coev[0]{\operatorname{coev}}

\newcommand{\fractional}[1]{\theset{#1}}
\newcommand{\fractionalpart}[1]{\theset{#1}}
\newcommand{\integerpart}[1]{\left[ {#1}\right] }
\newcommand{\zadjoin}[1]{\mathbb{Z}\left[ {#1} \right]}
\newcommand{\Wedgepower}[0]{\bigwedge\nolimits}
\def\multichoose#1#2{{\left(\kern-.3em\left(\genfrac{}{}{0pt}{}{#1}{#2}\right)\kern-.3em\right)}}
\newcommand\elts[2]{{ {#1}_1, {#1}_2, \cdots, {#1}_{#2}}}
\newcommand\tselts[2]{{ \theset{ {#1}_1, {#1}_2, \cdots, {#1}_{#2} } }}
\newcommand\fiberproduct[1]{\underset{\scriptscriptstyle {#1} }{\times}}
\newcommand\fiberprod[1]{{ \fiberproduct{#1} }}
\newcommand\fprod[1]{{ \fiberproduct{#1} }}
\newcommand\smallprod[0]{{ \scriptscriptstyle\prod }}
\newcommand\sumpower[1]{{ {}^{ \scriptscriptstyle\oplus^{#1} }  }}
\newcommand\prodpower[1]{{ {}^{ \scriptscriptstyle\times^{#1} }  }}
\newcommand\tensorpower[2]{{ {}^{ \scriptstyle\otimes_{#1}^{#2} }  }}
\newcommand\derivedtensorpower[3]{{ {}^{ \scriptstyle {}_{#1} {\otimes_{#2}^{#3}} }  }}
\newcommand\smashpower[1]{{ {}^{ \scriptscriptstyle\smashprod^{#1} }  }}

\newcommand{\Tot}[0]{{ \operatorname{Tot} }}
\newcommand{\Totsum}[0]{\Tot^{\oplus}}
\newcommand{\Totprod}[0]{\Tot^{\Pi}}
\newcommand{\xpn}[0]{ { x^{p^n} } }
\newcommand{\Qbar}[0]{{ \bar{ \mathbb{Q} } }}

\newcommand{\Loop}[0]{{\Omega}}
\newcommand{\Loopinf}[0]{{\Omega}^\infty}
\newcommand{\Suspend}[0]{{\Sigma}}
\newcommand{\ptd}{{\scriptstyle { * } }}
\newcommand{\fin}[0]{{\mathrm{fin}}}
\newcommand{\can}[0]{{\mathrm{can}}}
\newcommand{\ess}[0]{{\mathrm{ess}}}
\newcommand{\fd}[0]{{\mathrm{fd}}}
\newcommand{\fg}[0]{{\mathrm{fg}}}
\newcommand{\qproj}[0]{{\mathrm{qproj}}}
\newcommand{\irr}[0]{{\mathrm{irr}}}
\newcommand{\ft}[0]{{\mathrm{ft}}}
\newcommand{\smol}[0]{{\mathrm{small}}}
\newcommand{\alev}[0]{{\,\mathrm{a.e.}}}
\newcommand{\semisimple}[0]{{\operatorname{ss}}}
\newcommand{\gon}[0]{{\dash\mathrm{gon}}}
\newcommand{\semi}[0]{{\operatorname{semi}}}
\newcommand{\inc}[0]{{\operatorname{inc}}}
\newcommand{\Ball}[0]{{B}}
\newcommand{\hq}[0]{{/}}
\newcommand{\unioninfty}[0]{{\union\ts{\infty}}}
\newcommand{\dualnumbers}[0]{{ [\eps] / \eps^2 }}
\newcommand{\crys}[0]{{\mathrm{crys}}}
\newcommand{\Xff}[0]{{X_\mathrm{FF}}}
\newcommand{\an}[0]{{\mathrm{an}}}
\newcommand{\Nis}[0]{{\mathrm{Nis}}}
\newcommand{\perf}[0]{{\mathrm{perf}}}

\newcommand{\quillenplus}[0]{{ {}^{+} }}
\newcommand{\glue}[1]{{ \Disjoint_{#1} }}
\newcommand{\normcomplex}[1]{{\norm{\complex{#1}}}}
\newcommand{\nerve}[1]{{ \mathcal{N}({#1}) }}
\newcommand{\realize}[1]{{ \abs{#1} }}

\newcommand{\localize}[1]{ \left[ { \scriptstyle #1\inv } \right]}
\newcommand{\sheafify}[1]{ \left( #1 \right)^{\scriptscriptstyle \mathrm{sh}} }
\newcommand{\complete}[1]{{ {}_{ \hat{#1} } }}
\newcommand{\takecompletion}[1]{{ \overbrace{#1}^{\widehat{\hspace{4em}}}  }}
\newcommand{\twistleft}[2]{{ {}^{#1} #2 }}
\newcommand{\twistright}[2]{{ #2 {}^{#1} }}
\newcommand{\liesover}[1]{{ {}_{/ {#1}} }}
\newcommand{\liesabove}[1]{{ {}_{/ {#1}} }}
\newcommand{\slice}[1]{_{/ {#1}} }
\newcommand{\quotright}[2]{ {}^{#1}\mkern-2mu/\mkern-2mu_{#2} }
\newcommand{\quotleft}[2]{ {}_{#2}\mkern-.5mu\backslash\mkern-2mu^{#1} }
\newcommand{\invert}[1]{{ \left[ { \scriptstyle \frac{1}{#1} } \right] }}
\newcommand{\pcomplete}[0]{{ {}^{ \wedge }_{p} }}


\newcommand{\B}[0]{{\mathsf{B}}}
\newcommand{\T}[0]{{\mathsf{T}}}
\newcommand{\K}[0]{{\mathsf{K}}}
\newcommand{\G}[0]{{\mathsf{G}}}
%\newcommand{\H}[0]{{\mathsf{H}}}
\newcommand{\D}{{ \mathsf{D} }}
\newcommand{\mH}{{ \mathsf{H} }}
\newcommand{\BGL}[0]{ \mathsf{B}\mkern-3mu \operatorname{GL} }

\newcommand{\RM}[1]{%
  \textup{\uppercase\expandafter{\romannumeral#1}}%
}
\DeclareMathOperator{\righttriplearrows} {{\; \tikz{ \foreach \y in {0, 0.1, 0.2} { \draw [-stealth] (0, \y) -- +(0.5, 0);}} \; }}
\DeclareMathOperator*{\mapbackforth}{\rightleftharpoons}
\newcommand{\fourcase}[4]{
\begin{cases}{#1} & {#2} \\ {#3} & {#4}\end{cases} 
}
\newcommand{\matt}[4]{{
\begin{bmatrix}
  {#1} & {#2} 
\\
  {#3} & {#4}
\end{bmatrix}
}}
\newcommand{\mattt}[9]{{
\begin{bmatrix}
  {#1} & {#2} & {#3}
\\
  {#4} & {#5} & {#6}
\\
  {#7} & {#8} & {#9}
\end{bmatrix}
}}

\newcommand\stacksymbol[3]{
  \mathrel{\stackunder[2pt]{\stackon[4pt]{$#3$}{$\scriptscriptstyle#1$}}{
  $\scriptscriptstyle#2$}}
}
\newcommand{\textoperatorname}[1]{
  \operatorname{\textnormal{#1}}
}

\newcommand{\dcoset}[3]{
    {\textstyle #1}
    \mkern-4mu\scalebox{1.5}{$\diagdown$}\mkern-5mu^{\textstyle #2}
    \mkern-4mu\scalebox{1.5}{$\diagup$}\mkern-5mu{\textstyle #3} }


%\newcommand{\strike}[1]{{\enclose{\horizontalstrike}{#1}}}
\DeclarePairedDelimiter{\ceil}{\lceil}{\rceil}

# Danny Krashen, Talk 1 (Monday, July 12)

## Intro
\todo[inline]{Missed first 12m}

**Abstract**:

> A fundamental question in field arithmetic is how one can bound, in various senses, the complexity of algebraic objects such as algebras, quadratic forms, or cohomology classes. This question is intimately related to notions of essential dimension, symbol length, and also to the construction of generic splitting varieties. In these talks, I will describe some of the principal questions of this sort, and various methods by which they have been approached.

**References**:

- <http://dkrashen.github.io/>

:::{.remark}
Fix a field $k_0 \in \Field$, we'll consider extensions $k\in\Field\slice{k_0}$.
:::

## Galois Cohomology

:::{.definition title="Galois Cohomology"}
For $M\in\mods{G_k}$ for $G_k$ the Galois group of $k\in\Field\slice{k_0}$, we can take invariants $M^{G_k}$.
The functor $\wait^{G_k}$ is left-exact, so we define 
\[
H^*_\gal(G_k; \wait) \da \RR^*(\wait)^{G_k}
.\]
:::

:::{.remark}
Note that the tensor product on $\mods{G_k}$ induces a cup product on $H^*_\Gal$.
An important example of coefficients is $M = \mu_\ell^{\tensor m}$, where $\mu_\ell^{\tensor 0} \da \ZZ/n$. It is known that $H_\Gal^*(G_k; \mu^{\tensor 0}) = \ZZ/n$.

We'll define *symbols* 
\[
(a_1, \cdots, a_n) \da (a_1) \cupprod \cdots \cupprod (a_n) \in H_\Gal^*(k, \mu_\ell^{\tensor n})
,\]
which are in fact generators.
To remember the $\ell$, we write $(\elts{a}{n})_\ell$.
:::

:::{.remark}
Galois cohomology is a special case of étale cohomology, where for $M\in \mods{G_k}$,
\[
H_\Gal^n(G_k; M) = H_\et^n(k; M) = H_\et^n(\spec k; M)
.\]
Étale cohomology works for schemes other than just $\spec k$.
:::

## Milnor K-Theory

:::{.definition title="?"}
Given $k\in \Field$, define
\[
\KM_*(k) \da \bigoplus _{i=1}^\infty \KM_i(k)
\]
where

- $\KM_0(k) = \ZZ$
- $\KM_1(k) = k^m$, written additively as elements $\ts{a}$ on the left-hand side, so $\ts{a} + \ts{b} \da \ts{ab}$.
- It's generated by $\KM_1(k)$, with products written by concatenation:
\[
\ts{a_1, \cdots, a_n} = \ts{a_1} \ts{a_2} \cdots \ts{a_n}
.\]
- The only relations are $\ts{a, b} = 0$ when $a+b=1$, motivated by 
\[
(a, b)_\ell = 0 \in H^2_\gal(k; \mu_\ell^{\tensor 2})
\iff a+b=1
.\]
- There is a map
\[
\KM_0(k) &\to H_\et^*(k; \mu_\ell^{\tensor 0}) \\
\ts{a} &\mapsto (a)
,\]
and the **Norm-Residue isomorphism** (formerly the **Bloch-Kato conjecture**) states that this is an isomorphism after modding out by $\ell$, i.e. 
\[
\KM_0(k)/\ell \mapsvia{\sim} H_\et^*(k; \mu_\ell^{\tensor 0})
.\]

:::

## Witt Ring

:::{.remark}
Assume $\ch k \neq 2$, so there is a correspondence between quadratic forms and symmetric bilinear forms given by polarization:
\[
\text{Quadratic forms} &\mapstofrom \text{Symmetric bilinear forms} \\
q_b(x) \da b(x,x) &\mapsfrom b(x, y) \\
q &\mapsto b_q(x,y) \da {1\over 2}\qty{q(x+y) - q(x) - q(y)}
.\]
So we'll identify these going forward and write $q$ for an arbitrary symmetric bilinear form or a quadratic form.
We say $q$ is **nondegenerate** if there is an induced isomorphism:
\[
V &\mapsvia{\sim} V\dual\\
v &\mapsto b_q(v, \wait)
.\]

> Note that a symmetric bilinear form $q$ on $V$ can be regarded as an element of $\Sym^2(V\dual)$. 
:::

:::{.definition title="The Witt Ring"}
Let $\Quadform\slice{k}$ be the category of **quadratic spaces**: pairs $(V, q)$ with $V\in \mathsf{VectSp}\slice{k}$ a $k\dash$vector space and $q\in \Sym^2(V\dual)$ representing a quadratic form on $V$.
The **Witt ring** is generated as a group by isomorphism representing a quadratic form on $V$.
\[
W(k) = \frac{\ZZ \gens{\ts{ [(V, q)] \in \Quadform\slice{k} } }}{
\gens{
q_\hyp, (q_1 + q_2) - (q_1 \perp q_2)
} 
}
\in \Ab\Grp
.\]
where the **hyperbolic form** is defined as $q_\hyp(x, y) = xy$.
The ring structure is given by the tensor product (a.k.a. Kronecker product of forms).
:::

:::{.remark}
Noting that Galois cohomology lives mod $\ell$ for various $\ell$, here $\KM_0(k)$ lives over $\ZZ$.
So Milnor K-theory relates all of the various mod $\ell$ Galois cohomologies together.
:::

:::{.definition title="Fundamental ideals and Pfister Forms"}
The **fundamental ideal** $I(k) \normal W(k)$ is the ideal of even dimensional forms, and set $I^n(k) \da (I(k))^n$.
There is a map
\[
\KM_n(k) &\to I^n(k) / I^{n+1}(k) \\
\ts{\elts{a}{n}} &\mapsto \dgens{\elts{a}{n}}
,\]
which follows from Gram-Schmidt: any form can be diagonalized $q \cong \sum a_i x_i^2$, which we can write as $\gens{\elts{a}{n}}$.
We can define the **$n\dash$fold Pfister forms**
\[
\gens{\gens{ a }} &\da \gens{\gens{1, -a}} \\
\gens{\gens{\elts{a}{n}}} &\da \prod_{i=1}^n \dgens{a_i}
.\]
:::

:::{.remark}
The **Milnor conjecture** (proved by Voevodsky et al) states that the above map is an isomorphism after modding out by 2, so
\[
\KM_n(k)/2 \mapsvia{\sim} I^n(k) / I^{n+1}(k)
.\]
Moreover, the LHS is isomorphic to $H^n(k, \mu_2)$.
There are interesting maps going the other way
\[
I^n(k) \to I^n(k) / I^{n+1}(k) \mapsvia{\sim} H^n(k, \mu_2)
\]

Upshot: this is surjective -- any mod $2$ cohomology class comes from a quadratic form, and thus we can reason about cohomology by reasoning about quadratic forms.
:::

## Motivic Cohomology

:::{.remark}
**Motivic cohomology** relates the various mod $\ell$ cohomologies together much like $\KM_*$, but additionally relates different twists.
In particular, it relates various $H^i_\et(k; \mu_\ell^{\tensor j})$, where Milnor K-theory interprets this "diagonally" when $i=j$.
This works by constructing **motivic complexes** 
\[
\ZZ(m) \in \Ch(\Presh\smooth\Sch\slice{k})
,\]
which are complexes of presheaves on smooth $k\dash$schemes, usually considered in the Zariski, étale, or Nisnevich topologies.
:::

:::{.remark}
**Zariski hypercohomology** is defined as 
\[
\HH^n(X; \ZZ(m)) = H^{n, m}(X; \ZZ) = H_\mot^n(X; \ZZ(m)) && \text{for } X\da \spec k
.\]
These relate to Galois cohomology in the following ways:

- There is a quasi-isomorphism $\mu_\ell^{\tensor m} \mapsvia{\sim_W} \ZZ/\ell(n)$ in the étale topology.
- There is an isomorphism $H^n_\zar(k, \ZZ(n)) \mapsvia{\sim} \KM_n(k)$.
- Bloch-Kato identifies $H_\zar^*(X; \ZZ/\ell(n)) \mapsvia{\sim} H_\et^n(X; \ZZ/\ell(n))$.
:::

## Dimension

:::{.remark}
There are a number of competing notions for the "dimension" of a field.
:::

:::{.definition title="Dimension of a field"}
If $k$ is finitely generated over either a prime field or an algebraically closed field, we say
\[
\dim(k) 
=
\begin{cases}
[k: k_0]_\tr & k_0 = \bar k_0  
\\
[k: k_0]_\tr +1 & k_0 \text{ finite} \\
[k: k_0]_\tr + 2 & k_0 = \QQ.
\end{cases}
\]
:::

:::{.definition title="Cohomological dimension"}
We define its **cohomological dimension** $\cohdim(k)$, which is at most $n$ if $H^n(G_k; M) = 0$ for all $m>n$ and $M$ torsion,
\[
\cohdim(k) \da \min \ts{n \st \cohdim(k) \leq n}
.\]
Equivalently, $\cohdim(k) = n \iff$ there exists a torsion $M$ with $H^n(G_k; M) \neq 0$ and $H^m(G_k; M) = 0$ for all $m>n$.

:::

:::{.remark}
$\cohdim(k) = \dim(k)$ if $k$ is finitely generated or a finite extension of $k_0 = \bar k_0$, or if $k$ is finitely generated over $\QQ$ and has no real orderings.
So if $k$ has orderings, $\cohdim(k) = \infty$.
:::

:::{.definition title="Diophantine Dimension"}
We say $k$ is $C_n$ if for $d>0$ and $m>d^n$, then every homogeneous polynomials of degree $d$ in $m$ variables has a nontrivial root.
\[
\ddim(k) \da \min\ts{n\st k \text{ is } C_n}
.\]

:::

:::{.example title="?"}
If $k$ is finitely generated or finite over $k_0 = \bar k_0$, then 
\[
\ddim(k) = \dim(k) = \cohdim(k)
.\]
:::

:::{.definition title="$T_n\dash$rank"}
We say $k$ is $T_n$ if for every $\elts{d}{r} > 0$ and every system of polynomial equations $f_1 = \cdots = f_r = 0$ with $\deg f_i = d_i$ in $m$ variables, with $m > \sum d_i^n$.
Then the **$T_n\dash$rank** is defined as
\[
\thinrank(k) \da \min\ts{n \st k \text{ is } T_n}
.\]
:::

:::{.question}
Note that $T_n\implies C_n$, so $\thinrank(k) \geq \ddim(k)$, when are they equal?
This is likely unknown.
:::

:::{.remark}
There is a famous example of a field $k$ with $\cohdim(k)=1$ but $\ddim(k) = \infty$.
:::

:::{.question}
Is it true that $\ddim(k) \geq \cohdim(k)$?
Serre showed that this holds when $\cohdim$ is replaced by $\cohdim_2$, the 2-primary part -- does this hold for all $p$?
These are both open.

Why would one expect this to be true?
:::

:::{.remark}
A recent result: $\cohdim_p$ grows at most linearly in $\ddim$, with slope not 1 but rather $\approx \log_2 p$.
These questions say that if an equation has enough variables then there is a solution, but why should this be reflected in cohomology?
To show this bound, one would want to show that given some $\alpha \in H^*(k)$, there exists a polynomial $f_\alpha$ where if $f_\alpha$ has a root and $\alpha = 0$ in homology.
In special cases, we were able to come up with such polynomials.
When $\alpha$ is a symbol, this is closely related to *norm varieties* which have a point iff $\alpha$ is split.
One might optimistically hope these are described as hypersurfaces, from which answers to the above would follow, but they turn out to not have such a concrete realization.
:::

## Structural Problems in Galois Cohomology

:::{.remark}
Here we'll describe the problems we need help with!
Perhaps insight from motivic cohomology will lend insight to them.
We'll write $H^i(k) \da H^i(k; \mu_\ell^{\tensor j})$.
:::

### Period-Index Problems

:::{.definition title="An extension splitting a cohomology class"}
If $\alpha \in H^i(k)$, we say $L\slice{k}$ **splits** $\alpha$ if 
\[
\ro{\alpha}{L} = 0\in H^i(L)
.\]
:::

:::{.definition title="?"}
We define the **index**
\[
\ind \alpha \da \gcd\ts{[L:k] \st L\slice{k} \text{ finite and splits } \alpha}
.\]
and the **period** of $\alpha$ as its (group-theoretic) order $H^i(k)$.
Note that $\per \alpha \leq \ell$.
:::

:::{.remark}
One can show that $\per \alpha \divides \ind \alpha$, and $\ind \alpha \divides \qty{\per \alpha}^m$ for some $m$.
:::

:::{.question}
For a fixed $k$ and $i, j, \ell$, which is the minimum $m$ such that 
\[
\ind \alpha \divides \qty{\per \alpha}^m
?\]
Alternatively, what is the minimum $m$ such that $\ind \alpha \divides \ell^m$?
:::

:::{.conjecture}
If $\ddim(k) = n$ (or $\dim(k) = n$ since $k$ is finitely generated) with $\alpha \in H^2(k, \mu_\ell)$, then 
\[
\ind \alpha \divides \qty{\per \alpha}^{n-1}
.\]
:::

:::{.remark}
Even in this case, no known bound is known for $k = \QQ(t)$, for any choice of $\ell$.
How complicated can the cohomology class be?
The rough idea is that for $H^i(k)$ with $i$ near $\dim k$, this should have a small index and if $i=\dim k$ then $\per k = \ind k$.
:::

:::{.remark}
We know $\per = \ind$ for any number field for classes in $H^2(\spec k; \mu_N)$, with or without roots.
:::

### Symbol Length Problem

:::{.remark}
We know $H^n(k, \mu_\ell^{\tensor n})$ is generated by symbols $(\elts{a}{n})$.
We can use symbol length to measure complexity, leading to the following:
:::

:::{.question}
Given $k, n$, what is the minimal number $m$ such that every $\alpha\in H^n(k)$ is a sum of no more than $m$ symbols.
I.e. how easy is it to write $\alpha$?
:::

:::{.remark}
We'd like a bound in terms of $\ddim(k)$ and $\dim(k)$.
One can construct fields needing arbitrarily long symbols, but perhaps for finite dimensional fields, one feels there should be a bound.
Danny feels that there may not be such a bound once $n\geq 4$.
:::

:::{.remark}
What's known: for number fields (or global fields, i.e. a reasonable notion of dimension with $\dim k = 2$) which lie over finitely generated or prime fields and have a primitive $\ell$th root of unity, we know every class in $H^2$ can be written as exactly one symbol.
:::

:::{.remark}
A result of Malgri (?): assuming we have roots of unity, if $\ell = p^t$, then for $H^2$ one needs at most $t(p^{\ddim(k)-1}-1)$ symbols.
If $\ddim(k)< \infty$ this yields a bound, and conjecturally this shouldn't depend on ???

For higher degree cohomology, we know almost nothing except for special cases of $H^4$ for "3-dimensional" $p\dash$adic curves.
:::

:::{.remark}
If one can bound the symbol length, one can uniformly write down a generic element in cohomology as a sum of at most $n$ symbols.
The inability to be able to write down a general form of a cohomology class for a given field is what makes this difficult -- they have "complexity" that isn't necessarily bounded in a known way.
:::


























# Danny Krashen, Talk 2 (Tuesday, July 13)

## Setup

:::{.remark}
Fix a $k_0\in\Field$.

**Outline**

- Arithmetic problems: consider "complexity" of cohomology or algebraic structures (Witt group, symbol length, index of classes).
  
  - Examples were $\ddim, \cohdim$, the period-index problem, the period-symbol length problem, which we saw last time.

- Algebraic structure problems: describe (algebraic) structural features of the class of all field extensions $k \in\Field\slice{k_0}$.

Today we'll describe a way to connect these using a notion of *essential dimension*.
Computing this is difficult in general, but finding lower/upper bounds can be tractable.
We'll get upper bounds from *canonical dimensions*, and lower bounds from cohomological invariants.
:::

## Symbol Length

:::{.remark}
For a particularly concrete problem, consider 
\[
\alpha\in H^2(k; \mu_\ell) \subseteq H^2(k; \GG_m)[\ell] \da \Br(k)[\ell]
,\]
i.e. this is a subgroup of the $\ell\dash$torsion of the **Brauer group**.
Suppose we know 
\[
\ind \alpha \da \gcd\ts{[L:k] \st \alpha_L = 0} = \min\ts{[L:K] \st \alpha_L = 0}
,\]
where the last equality holds in the special case of $\Br(k)$.
If $k$ contains a primitive $\ell$th root of unity, we can identify $\mu_\ell = \ZZ/\ell = \mu_\ell^{\tensor 2}$, and thus identify
\[
H^2(k; \mu_\ell) = H^2(k; \mu_\ell^{\tensor 2}) = K_2^M(k)/\ell
.\]
So we can write $\alpha = \alpha_1 + \cdots + \alpha_r$ as a sum of symbols with $\alpha_i = (b_i, c_i)_\ell$ with $b_i, c_i\in k\units$.
:::

:::{.question}
How big does $n$ have to be?
:::

:::{.remark}
It follows from "the literature" (after stringing several results together) that there almost exists an absolute bounds depending only on $\ell, n$ but not $k$.
However, we do not know what this bound actually is.
There are some known cases:

- $\ell = n = 2, 3$: $r\leq 1$, so only one symbol is needed.
- $\ell = n = 4$: probably $r\leq 4$.
- $\ell = 2, n=4$: $r\leq 2$, a classical results on central simple algebras.
- $\ell = 2, n=8: r\leq 4$

:::


:::{.remark}
It turns out that if $k$ contains a field $k_0$ with $\ddim k_0 < \infty$, one can produce an explicit bound.
Given some $\alpha \in H^2(k; \mu_\ell)$ we can find some $k_0 \subseteq L \subseteq k$ with $L$ finitely generated over $k_0$ and $[L:k_0]_\tr$ depending only on the period $\ell$ and index $n$, such that $\alpha \in \im\qty{H^2(L;\mu) \to H^2(k; \mu)}$.

:::{.slogan}
Central simple algebras of a given period and index have finite essential dimension.
:::

An important property is that 
\[
\ddim L \leq \ddim k_0 + [L: k_0]_\tr
.\]
Recall that we can bound the symbol length in $H^2(k; \mu_\ell)$ in terms of $\ddim L$.
The idea is that we can bound the transcendence degree in terms of $\ell, n$.
This bound can be made very explicit, although it's not tight: for $\ell = 2, n=8$, it's $2^{17 + \ddim k_0} -1$.
This is an improvement over $k_0 = \QQ$ though, where it's known there's a bound but it can't be written down.
The lower bound is *very* low: it is hard to show a symbol can not be written with very few symbols.
:::

## Pfister Forms

:::{.remark}
Recall $W(k)$, whose elements are isometry classes of nondegenerate quadratic forms with addition given by perpendicular sum and the Kronecker product.
There is a hyperbolic form $xy$, or $x^2-y^2$ in $\ch k \neq 2$, which we can write as $\gens{1, -1}$, and a fundamental ideal of even-dimensional forms $\gens{1, -a} = \dgens{a}$.
We write 
\[
\dgens{\elts{a}{n}} \da \dgens{a_1} \dgens{a_2}\cdots \dgens{a_n}\in I^n(k)
,\]
which in fact generate $I^n(k)$.
:::

:::{.question}
Given $q\in I^n(k)$ of dimension $d$, we know we can write $q \sim q_1 \perp \cdots \perp q_r$ where $q_i$ are $n\dash$fold Pfister forms.
How many are needed? 
Is this number even bounded?
:::

:::{.theorem title="(Vishik)"}
If $d < 2^n + 2^{n-1}$ then $r$ is bounded by some small number.
:::

:::{.remark}
For $d\geq 2^n + 2^{n-1}$, it's not so clear, although it is bounded when $n\geq 3$.
Why is $n\leq 3$ easy and $n\geq 4$ hard?
:::

:::{.remark}
Consider the following objects:

- $H^2(k; \mu)$
- $\Br(k)$
- $W(k)$
- $I^n(k)$
- $q\in I^n(k)$ with $\dim q = d$

These can all be viewed as functors $\Field{\slice{k_0}}\to \Set$ taking field extensions to sets.
:::

:::{.definition title="Essential dimension of a functor"}
Given a functor $f$ and $\alpha \in F(k)$, define
\[
\essdim(\alpha) &= \min\ts{[L:k_0]_\tr \st \alpha\in \im(F(L) \to F(k)) }\\
\essdim(F) &= \min\ts{\essdim(\alpha) \st \alpha \in F(k) \,\,\forall k\slice{k_0}}
.\]
:::

:::{.definition title="Versal"}
Given a functor $F: \Alg_{\slice{k_0}}\to \Set$, we say $\alpha \in F(R)$ is **versal** if for every $\beta \in F(K)$, for any $k\slice{k_0}$, there exists a morphism $R\to k$ such that $\beta$ is the image of $\alpha$ under $F(R)\to F(k)$.


![](figures/2021-07-13_13-54-39.png)

:::

:::{.observation}
If there exists a versal $\alpha \in F(R)$ then $\krulldim R \geq \essdim(F)$, so the essential dimension is bounded above by the Krull dimension.
:::

:::{.example title="?"}
Let $F(k)$ be the set of quadratic forms of dimension $n$ over $k$, then $\essdim F = n$.
Every such $q$ can be diagonalized to yields $q \simeq \gens{\elts{a}{n}}$ which is defined over $L \da k_0(\elts{a}{n})$.
Alternatively, 
\[
q = \gens{\elts{x}{n}} / k_0[x_1^{\pm 1}, x_2^{\pm 1}, \cdots, x_n^{\pm 1} ]
\]
is versal.
Thus every such quadratic form comes from "specializing".

Considering now the fundamental ideals, the Milnor conjectures yield an isomorphism $I^n/I^{n+1} \cong H^n(k; \mu_2)$, so there is a SES
\[
1 \to I^{n+1} \to I^n \mapsvia{e_n} H^n(k; \mu_2) \to 1
.\]
Thus a quadratic form $q$ of dimension $d$ in $I^{n+1}$ is equivalent to $q\in I^{n}$ such that $e_n(q) = 0$.
:::

## Canonical Dimension

:::{.definition title="Canonical Dimension"}
This is a generalization of $\essdim$.
Letting $k\slice{k_0}$, suppose $F: \Field\slice{k} \to \Sets_+$ is a functor now from extensions of $k$ (not $k_0$) into pointed sets.
For $\alpha\in F(k)$, define a new functor
\[
\check{F}_\alpha(L) \da
\begin{cases}
\emptyset & \alpha_L \neq \pt 
\\
\ts{\pt}  & \alpha_L = \pt,
\end{cases}
\]
and define the **canonical dimension**
\[
\candim(\alpha) = \essdim(\check{F}(\alpha))
.\]
:::

:::{.remark}
This measures how many parameters are needed to trivialize/split $\alpha$.
To have $\candim(\alpha) \leq r$ means that if $\alpha = \pt$ means the following: 
if $\alpha_L = \pt$ then there exists an $E$ with $k \subseteq E \subseteq L$ with $[E:k]_\tr \leq r$ such that $\alpha_E = \pt$.
:::

:::{.definition title="Generic splitting scheme"}
Given $F$ as above and $\alpha\in F(k)$, we say an $X\in \Sch_{/k}$ is a **generic splitting scheme** for $\alpha$ if
\[
\alpha_L = 0 \iff X(L) \neq \emptyset
.\]
:::

:::{.remark}
So this encodes triviality of $\alpha$ into polynomial equations.
:::

:::{.example title="?"}
If $X$ is a generic splitting scheme for $\alpha$ finite type over $L$ implies $\candim(\alpha) \leq \dim X$.
:::

## Splitting Schemes

:::{.question}
Does there exists a finite type generic splitting scheme for cohomology classes in $H^i(k; \mu_\ell^{\tensor j})$?
:::

:::{.remark}
We do know this in special cases:

- $i=1$: Yes, these are etale algebras, so finite schemes over $k$.
- $i=2$: Yes, Danny shows these exist for all twists.
  - $j=1$: Classical, these are Severi-Brauer varieties.
- For symbols, $i=3,j=2,\ell$ a prime: see Merkurjev-Suslin
- For symbols, $i=4, j=3, \ell =3$: see Albert algebras
- For symbols, $\ell$ prime: this can be done up to prime-to-$\ell$ extensions, see [Rost's "Norm Varieties"](https://arxiv.org/abs/math/0304208).
  Related to Bloch-Kato conjecture.
- For symbols, $\ell=2$: see Pfister quadrics.

:::

:::{.remark}
Upshot: if there exists generic splitting schemes for classes in $H^i(k; \mu_2)$ for $i\geq 3$, one could bound Pfister numbers and thus $\essdim$.
Write $\mci_d^n(k)$ to be the set of quadratic forms of dimension $d$ in $I^n$, then $\essdim(\mci_d^n) < \infty$ would imply that if $q\in \mci_d^n(k)$ for $k\supseteq k_0$ then $q$ would be defined over some $L\slice{k_0}$ with $[L: k_0]_\tr < \infty$.

If we knew that $\ddim k_0 < \infty$, e.g. if $k_0$ contains a finite field, this yields a bound on $\ddim L$ and thus on $\cohdim L$.
If there is a versal element in $\alpha\in \mci^n_d$, then $\alpha$ needs some finite number $m$ of Pfister forms to be written.
Everything else is a specialization of $\alpha$, so the length $m$ will almost give an upper bound.
:::

:::{.warnings}
This may seem like a correct argument, but it is not!
A problem arises where you may have denominators -- specialization can get worse, but only a finite number of times, which is how the actual argument goes.
:::

:::{.remark}
If you knew the essential dimensions were finite with some given bound, and some general period-index conjecture were known, these would give bounds on symbol length in $H^i(L; \mu_2)$.
There's an argument pushing things into higher powers of the fundamental ideal, thus higher degree cohomology, which disappear at some point and yield a bound.
Motives enter the picture in terms of the tools used to attack these problems.
:::