\( \newcommand{\coloneqq}{\mathrel{\vcenter{:}}=} \newcommand{\qty}[1]{\left( {#1} \right)} \newcommand{\AA}{{\mathbf{A}}} \newcommand{\CC}{{\mathbf{C}}} \newcommand{\DD}{\mathbb{D}} \newcommand{\EE}{{\mathbb{E}}} \newcommand{\FF}{{ \mathbf{F} }} \newcommand{\GG}{{\mathbf{G}}} \newcommand{\HH}{{\mathbb{H}}} \newcommand{\KK}{{\mathbb{K}}} \newcommand{\LL}{{\mathbb{L}}} \newcommand{\NN}{{\mathbb{N}}} \newcommand{\PP}{{\mathbf{P}}} \newcommand{\QQ}{{\mathbf{Q}}} \newcommand{\RR}{{\mathbf{R}}} \newcommand{\SS}{{\mathbb{S}}} \newcommand{\TT}{{\mathbb{T}}} \newcommand{\UU}{\mathbb{U}} \newcommand{\VV}{{\mathbf{V}}} \newcommand{\ZZ}{{\mathbf{Z}}} \newcommand{\GGr}{{\mathbb{Gr}}} \newcommand{\OP}{{\mathbb{OP}}} \newcommand{\SpSp}{{\mathbb{S}}} \newcommand{\CCpadic}{{ \CC_p }} \newcommand{\CCstar}{\unitsof{\CC}} \newcommand{\FFbar}{{\bar\FF}} \newcommand{\FFp}{{\FF_p}} \newcommand{\FFpn}{{\FF_{p^n}}} \newcommand{\Fpbar}{\bar{\FF_p}} \newcommand{\fq}{{\FF_{q}}} \newcommand{\fqbar}{\bar{\FF_{q}}} \newcommand{\fqr}{{\FF_{q^r}}} \newcommand{\kG}{{kG}} \newcommand{\kk}{{\mathbf{k}}} \newcommand{\QQbar}{{ \bar{ \mathbf{Q} } }} \newcommand{\QQladic}{{ \QQ_\ell }} \newcommand{\QQpadic}{{ \QQ_{\hat p} }} \newcommand{\ZZbar}{{ \bar{ \ZZ } }} \newcommand{\ZZelladic}{{ \ZZ_\ell }} \newcommand{\ZZG}{{\ZZ G}} \newcommand{\ZZH}{{\ZZ H}} \newcommand{\ZZhat}{{ \widehat{ \ZZ } }} \newcommand{\ZZladic}{{ \ZZ_{\hat \ell} }} \newcommand{\ZZpadic}{{ \ZZ_{\hat p} }} \newcommand{\ZZpcomplete}{{ \ZZpadic }} \newcommand{\ZZplocal}{{ L_p \ZZ }} \newcommand{\ZZprof}{{ \hat{\ZZ} }} \newcommand{\ZpZ}{\ZZ/p} \newcommand{\zlnz}{\ZZ/\ell^n\ZZ} \newcommand{\zlz}{\ZZ/\ell\ZZ} \newcommand{\znz}{\ZZ/n\ZZ} \newcommand{\zpz}{\ZZ/p\ZZ} \newcommand{\Banach}{\mathcal{B}} \newcommand{\Hsh}{{ \mathcal{H} }} \newcommand{\mca}{{\mathcal{A}}} \newcommand{\mcb}{{\mathcal{B}}} \newcommand{\mcc}{{\mathcal{C}}} \newcommand{\mcd}{{\mathcal{D}}} \newcommand{\mce}{{\mathcal{E}}} \newcommand{\mcf}{{\mathcal{F}}} \newcommand{\mcg}{{\mathcal{G}}} \newcommand{\mch}{{\mathcal{H}}} \newcommand{\mci}{{\mathcal{I}}} \newcommand{\mcj}{{\mathcal{J}}} \newcommand{\mck}{{\mathcal{K}}} \newcommand{\mcl}{{\mathcal{L}}} \newcommand{\mcm}{{\mathcal{M}}} \newcommand{\mcn}{{\mathcal{N}}} \newcommand{\mco}{{\mathcal{O}}} \newcommand{\mcp}{{\mathcal{P}}} \newcommand{\mcq}{{\mathcal{Q}}} \newcommand{\mcr}{{\mathcal{R}}} \newcommand{\mcs}{{\mathcal{S}}} \newcommand{\mct}{{\mathcal{T}}} \newcommand{\mcTop}{\mathcal{T}\mathsf{op}} \newcommand{\mcu}{{\mathcal{U}}} \newcommand{\mcv}{{\mathcal{V}}} \newcommand{\mcw}{{\mathcal{W}}} \newcommand{\mcx}{{\mathcal{X}}} \newcommand{\mcy}{{\mathcal{Y}}} \newcommand{\mcz}{{\mathcal{Z}}} \newcommand{\OO}{{\mathcal{O}}} \newcommand{\Path}{\mathcal{P}} \newcommand{\liea}{{\mathfrak{a}}} \newcommand{\lieb}{{\mathfrak{b}}} \newcommand{\lied}{{\mathfrak{d}}} \newcommand{\lief}{{\mathfrak{f}}} \newcommand{\lieg}{{\mathfrak{g}}} \newcommand{\liegl}{{\mathfrak{gl}}} \newcommand{\lieh}{{\mathfrak{h}}} \newcommand{\liel}{{\mathfrak{l}}} \newcommand{\lien}{{\mathfrak{n}}} \newcommand{\lieo}{{\mathfrak{o}}} \newcommand{\liep}{{\mathfrak{p}}} \newcommand{\lieq}{{\mathfrak{q}}} \newcommand{\lier}{{\mathfrak{r}}} \newcommand{\lies}{{\mathfrak{s}}} \newcommand{\liesl}{{\mathfrak{sl}}} \newcommand{\lieso}{{\mathfrak{so}}} \newcommand{\liesp}{{\mathfrak{sp}}} \newcommand{\liesu}{{\mathfrak{su}}} \newcommand{\liet}{{\mathfrak{t}}} \newcommand{\lieu}{{\mathfrak{u}}} \newcommand{\lieW}{{\mathfrak{W}}} \newcommand{\liey}{{\mathfrak{y}}} \newcommand{\mfa}{{\mathfrak{a}}} \newcommand{\mfb}{{\mathfrak{b}}} \newcommand{\mfc}{{\mathfrak{c}}} \newcommand{\mfC}{{\mathfrak{C}}} \newcommand{\mfe}{{\mathfrak{e}}} \newcommand{\mff}{{\mathfrak{f}}} \newcommand{\mfF}{{\mathfrak{F}}} \newcommand{\mfg}{{\mathfrak{g}}} \newcommand{\mfh}{{\mathfrak{h}}} \newcommand{\mfk}{{\mathfrak{k}}} \newcommand{\mfm}{{\mathfrak{m}}} \newcommand{\mfn}{{\mathfrak{n}}} \newcommand{\mfo}{{\mathfrak{o}}} \newcommand{\mfp}{{\mathfrak{p}}} \newcommand{\mfq}{{\mathfrak{q}}} \newcommand{\mfr}{{\mathfrak{r}}} \newcommand{\mfs}{{\mathfrak{s}}} \newcommand{\mfS}{{\mathfrak{S}}} \newcommand{\mfu}{{\mathfrak{u}}} \newcommand{\mfv}{{\mathfrak{v}}} \newcommand{\mfX}{{\mathfrak{X}}} \newcommand{\mm}{{\mathfrak{m}}} \newcommand{\bigo}{{ \mathsf{O}}} \newcommand{\Gal}{{ \mathsf{Gal}}} \newcommand{\Herm}{{\mathsf{Herm}}} \newcommand{\AMGM}{{\mathrm{AMGM}}} \newcommand{\CM}{{\mathrm{CM}}} \newcommand{\CR}{{\mathrm{CR}}} \newcommand{\CS}{\mathrm{CS}} \newcommand{\CY}{{ \text{CY} }} \newcommand{\dR}{\mathrm{dR}} \newcommand{\EKL}{{\mathrm{EKL}}} \newcommand{\Ell}{\mathrm{Ell}} \newcommand{\Fix}{\mathrm{Fix}} \newcommand{\FP}{\mathrm{FP}} \newcommand{\FS}{{ \text{FS} }} \newcommand{\Hasse}{{\mathrm{Hasse}}} \newcommand{\homog}{{ \mathrm{homog} }} \newcommand{\IAS}{\mathrm{IAS}} \newcommand{\KSBA}{\mathrm{KSBA}} \newcommand{\Lat}{\mathrm{Lat}} \newcommand{\LC}{{\mathrm{LC}}} \newcommand{\lci}{\mathrm{lci}} \newcommand{\MHS}{\mathrm{MHS}} \newcommand{\mot}{{ \mathrm{mot}}} \newcommand{\nef}{\mathrm{nef}} \newcommand{\Nil}{{\mathrm{Nil}}} \newcommand{\Nis}{{\mathrm{Nis}}} \newcommand{\Noeth}{{ \mathrm{Noeth} }} \newcommand{\Orb}{{\mathrm{Orb}}} \newcommand{\PD}{\mathrm{PD}} \newcommand{\Pet}{{\mathrm{Pet}}} \newcommand{\QH}{{\mathrm{QH}}} \newcommand{\Quad}{\mathrm{Quad}} \newcommand{\RT}{{\mathrm{RT}}} \newcommand{\SC}{\mathrm{SC}} \newcommand{\slc}{\mathrm{slc}} \newcommand{\SNF}{\mathrm{SNF}} \newcommand{\spinor}{\mathrm{sp}} \newcommand{\tame}{{\mathrm{tame}}} \newcommand{\tb}{\mathrm{tb}} \newcommand{\td}{\mathrm{td}} \newcommand{\tw}{\mathrm{tw}} \newcommand{\VHS}{{\mathrm{VHS} }} \newcommand{\vir}{{\mathrm{vir}}} \newcommand{\VMHS}{\mathrm{VMHS}} \newcommand{\WI}{\mathrm{WI}} \newcommand{\Zar}{{\mathrm{Zar}}} \newcommand{\alev}{{\,\mathrm{a.e.}}} \newcommand{\amp}{{\mathrm{amp}}} \newcommand{\an}{{\mathrm{an}}} \newcommand{\can}{{\mathrm{can}}} \newcommand{\cell}{{ \mathrm{cell}}} \newcommand{\crys}{{\mathrm{crys}}} \newcommand{\cusp}{{ \mathrm{cusp} }} \newcommand{\elliptic}{{\mathrm{ell}}} \newcommand{\ess}{{\mathrm{ess}}} \newcommand{\even}{\text{even}} \newcommand{\fd}{{\mathrm{fd}}} \newcommand{\fg}{{\mathrm{fg}}} \newcommand{\fin}{{\mathrm{fin}}} \newcommand{\free}{{\mathrm{free}}} \newcommand{\ft}{\mathrm{ft}} \newcommand{\hol}{\text{hol}} \newcommand{\holonomy}{{\mathrm{holon}}} \newcommand{\holomorphic}{\text{holo}} \newcommand{\inc}{{\mathrm{inc}}} \newcommand{\irr}{{\mathrm{irr}}} \newcommand{\isotrop}{\mathrm{isotrop}} \newcommand{\lf}{{\mathrm{lf}}} \newcommand{\lft}{\mathrm{lft}} \newcommand{\odd}{\text{odd}} \newcommand{\perf}{{\mathrm{perf}}} \newcommand{\poly}{\mathrm{poly}} \newcommand{\prop}{{\mathrm{prop}}} \newcommand{\qproj}{{\mathrm{qproj}}} \newcommand{\ram}{{\mathrm{ram}}} \newcommand{\red}{{ \text{red} }} \newcommand{\reg}{\mathrm{reg}} \newcommand{\semi}{{\mathrm{semi}}} \newcommand{\semisimple}{{\mathrm{ss}}} \newcommand{\semisimplification}{{\mathrm{ss}}} \newcommand{\sing}{{\mathrm{sing}}} \newcommand{\smol}{{\mathrm{small}}} \newcommand{\snc}{{\mathrm{snc}}} \newcommand{\ss}{{\mathrm{ss}}} \newcommand{\stable}{\mathrm{st}} \newcommand{\std}{\text{std}} \newcommand{\trop}{\mathrm{trop}} \newcommand{\unstable}{\mathrm{unst}} \newcommand{\vamp}{{\mathrm{v.amp}}} \newcommand{\zar}{{\mathrm{zar}}} \newcommand{\ab}{{\operatorname{ab}}} \newcommand{\ad}{{ \operatorname{ad}}} \newcommand{\Ad}{{ \operatorname{Ad} }} \newcommand{\adjoint}{\dagger} \newcommand{\ae}{{ \text{a.e.} }} \newcommand{\afp}{A_{/\FF_p}} \newcommand{\AG}{\operatorname{AG}} \newcommand{\AGL}{\operatorname{AGL}} \newcommand{\AJ}{\operatorname{AJ}} \newcommand{\Alb}{\operatorname{Alb}} \newcommand{\Amp}{{\operatorname{Amp}}} \newcommand{\Ann}{\operatorname{Ann}} \newcommand{\AO}{\operatorname{AO}} \newcommand{\arccot}{\operatorname{arccot}} \newcommand{\arccsc}{\operatorname{arccsc}} \newcommand{\arcsec}{\operatorname{arcsec}} \newcommand{\area}{\operatorname{area}} \newcommand{\Arg}{\operatorname{Arg}} \newcommand{\ASL}{\operatorname{ASL}} \newcommand{\Aut}{\operatorname{Aut}} \newcommand{\Ball}{{B}} \newcommand{\Base}{{ \operatorname{Base}}} \newcommand{\bb}{\operatorname{BB}} \newcommand{\bd}{{\del}} \newcommand{\Betti}{{\operatorname{Betti}}} \newcommand{\BiHol}{\operatorname{BiHol}} \newcommand{\Bil}{\operatorname{Bil}} \newcommand{\Bl}{\operatorname{Bl}} \newcommand{\BM}{{\operatorname{BM}}} \newcommand{\Brauer}{\mathrm{Br}} \newcommand{\Bs}{\operatorname{Bs}} \newcommand{\by}{\times} \newcommand{\candim}{\operatorname{candim}} \newcommand{\Cart}{\operatorname{Cart}} \newcommand{\CDiv}{\operatorname{CDiv}} \newcommand{\CF}{\operatorname{CF}} \newcommand{\CH}{{\operatorname{CH}}} \newcommand{\ch}{\operatorname{ch}} \newcommand{\character}{\operatorname{ch}} \newcommand{\characteristic}{\operatorname{char}} \newcommand{\charpoly}{{\mathrm{charpoly}}} \newcommand{\chern}{{\mathrm{ch}}} \newcommand{\chp}{\operatorname{ch. p}} \newcommand{\Chow}{{\operatorname{Ch}}} \newcommand{\cl}{{ \operatorname{cl}}} \newcommand{\Cl}{\operatorname{Cl}} \newcommand{\CaCl}{\operatorname{CaCl}} \newcommand{\kxnz}{k[x_0, \cdots, x_{n}]} \newcommand{\codom}{\operatorname{codom}} \newcommand{\codim}{\operatorname{codim}} \newcommand{\coev}{\operatorname{coev}} \newcommand{\coh}{\operatorname{coh}} \newcommand{\cohdim}{\operatorname{cohdim}} \newcommand{\coim}{\operatorname{coim}} \newcommand{\coinfl}{\operatorname{coinf}} \newcommand{\coinv}{{\operatorname{coinv}}} \newcommand{\coker}{\operatorname{coker}} \newcommand{\colspace}{\operatorname{colspace}} \newcommand{\compact}{\operatorname{cpt}} \newcommand{\Cone}{{ \mathrm{Cone} }} \newcommand{\cone}{\operatorname{cone}} \newcommand{\Conf}{{\mathrm{Conf}}} \newcommand{\Conj}{{\mathrm{Conj}}} \newcommand{\const}{{\operatorname{const.}}} \newcommand{\cores}{\operatorname{coRes}} \newcommand{\corank}{\operatorname{corank}} \newcommand{\covol}{\operatorname{coVol}} \newcommand{\Cox}{{ \operatorname{Cox} }} \newcommand{\CP}{{\mathbf{CP}}} \newcommand{\Crit}{\operatorname{Crit}} \newcommand{\crit}{\operatorname{crit}} \newcommand{\cross}{\times} \newcommand{\csch}{\operatorname{csch}} \newcommand{\cts}{\text{cts}} \newcommand{\curl}{\operatorname{curl}} \newcommand{\Curv}{\operatorname{Curv}} \newcommand{\Cyl}{{ \mathrm{Cyl} }} \newcommand{\Deck}{\operatorname{Deck}} \newcommand{\ddim}{\operatorname{ddim}} \newcommand{\Def}{\operatorname{Def}} \newcommand{\definedas}{\coloneqq} \newcommand{\del}{{\partial}} \newcommand{\delbar}{{ \bar{\del}}} \newcommand{\depth}{\operatorname{depth}} \newcommand{\Der}{{ \operatorname{Der} }} \newcommand{\det}{\operatorname{det}} \newcommand{\diag}{\operatorname{diag}} \newcommand{\diam}{{\operatorname{diam}}} \newcommand{\Diff}{\operatorname{Diff}} \newcommand{\Diffeo}{{\operatorname{Diffeo}}} \newcommand{\disc}{{\operatorname{disc}}} \newcommand{\discriminant}{{\Delta}} \newcommand{\Disk}{{\operatorname{Disk}}} \newcommand{\Dist}{\operatorname{Dist}} \newcommand{\dist}{\operatorname{dist}} \newcommand{\div}{\operatorname{div}} \newcommand{\Div}{\operatorname{Div}} \newcommand{\dlog}{\operatorname{dLog}} \newcommand{\dom}{\operatorname{dom}} \newcommand{\dP}{{\operatorname{dP}}} \newcommand{\DSt}{{ \operatorname{DSt}}} \newcommand{\Eff}{\operatorname{Eff}} \newcommand{\Emb}{{\operatorname{Emb}}} \newcommand{\En}{{\operatorname{En}}} \newcommand{\Endo}{{ \operatorname{End} }} \newcommand{\eo}{{\operatorname{eo}}} \newcommand{\essdim}{\operatorname{essdim}} \newcommand{\et}{\text{ét}} \newcommand{\Et}{\text{Ét}} \newcommand{\eul}{{\operatorname{eul}}} \newcommand{\ev}{\operatorname{ev}} \newcommand{\exist}{{\exists}} \newcommand{\Exists}{\operatorname{\exists}} \newcommand{\Ext}{\operatorname{Ext}} \newcommand{\EZ}{\operatorname{EZ}} \newcommand{\F}{{\operatorname{F}}} \newcommand{\fet}{\text{fét}} \newcommand{\ff}{\operatorname{ff}} \newcommand{\Fil}{{\operatorname{Fil}}} \newcommand{\Fl}{\operatorname{Fl}} \newcommand{\Flat}{{\operatorname{Flat}}} \newcommand{\Forall}{\operatorname{\forall}} \newcommand{\Forget}{Forget} \newcommand{\fp}{{ \operatorname{fp} }} \newcommand{\fppf}{{\operatorname{fppf}}} \newcommand{\Fppf}{\mathrm{\operatorname{Fppf}}} \newcommand{\fpqc}{{\operatorname{fpqc}}} \newcommand{\Fr}{\operatorname{Fr}} \newcommand{\Frac}{\operatorname{Frac}} \newcommand{\Frame}{\operatorname{Frame}} \newcommand{\Frob}{\operatorname{Frob}} \newcommand{\gal}{{ \operatorname{Gal}}} \newcommand{\gendim}{\operatorname{gendim}} \newcommand{\generic}{{\mathrm{gen}}} \newcommand{\genus}{{\operatorname{gen}}} \newcommand{\GF}{{\mathbf{GF}}} \newcommand{\GL}{\operatorname{GL}} \newcommand{\gp}{{\operatorname{gp} }} \newcommand{\Gr}{{\operatorname{Gr}}} \newcommand{\grad}{\operatorname{grad}} \newcommand{\graded}{\operatorname{gr}} \newcommand{\grdim}{{\operatorname{gr\,dim}}} \newcommand{\Griff}{\operatorname{Griff}} \newcommand{\GU}{\operatorname{GU}} \newcommand{\GW}{{\operatorname{GW}}} \newcommand{\hash}{{\sharp}} \newcommand{\HC}{{\operatorname{HC}}} \newcommand{\hd}{\operatorname{Head}} \newcommand{\he}{\operatorname{h.e.}} \newcommand{\height}{\operatorname{ht}} \newcommand{\HF}{\operatorname{HF}} \newcommand{\HFK}{\operatorname{HFK}} \newcommand{\Hilb}{\operatorname{Hilb}} \newcommand{\hilbdim}{\operatorname{hilbdim}} \newcommand{\Hol}{\operatorname{Hol}} \newcommand{\Hom}{{ \operatorname{Hom} }} \newcommand{\Homcx}{\operatorname{Hom}^{\bullet}} \newcommand{\Homeo}{{\operatorname{Homeo}}} \newcommand{\Honda}{\mathrm{\operatorname{Honda}}} \newcommand{\HP}{{\operatorname{HP}}} \newcommand{\HT}{{\operatorname{HT}}} \newcommand{\hyp}{{\operatorname{hyp}}} \newcommand{\Id}{\operatorname{Id}} \newcommand{\id}{\operatorname{id}} \newcommand{\im}{\operatorname{im}} \newcommand{\Index}{\operatorname{Index}} \newcommand{\Inertia}{{\mathrm{In}}} \newcommand{\infl}{\operatorname{inf}} \newcommand{\Inn}{\operatorname{Inn}} \newcommand{\Intersect}{\bigcap} \newcommand{\Isom}{{\mathrm{Isom}}} \newcommand{\Jac}{\operatorname{Jac}} \newcommand{\jan}{\operatorname{Jan}} \newcommand{\JCF}{\operatorname{JCF}} \newcommand{\Kahler}{\operatorname{Kähler}} \newcommand{\Kl}{\operatorname{Kl}} \newcommand{\ko}{{\operatorname{ko}}} \newcommand{\krulldim}{\operatorname{krulldim}} \newcommand{\ks}{\operatorname{ks}} \newcommand{\Kthree}{\mathrm{K3}} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\Ld}{\operatorname{{\mathbb{L} }}} \newcommand{\len}{\operatorname{len}} \newcommand{\length}{\operatorname{length}} \newcommand{\LGr}{{\operatorname{LGr}}} \newcommand{\Li}{\mathrm{Li}} \newcommand{\lk}{\operatorname{lk}} \newcommand{\Log}{\operatorname{Log}} \newcommand{\Maps}{\operatorname{Maps}} \newcommand{\mat}{\operatorname{mat}} \newcommand{\Mat}{\operatorname{Mat}} \newcommand{\maxspec}{{\operatorname{maxSpec}}} \newcommand{\MC}{\operatorname{MC}} \newcommand{\MCG}{{\operatorname{MCG}}} \newcommand{\Mero}{\operatorname{Mero}} \newcommand{\mHH}{{\operatorname{HH}}} \newcommand{\minor}{{\operatorname{minor}}} \newcommand{\minpoly}{{\operatorname{minpoly}}} \newcommand{\mod}{\operatorname{mod}} \newcommand{\Mor}{\operatorname{Mor}} \newcommand{\mproj}{\operatorname{mProj}} \newcommand{\mspec}{\operatorname{mSpec}} \newcommand{\MT}{\operatorname{MT}} \newcommand{\mTHH}{{\operatorname{THH}}} \newcommand{\mult}{{\operatorname{mult}}} \newcommand{\MW}{\operatorname{MW}} \newcommand{\nd}{\operatorname{nd}} \newcommand{\NE}{{\operatorname{NE}}} \newcommand{\Nef}{\operatorname{Nef}} \newcommand{\nil}{{\operatorname{nil}}} \newcommand{\Norm}{\operatorname{Nm}} \newcommand{\NS}{{\operatorname{NS}}} \newcommand{\nullity}{\operatorname{nullity}} \newcommand{\nullspace}{\operatorname{nullspace}} \newcommand{\Num}{\operatorname{Num}} \newcommand{\Ob}{{\operatorname{Ob}}} \newcommand{\obs}{\operatorname{obs}} \newcommand{\Obs}{\operatorname{Obs}} \newcommand{\OFrame}{\operatorname{OFrame}} \newcommand{\OGr}{{\operatorname{OGr}}} \newcommand{\Op}{{\operatorname{Op}}} \newcommand{\Ord}{{ \mathrm{Ord} }} \newcommand{\order}{{\operatorname{Ord}}} \newcommand{\oriented}{{ \operatorname{oriented} }} \newcommand{\Orth}{{\operatorname{O}}} \newcommand{\Out}{\operatorname{Out}} \newcommand{\per}{\operatorname{per}} \newcommand{\period}{\operatorname{period}} \newcommand{\PGL}{\operatorname{PGL}} \newcommand{\PHS}{\operatorname{PHS}} \newcommand{\Pic}{\operatorname{Pic}} \newcommand{\Pin}{{\operatorname{Pin}}} \newcommand{\Pl}{\operatorname{Pl}} \newcommand{\Places}{{\operatorname{Places}}} \newcommand{\PO}{{\operatorname{PO}}} \newcommand{\pr}{{\operatorname{pr}}} \newcommand{\prim}{{\operatorname{prim}}} \newcommand{\prin}{\operatorname{prin}} \newcommand{\Prin}{\operatorname{Prin}} \newcommand{\Proj}{\operatorname{Proj}} \newcommand{\projection}{\operatorname{proj}} \newcommand{\PSL}{{\operatorname{PSL}}} \newcommand{\PSU}{{\operatorname{PSU}}} \newcommand{\pt}{{\operatorname{pt}}} \newcommand{\PV}{{ \operatorname{PV} }} \newcommand{\qc}{{\operatorname{qc}}} \newcommand{\QHB}{\operatorname{QHB}} \newcommand{\qst}{{\quad \operatorname{such that} \quad}} \newcommand{\Quot}{\operatorname{Quot}} \newcommand{\radic}{\operatorname{rad}} \newcommand{\Rad}{\operatorname{Rad}} \newcommand{\Ram}{\operatorname{Ram}} \newcommand{\range}{\operatorname{range}} \newcommand{\rank}{\operatorname{rank}} \newcommand{\Rat}{\operatorname{Rat}} \newcommand{\RCF}{\operatorname{RCF}} \newcommand{\Rd}{\operatorname{{\mathbb{R} }}} \newcommand{\Rees}{{\operatorname{Rees}}} \newcommand{\Reg}{\operatorname{Reg}} \newcommand{\Rel}{\operatorname{Rel}} \newcommand{\reldim}{\operatorname{reldim}} \newcommand{\res}{\operatorname{res}} \newcommand{\Res}{\operatorname{Res}} \newcommand{\resultant}{{\mathrm{res}}} \newcommand{\RHom}{\operatorname{\mathbb{R}Hom}} \newcommand{\Ric}{\operatorname{Ric}} \newcommand{\rc}{{\operatorname{rc}}} \newcommand{\rot}{\operatorname{rot}} \newcommand{\rowspace}{\operatorname{rowspace}} \newcommand{\RP}{{\mathbf{RP}}} \newcommand{\RREF}{\operatorname{RREF}} \newcommand{\Sat}{\operatorname{Sat}} \newcommand{\Sec}{\operatorname{Sec}} \newcommand{\sech}{{ \mathrm{sech} }} \newcommand{\selfmap}{{\circlearrowleft}} \newcommand{\Sel}{\operatorname{Sel}} \newcommand{\SF}{\operatorname{SF}} \newcommand{\SGr}{{\operatorname{SGr}}} \newcommand{\sgn}{\operatorname{sgn}} \newcommand{\SHerm}{{\operatorname{SHerm}}} \newcommand{\Sieg}{{\mathrm{Sieg}}} \newcommand{\sign}{\operatorname{sign}} \newcommand{\signature}{\operatorname{sig}} \newcommand{\Sim}{\operatorname{Sim}} \newcommand{\sinc}{\operatorname{sinc}} \newcommand{\Sing}{{\operatorname{Sing}}} \newcommand{\size}{{\sharp}} \newcommand{\SL}{{\operatorname{SL}}} \newcommand{\slope}{{\mathrm{slope}}} \newcommand{\Sm}{{\operatorname{Sm}}} \newcommand{\sm}{\setminus} \newcommand{\smz}{\setminus\theset{0}} \newcommand{\SO}{{\operatorname{SO}}} \newcommand{\soc}{\operatorname{Soc}} \newcommand{\spanof}{\operatorname{span}} \newcommand{\Spc}{\operatorname{Spc}} \newcommand{\Spec}{\operatorname{Spec}} \newcommand{\Spf}{\operatorname{Spf}} \newcommand{\Spin}{{\operatorname{Spin}}} \newcommand{\spinornorm}{{\mathrm{spinornorm}}} \newcommand{\Sq}{\operatorname{Sq}} \newcommand{\sq}{\square} \newcommand{\SSym}{{\operatorname{SSym}}} \newcommand{\Stab}{{\operatorname{Stab}}} \newcommand{\Star}{\operatorname{Star}} \newcommand{\Sub}{{\mathrm{Sub}}} \newcommand{\submfds}{\operatorname{SubMfds}} \newcommand{\SU}{{\operatorname{SU}}} \newcommand{\Sum}{\sum} \newcommand{\supp}{\operatorname{supp}} \newcommand{\Supp}{{\operatorname{Supp}}} \newcommand{\Sw}{{\mathrm{Sw}}} \newcommand{\Syl}{{\operatorname{Syl}}} \newcommand{\Sym}{\operatorname{Sym}} \newcommand{\sym}{\operatorname{Sym}^*} \newcommand{\Symalg}{\sym} \newcommand{\Symb}{\operatorname{Symb}} \newcommand{\Symbil}{\operatorname{SymBil}} \newcommand{\Symp}{{\operatorname{Sp}}} \newcommand{\Tatesymbol}{\operatorname{TateSymb}} \newcommand{\Taut}{\operatorname{Taut}} \newcommand{\TC}{{\operatorname{TC}}} \newcommand{\TCH}{{\operatorname{TCH}}} \newcommand{\Th}{\operatorname{Th}} \newcommand{\THC}{{\operatorname{THC}}} \newcommand{\thinrank}{T_n\dash\operatorname{rank}} \newcommand{\Todd}{\operatorname{Td}} \newcommand{\Tor}{\operatorname{Tor}} \newcommand{\tors}{{\operatorname{tors}}} \newcommand{\Tot}{{ \operatorname{Tot} }} \newcommand{\TP}{{\operatorname{TP}}} \newcommand{\tr}{{\mathrm{tr}}} \newcommand{\Tr}{\operatorname{Tr}} \newcommand{\trace}{\operatorname{tr}} \newcommand{\Trace}{\operatorname{Trace}} \newcommand{\trdeg}{{\mathrm{trdeg}}} \newcommand{\transfer}{\operatorname{transfer}} \newcommand{\triv}{\operatorname{triv}} \newcommand{\Triv}{\operatorname{Triv}} \newcommand{\tspt}{{\{\operatorname{pt}\}}} \newcommand{\txand}{{\operatorname{ and }}} \newcommand{\txor}{{\operatorname{ or }}} \newcommand{\type}{{\operatorname{type}}} \newcommand{\U}{{\operatorname{U}}} \newcommand{\UFrame}{\operatorname{UFrame}} \newcommand{\unital}{{\operatorname{unital}}} \newcommand{\Union}{\bigcup} \newcommand{\unram}{{\scriptscriptstyle\mathrm{un}}} \newcommand{\USp}{{\operatorname{USp}}} \newcommand{\val}{{\operatorname{val}}} \newcommand{\Verts}{{ \operatorname{Verts} }} \newcommand{\vol}{\operatorname{vol}} \newcommand{\volume}{\operatorname{Vol}} \newcommand{\Vor}{\operatorname{Vor}} \newcommand{\WDiv}{\operatorname{WDiv}} \newcommand{\WP}{{\mathbf{WP}}} \newcommand{\Wedge}{\bigwedge} \newcommand{\weight}{{ \operatorname{weight} }} \newcommand{\Wittvectors}{{\mathbb{W}}} \newcommand{\wt}{{\operatorname{wt}}} \newcommand{\zbar}{\bar{z}} \newcommand{\ZHB}{\operatorname{ZHB}} \newcommand{\Ag}{{\mathcal{A}_g}} \newcommand{\agbar}{\bar{\Ag}} \newcommand{\Ahat}{\hat{ \operatorname{A}}_g} \newcommand{\B}{{\mathbf{B}}} \newcommand{\bmgn}{{ \bar{\mathcal{M}}_{g, n} }} \newcommand{\boxtensor}{\boxtimes} \newcommand{\Cc}{{\check{C}}} \newcommand{\cechH}{{\check{H}}} \newcommand{\coind}{\operatorname{coInd}} \newcommand{\D}{{ \mathsf{D} }} \newcommand{\dualnumbers}{{ [\eps] / \eps^2 }} \newcommand{\E}{{\mathbf{E}}} \newcommand{\fracId}{{ \ddot{\Id} }} \newcommand{\G}{{\mathsf{G}}} \newcommand{\hocolim}{\operatorname{hocolim}} \newcommand{\HZ}{{H\ZZ}} \newcommand{\I}{\mathrm{I}} \newcommand{\II}{\mathrm{II}} \newcommand{\III}{\mathrm{III}} \newcommand{\intcl}{\operatorname{cl}^{\mathrm{int}}} \newcommand{\algcl}{\operatorname{cl}^{\mathrm{alg}}} \newcommand{\sepcl}{\operatorname{cl}^{\mathrm{sep}}} \newcommand{\iso}{\isomorphic} \newcommand{\IV}{\mathrm{IV}} \newcommand{\K}{{\mathsf{K}}} \newcommand{\kbar}{{ \overline{k} }} \newcommand{\kfq}{K_{/\FF_q}} \newcommand{\KH}{\K^{\scriptscriptstyle \mathrm{H}}} \newcommand{\KM}{\K^{\scriptstyle\mathrm{M}}} \newcommand{\KMimp}{\hat{\K}^{\scriptscriptstyle \mathrm{M}}} \newcommand{\KMW}{\K^{\scriptscriptstyle \mathrm{MW}}} \newcommand{\ksep}{\sepclosure{k}} \newcommand{\lderive}{\leftderive} \newcommand{\leftderive}{{\mathbf{L}}} \newcommand{\liealgk}{{ \liealg_{/k} }} \newcommand{\lkt}{{L_{\mathrm{K3}}}} \newcommand{\lktcc}{{L_{\mathrm{K3}, \CC}}} \newcommand{\lkttd}{{L_{\mathrm{K3}, 2d}}} \newcommand{\Ltensor}{\overset{\mathbb{L}}{ \otimes}} \newcommand{\mbar}{\bar{\mathcal{M}}} \newcommand{\Mg}{{\mathcal{M}_g}} \newcommand{\mg}{{ \mathcal{M}_{g} }} \newcommand{\Mgbar}{\bar{\Mg}} \newcommand{\Mgn}{{ \mathcal{M}_{g, n} }} \newcommand{\Mell}{{ \mathcal{M}_{\mathrm{ell}} }} \newcommand{\mH}{{ \mathsf{H} }} \newcommand{\mviso}{{\mapsvia{\sim}}} \newcommand{\OX}{{\mathcal{O}_X}} \newcommand{\Presh}{\presh} \newcommand{\Prod}{\displaystyle\prod} \newcommand{\primetop}{{\scriptscriptstyle \mathrm{prime-to-}p}} \newcommand{\ptd}{{\scriptstyle { \ast } }} \newcommand{\qiso}{\homotopic} \newcommand{\rderive}{\rightderive} \newcommand{\resprod}{\prod^{\res}} \newcommand{\restensor}{\bigotimes^{\res}} \newcommand{\rightderive}{{\mathbf{R}}} \newcommand{\rrarrows}{\rightrightarrows} \newcommand{\sdot}{{ \mathsf{S}_{\cdot} }} \newcommand{\Sgn}{{ \Sigma_{g, n} }} \newcommand{\shriek}{{ ! }} \newcommand{\Spinc}{\mathrm{Spin}^{{ \scriptscriptstyle \mathbf C} }} \newcommand{\T}{{\mathbf{T}}} \newcommand{\Tensor}{\bigotimes} \newcommand{\tensor}{\otimes} \newcommand{\tgn}{{ \mathcal{T}_{g, n} }} \newcommand{\TM}{{\T M}} \newcommand{\Totprod}{\Tot^{\Pi}} \newcommand{\Totsum}{\Tot^{\oplus}} \newcommand{\TX}{{\T X}} \newcommand{\Ug}{{\mathcal{U}(\mathfrak{g}) }} \newcommand{\Uh}{{\mathcal{U}(\mathfrak{h}) }} \newcommand{\V}{{\textrm{V}}} \newcommand{\VI}{{\textrm{VI}}} \newcommand{\wdot}{{ \mathsf{w}_{\cdot} }} \newcommand{\Wedgepower}{\bigwedge\nolimits} \newcommand{\Xff}{{X_\mathrm{FF}}} \newcommand{\xpn}{{ x^{p^n} }} \newcommand{\ZHS}{\ZZ\operatorname{HS}} \newcommand{\ZVHS}{{ \ZZ\mathrm{VHS} }} \newcommand{\abuts}{\Rightarrow} \newcommand{\actson}{\curvearrowright} \newcommand{\actsonl}{\curvearrowleft} \newcommand{\asymptotic}{\ll} \newcommand{\capprod}{\frown} \newcommand{\containing}{\supseteq} \newcommand{\convolve}{\ast} \newcommand{\coveredby}{\leftleftarrows} \newcommand{\covers}{\rightrightarrows} \newcommand{\covariant}{\nabla} \newcommand{\cupprod}{\smile} \newcommand{\dash}{{\hbox{-}}} \newcommand{\decreasesto}{\searrow} \newcommand{\disjoint}{{\amalg}} \newcommand{\Disjoint}{\bigsqcup} \newcommand{\divergence}{{ \nabla\cdot }} \newcommand{\divides}{\mathrel{|}} \newcommand{\notdivides}{\nmid} \newcommand{\dV}{\,dV} \newcommand{\dalpha}{\,d\alpha} \newcommand{\dA}{\,dA} \newcommand{\dm}{\,dm} \newcommand{\dmu}{\,d\mu} \newcommand{\dn}{\,dn} \newcommand{\dphi}{\,d\phi} \newcommand{\dr}{\,dr} \newcommand{\drho}{\,d\rho} \newcommand{\ds}{\displaystyle} \newcommand{\dt}{\,dt} \newcommand{\dtau}{\,d\tau} \newcommand{\dtheta}{\,d\theta} \newcommand{\du}{\,du} \newcommand{\dw}{\,dw} \newcommand{\dx}{\,dx} \newcommand{\dxi}{\,d\xi} \newcommand{\dy}{\,dy} \newcommand{\dz}{\,dz} \newcommand{\dzbar}{\,d\bar{z}} \newcommand{\dzeta}{\,d\zeta} \newcommand{\embeds}{\hookrightarrow} \newcommand{\embedsdense}{{ \underset{ {\scriptscriptstyle\mathrm{dense}} }{\hookrightarrow} }} \newcommand{\eps}{{\varepsilon}} \newcommand{\freeprod}{\ast} \newcommand{\from}{\leftarrow} \newcommand{\gon}{{\dash\mathrm{gon}}} \newcommand{\gradient}{\nabla} \newcommand{\hodgestar}{\star} \newcommand{\homotopic}{\simeq} \newcommand{\hq}{{/}} \newcommand{\increasesto}{\nearrow} \newcommand{\injects}{\hookrightarrow} \newcommand{\injectivelim}{\varinjlim} \newcommand{\colim}{\operatorname*{colim}} \newcommand{\injectsfrom}{\hookleftarrow} \newcommand{\injresolve}{\leftleftarrows} \newcommand{\intersect}{\cap} \newcommand{\into}{\to} \newcommand{\iscontainedin}{\subseteq} \newcommand{\isomorphic}{{ \, \mapsvia{\sim}\, }} \newcommand{\join}{{ \ast }} \newcommand{\laplacian}{\Delta} \newcommand{\mapbackforth}{\operatorname*{\rightleftharpoons}} \newcommand{\mapstofrom}{\rightleftharpoons} \newcommand{\modmod}{\gitquot} \newcommand{\htyquot}{\gitquot} \newcommand{\normal}{{~\trianglelefteq~}} \newcommand{\normalizer}{{ N }} \newcommand{\notimplies}{\centernot\implies} \newcommand{\ofrom}{\overset{\circ}{\leftarrow}} \newcommand{\onto}{\twoheadhthtarrow} \newcommand{\oto}{\overset{\circ}{\rightarrow}} \newcommand{\padic}{p\dash\text{adic}} \newcommand{\plocal}{{ \scriptsize {}_{ \localize{p} } }} \newcommand{\projectivelim}{\varprojlim} \newcommand{\projresolve}{\rightrightarrows} \newcommand{\proportional}{\propto} \newcommand{\qed}{\hfill\ensuremath{\blacksquare}} \newcommand{\rational}{\rationalmap} \newcommand{\rationalmap}{\dashrightarrow} \newcommand{\semidirect}{\rtimes} \newcommand{\st}{{~\mathrel{\Big\vert}~}} \newcommand{\suchthat}{\st} \newcommand{\surjects}{\twoheadrightarrow} \newcommand{\too}{\longrightarrow} \newcommand{\transverse}{\pitchfork} \newcommand{\uniformlyconverges}{\rightrightarrows} \newcommand{\union}{\cup} \newcommand{\unioninfty}{{\union\theset{\infty}}} \newcommand{\up}{\uparrow} \newcommand{\wait}{{-}} \newcommand{\wedgeprod}{\vee} \newcommand{\wreath}{\wr} \newcommand{\bA}{{\mathbb{A}}} \newcommand{\bB}{{\mathbb{B}}} \newcommand{\bC}{{\mathbb{C}}} \newcommand{\bD}{{\mathbb{D}}} \newcommand{\bE}{{\mathbb{E}}} \newcommand{\bF}{{\mathbb{F}}} \newcommand{\bG}{{\mathbb{G}}} \newcommand{\bH}{{\mathbb{H}}} \newcommand{\bI}{{\mathbb{I}}} \newcommand{\bJ}{{\mathbb{J}}} \newcommand{\bK}{{\mathbb{K}}} \newcommand{\bL}{{\mathbb{L}}} \newcommand{\bM}{{\mathbb{M}}} \newcommand{\bN}{{\mathbb{N}}} \newcommand{\bO}{{\mathbb{O}}} \newcommand{\bP}{{\mathbb{P}}} \newcommand{\bQ}{{\mathbb{Q}}} \newcommand{\bR}{{\mathbb{R}}} \newcommand{\bS}{{\mathbb{S}}} \newcommand{\bT}{{\mathbb{T}}} \newcommand{\bU}{{\mathbb{U}}} \newcommand{\bV}{{\mathbb{V}}} \newcommand{\bW}{{\mathbb{W}}} \newcommand{\bX}{{\mathbb{X}}} \newcommand{\bY}{{\mathbb{Y}}} \newcommand{\bZ}{{\mathbb{Z}}} \newcommand{\mfA}{{\mathfrak{A}}} \newcommand{\mfB}{{\mathfrak{B}}} \newcommand{\mfD}{{\mathfrak{D}}} \newcommand{\mfE}{{\mathfrak{E}}} \newcommand{\mfG}{{\mathfrak{G}}} \newcommand{\mfH}{{\mathfrak{H}}} \newcommand{\mfI}{{\mathfrak{I}}} \newcommand{\mfJ}{{\mathfrak{J}}} \newcommand{\mfK}{{\mathfrak{K}}} \newcommand{\mfL}{{\mathfrak{L}}} \newcommand{\mfM}{{\mathfrak{M}}} \newcommand{\mfN}{{\mathfrak{N}}} \newcommand{\mfO}{{\mathfrak{O}}} \newcommand{\mfP}{{\mathfrak{P}}} \newcommand{\mfQ}{{\mathfrak{Q}}} \newcommand{\mfR}{{\mathfrak{R}}} \newcommand{\mfT}{{\mathfrak{T}}} \newcommand{\mfU}{{\mathfrak{U}}} \newcommand{\mfV}{{\mathfrak{V}}} \newcommand{\mfW}{{\mathfrak{W}}} \newcommand{\mfY}{{\mathfrak{Y}}} \newcommand{\mfZ}{{\mathfrak{Z}}} \newcommand{\hA}{{\widehat{A}}} \newcommand{\hB}{{\widehat{B}}} \newcommand{\hC}{{\widehat{C}}} \newcommand{\hD}{{\widehat{D}}} \newcommand{\hE}{{\widehat{E}}} \newcommand{\hF}{{\widehat{F}}} \newcommand{\hG}{{\widehat{G}}} \newcommand{\hH}{{\widehat{H}}} \newcommand{\hI}{{\widehat{I}}} \newcommand{\hJ}{{\widehat{J}}} \newcommand{\hK}{{\widehat{K}}} \newcommand{\hL}{{\widehat{L}}} \newcommand{\hM}{{\widehat{M}}} \newcommand{\hN}{{\widehat{N}}} \newcommand{\hO}{{\widehat{O}}} \newcommand{\hP}{{\widehat{P}}} \newcommand{\hQ}{{\widehat{Q}}} \newcommand{\hR}{{\widehat{R}}} \newcommand{\hS}{{\widehat{S}}} \newcommand{\hT}{{\widehat{T}}} \newcommand{\hU}{{\widehat{U}}} \newcommand{\hV}{{\widehat{V}}} \newcommand{\hW}{{\widehat{W}}} \newcommand{\hX}{{\widehat{X}}} \newcommand{\hY}{{\widehat{Y}}} \newcommand{\hZ}{{\widehat{Z}}} \newcommand{\wA}{{\widetilde{A}}} \newcommand{\wB}{{\widetilde{B}}} \newcommand{\wC}{{\widetilde{C}}} \newcommand{\wD}{{\widetilde{D}}} \newcommand{\wE}{{\widetilde{E}}} \newcommand{\wF}{{\widetilde{F}}} \newcommand{\wG}{{\widetilde{G}}} \newcommand{\wH}{{\widetilde{H}}} \newcommand{\wI}{{\widetilde{I}}} \newcommand{\wJ}{{\widetilde{J}}} \newcommand{\wK}{{\widetilde{K}}} \newcommand{\wL}{{\widetilde{L}}} \newcommand{\wM}{{\widetilde{M}}} \newcommand{\wN}{{\widetilde{N}}} \newcommand{\wO}{{\widetilde{O}}} \newcommand{\wP}{{\widetilde{P}}} \newcommand{\wQ}{{\widetilde{Q}}} \newcommand{\wR}{{\widetilde{R}}} \newcommand{\wS}{{\widetilde{S}}} \newcommand{\wT}{{\widetilde{T}}} \newcommand{\wU}{{\widetilde{U}}} \newcommand{\wV}{{\widetilde{V}}} \newcommand{\wW}{{\widetilde{W}}} \newcommand{\wX}{{\widetilde{X}}} \newcommand{\wY}{{\widetilde{Y}}} \newcommand{\wZ}{{\widetilde{Z}}} \newcommand{\oA}{{\overline{A}}} \newcommand{\oB}{{\overline{B}}} \newcommand{\oC}{{\overline{C}}} \newcommand{\oD}{{\overline{D}}} \newcommand{\oE}{{\overline{E}}} \newcommand{\oF}{{\overline{F}}} \newcommand{\oG}{{\overline{G}}} \newcommand{\oH}{{\overline{H}}} \newcommand{\oI}{{\overline{I}}} \newcommand{\oJ}{{\overline{J}}} \newcommand{\oK}{{\overline{K}}} \newcommand{\oL}{{\overline{L}}} \newcommand{\oM}{{\overline{M}}} \newcommand{\oN}{{\overline{N}}} \newcommand{\oO}{{\overline{O}}} \newcommand{\oP}{{\overline{P}}} \newcommand{\oQ}{{\overline{Q}}} \newcommand{\oR}{{\overline{R}}} \newcommand{\oS}{{\overline{S}}} \newcommand{\oT}{{\overline{T}}} \newcommand{\oU}{{\overline{U}}} \newcommand{\oV}{{\overline{V}}} \newcommand{\oW}{{\overline{W}}} \newcommand{\oX}{{\overline{X}}} \newcommand{\oY}{{\overline{Y}}} \newcommand{\oZ}{{\overline{Z}}} \newcommand{\uA}{{\underline{A}}} \newcommand{\uB}{{\underline{B}}} \newcommand{\uC}{{\underline{C}}} \newcommand{\uD}{{\underline{D}}} \newcommand{\uE}{{\underline{E}}} \newcommand{\uF}{{\underline{F}}} \newcommand{\uG}{{\underline{G}}} \newcommand{\uH}{{\underline{H}}} \newcommand{\uI}{{\underline{I}}} \newcommand{\uJ}{{\underline{J}}} \newcommand{\uK}{{\underline{K}}} \newcommand{\uL}{{\underline{L}}} \newcommand{\uM}{{\underline{M}}} \newcommand{\uN}{{\underline{N}}} \newcommand{\uO}{{\underline{O}}} \newcommand{\uP}{{\underline{P}}} \newcommand{\uQ}{{\underline{Q}}} \newcommand{\uR}{{\underline{R}}} \newcommand{\uS}{{\underline{S}}} \newcommand{\uT}{{\underline{T}}} \newcommand{\uU}{{\underline{U}}} \newcommand{\uV}{{\underline{V}}} \newcommand{\uW}{{\underline{W}}} \newcommand{\uX}{{\underline{X}}} \newcommand{\uY}{{\underline{Y}}} \newcommand{\uZ}{{\underline{Z}}} \newcommand{\Co}{{\mathrm{Co}}} \newcommand{\Nik}{{\mathrm{Nik}}} \newcommand{\Nod}{{\mathrm{Nod}}} \newcommand{\latI}{\mathrm{I}} \newcommand{\latII}{\mathrm{II}} \newcommand{\lEn}{L_{\mathrm{En}}} \newcommand{\lEnII}{{\mathrm{II}}_{1, 9}} \newcommand{\lias}{L_{\mathrm{IAS}}} \newcommand{\liasplus}{\lias^+} \newcommand{\liasminus}{\lias^-} \newcommand{\rhok}{\rho_{\mathrm{K3}}} \newcommand{\rhoias}{\rho_{\mathrm{IAS}}} \newcommand{\utor}{^{\mathrm{tor}}} \newcommand{\dnor}{_{\mathrm{nor}}} \newcommand{\fco}{F_{\Co}} \newcommand{\fell}{F_{ \mathrm{ell} }} \newcommand{\fen}{F_{\En}} \newcommand{\fentwo}{F_{\En,2}} \newcommand{\ftd}{F_{2d}} \newcommand{\fttz}{F_{(2,2,0)}} \newcommand{\ofco}{\overline{F}_{\Co}} \newcommand{\ofen}{\overline{F}_{\En}} \newcommand{\ofentwo}{\overline{F}_{\En,2}} \newcommand{\ofttz}{\overline{F}_{(2,2,0)}} \newcommand{\ten}{T_{\En}} \newcommand{\tdp}{T_{\dP}} \newcommand{\sdp}{S_{\dP}} \newcommand{\sen}{S_{\En}} \newcommand{\gdp}{{\Gamma_{\dP}}} \newcommand{\gent}{{\Gamma_{\En, 2}}} \newcommand{\gell}{\Gamma^{ \mathrm{ell} }} \newcommand{\tell}{T_{ \mathrm{ell} }} \newcommand{\idp}{\iota_{\dP}} \newcommand{\ien}{\iota_{\En}} \newcommand{\Idp}{I_{\dP}} \newcommand{\Ien}{I_{\En}} \newcommand{\inik}{\iota_{ \Nik }} \newcommand{\Inik}{I_{ \Nik }} \newcommand{\ienzero}{\iota_{\En, 0}} \newcommand{\gref}{\Gamma\dref} \newcommand{\dref}{_{\rm r}} \newcommand{\OrthObs}{\Orth_*} \newcommand{\ADE}{\mathrm{ADE}} \newcommand{\ADEBC}{\mathrm{ADE}+\mathrm{BC}} \newcommand{\tADE}{\widetilde{ \ADE }} \newcommand{\Bir}{\operatorname{Bir}} \newcommand{\Conv}{\operatorname{Conv}} \newcommand{\Exc}{\operatorname{Exc}} \newcommand{\GCD}{\operatorname{GCD}} \newcommand{\M}{\operatorname{M}} \newcommand{\Projm}{\operatorname{Projm}} \newcommand{\Specm}{\operatorname{Specm}} \newcommand{\Ver}{\operatorname{Ver}} \newcommand{\isoto}{\xrightarrow{\sim}} \newcommand{\wh}{\widehat} \newcommand{\la}{\langle} \newcommand{\ra}{\rangle} \newcommand{\lrc}{\lrcorner} \newcommand{\llc}{\llcorner} \newcommand{\urc}{\urcorner} \newcommand{\ulc}{\ulcorner} \newcommand{\uopp}{^{\rm opp}} \newcommand{\ubb}{^{\rm BB}} \newcommand{\dto}{\Rightarrow} \newcommand{\fign}{Fig.~\ref{fig:discforms}} \newcommand{\hoV}{\widehat{\overline V}} \newcommand{\hoD}{\widehat{\overline D}} \newcommand{\ooT}{\overline{\overline T}} \newcommand{\ias}{\operatorname{IAS}^2} \newcommand{\lge}{_{\ge0}} \newcommand{\ocC}{\overline{\mcc}} \newcommand{\lred}{_{\rm red}} \newcommand{\mr}{\bar r} \newcommand{\ma}{\bar a} \newcommand{\mdelta}{\bar \delta} \newcommand{\mk}{\bar k} \newcommand{\me}{\hat e} \newcommand{\miota}{\hat \iota} \newcommand{\oPic}{\overline{\Pic}} \newcommand{\ucox}{^{\rm cox}} \newcommand{\lir}{_{\rm ir}} \newcommand{\usat}{^{\rm sat}} \newcommand{\Cur}{\operatorname{Cur}} \newcommand{\ohV}{\overline{\hV}} \newcommand{\dgen}{_{\rm gen}} \newcommand{\dmon}{_{\rm mon}} \newcommand{\dias}{_{\rm IAS}} \newcommand{\dram}{_{\rm ram}} \newcommand{\drel}{_{\rm rel}} \newcommand{\dirr}{_{\rm irr}} \newcommand{\vrel}{V\drel} \newcommand{\virr}{V\dirr} \newcommand{\wref}{W\dref} \newcommand{\chref}{\ch\dref} \newcommand{\fref}{\mfF\dref} \newcommand{\fram}{\mfF\dram} \newcommand{\relpart}{\operatorname{rel}} \newcommand{\irrpart}{\operatorname{irr}} \newcommand{\fcref}{\mfC\dref} \newcommand{\fgen}{\mfF_{\rm gen}} \newcommand{\fsfref}{\mfF_S^{\fref}} \newcommand{\ofsfref}{\oF_S^{\fref}} \newcommand{\upar}{^{\rm par}} \newcommand{\dleft}{{}_{\rm left}} \newcommand{\dright}{{}_{\rm right}} \newcommand{\evn}{\text{even }n} \newcommand{\odn}{\text{odd }n} \newcommand{\BB}{\operatorname{BB}} \newcommand{\ConvOp}{\operatorname{Conv}} \newcommand{\perfOp}{\operatorname{perf}} \newcommand{\GIT}{\operatorname{GIT}} \newcommand{\isoGr}{\operatorname{IsoGr}} \newcommand{\FG}{F_\Gamma} \newcommand{\IA}{\mathrm{IA}} \newcommand{\IAD}{\mathrm{IAD}} \newcommand{\IARP}{\mathrm{IARP}} \newcommand{\OStab}{\Orth^*} \newcommand{\ZZtwoadic}{\ZZ_{\hat 2}} \newcommand{\cox}{\Cox} \newcommand{\irrelevant}{\mathrm{irr}} \newcommand{\relevant}{\mathrm{rel}} \newcommand{\rcop}{\mathrm{rc}} \newcommand{\opop}{\mathrm{op}} \newcommand{\liek}{\mathfrak{k}} \newcommand{\liev}{\mathfrak{v}} \newcommand{\tiling}{\mathcal{T}} \newcommand{\weylgroup}{\mathcal{W}} \newcommand{\diverge}{\uparrow} \newcommand{\uksba}{^{\mathrm{KSBA}}} \newcommand{\uktriv}{^{K\text{-}\mathrm{triv}}} \newcommand{\textand}{\text{ and }} \newcommand{\textelse}{\text{ otherwise }} \newcommand{\textfor}{\text{ for }} \newcommand{\textif}{\text{ if }} \newcommand{\textor}{\text{ or }} \newcommand{\where}{\text{ where }} \newcommand{\Poincare}{Poincar\'e} \newcommand{\Bbb}{\mathbb} \newcommand{\HalphenInvariants}{(10, 10, 1)} \newcommand{\EnriquesInvariants}{(10, 10, 0)} \newcommand{\abs}[1]{{\left\lvert {#1} \right\rvert}} \newcommand{\norm}[1]{{\left\lVert {#1} \right\rVert}} \newcommand{\normm}[1]{{\left\lVert \left\lVert {#1} \right\rVert\right\rVert}} \newcommand{\pnorm}[2]{{\left\lVert {#1} \right\rVert}_{#2}} \newcommand{\matt}[4]{{ \begin{bmatrix} {#1} & {#2} \\ {#3} & {#4} \end{bmatrix} }} \newcommand{\adjoin}[1]{{ \left[ \scriptstyle {#1} \right] }} \newcommand{\polynomialring}[1]{{ \left[ {#1} \right] }} \newcommand{\bracket}[1]{\left\langle #1 \right\rangle} \newcommand{\generators}[1]{\left\langle{#1}\right\rangle} \newcommand{\sqgens}[1]{\left[ {#1} \right]} \newcommand{\freeon}[1]{\left[ {#1} \right]} \newcommand{\dgens}[1]{\generators{\generators{ #1 }}} \newcommand{\ceiling}[1]{{\left\lceil #1 \right\rceil}} \newcommand{\floor}[1]{{\left\lfloor #1 \right\rfloor}} \newcommand{\bicomplex}[1]{{ {#1}_{\scriptscriptstyle \bullet, \bullet}}} \newcommand{\cobicomplex}[1]{{ {#1}^{\scriptscriptstyle \bullet, \bullet}}} \newcommand{\cocomplex}[1]{{ {#1}^{\scriptscriptstyle \bullet}}} \newcommand{\complex}[1]{{ {#1}_{\scriptscriptstyle \bullet}}} \newcommand{\decfiltration}[1]{{#1}_{\bullet}} \newcommand{\incfiltration}[1]{{#1}^{\bullet}} \newcommand{\ctz}[1]{\, {{\converges{{#1} \to\infty}\longrightarrow 0}} \,} \newcommand{\fps}[1]{{\llbracket #1 \rrbracket }} \newcommand{\formalpowerseries}[1]{\fps{#1}} \newcommand{\functionfield}[1]{{ \left( {#1} \right) }} \newcommand{\rff}[1]{\functionfield{#1}} \newcommand{\htyclass}[1]{{ \left[ {#1} \right] }} \newcommand{\ideal}[1]{\mathcal{#1}} \newcommand{\inner}[2]{{\left\langle {#1},~{#2} \right\rangle}} \newcommand{\invert}[1]{{ \left[ { \scriptstyle \frac{1}{#1} } \right] }} \newcommand{\localize}[1]{\left[ { \scriptstyle \inverseof{#1} } \right]} \newcommand{\plocalize}[1]{\primelocalize{#1}} \newcommand{\primelocalize}[1]{\left[ { \scriptstyle \inverseof{({#1}^c)} } \right]} \newcommand{\fls}[1]{(\hspace{-0.25em}( #1 )\hspace{-0.22em})} \newcommand{\laurentseries}[1]{\fls{#1}} \newcommand{\embedsvia}[1]{\xhookrightarrow{#1}} \newcommand{\open}[1]{\overset{\circ}{#1}} \newcommand{\poisbrack}[2]{{\left\{ {#1},~{#2} \right\} }} \newcommand{\dcoset}[3]{{#1}\mkern-3mu\diagdown\mkern-3mu{}^{#2}\mkern-3mu\diagup\mkern-3mu{#3}} \newcommand{\dcosetl}[2]{{#1}\mkern-3mu\diagdown\mkern-3mu{}^{#2}} \newcommand{\dcosetr}[2]{{#1}\mkern-3mu\diagup\mkern-3mu{#2}} \newcommand{\leftquotient}[2]{{#1}\mkern-3mu\diagdown\mkern-3mu{}^{#2}} \newcommand{\gitquot}{\mathbin{/\!/}} \newcommand{\jacobsonrad}[1]{{J ({#1}) }} \newcommand{\nilrad}[1]{{\sqrt{0_{#1}} }} \newcommand{\Restriction}[2]{\mathrm{Res}^{#1}_{#2}} \newcommand{\coRestriction}[2]{\mathrm{coRes}^{#1}_{#2}} \newcommand{\Induction}[2]{\mathrm{Ind}^{#1}_{#2}} \newcommand{\coInduction}[2]{\mathrm{coInd}^{#1}_{#2}} \newcommand{\sheafify}[1]{\left( #1 \right)^{\scriptscriptstyle \mathrm{sh}}} \newcommand{\complete}[1]{{ {}_{ \hat{#1} } }} \newcommand{\takecompletion}[1]{{ \overbrace{#1}^{\widehat{\hspace{4em}}} }} \newcommand{\kv}{{ k_{\hat{v}} }} \newcommand{\Lv}{{ L_{\hat{v}} }} \newcommand{\coslice}[1]{_{{#1/}}} \newcommand{\liesover}[1]{{ {}_{/ {#1}} }} \newcommand{\slice}[1]{_{/ {#1}}} \newcommand{\symb}[2]{{ \qty{ #1 \over #2 } }} \newcommand{\tl}[2]{{ #1_1, \cdots, #1_{#2} }} \newcommand{\tlset}[2]{\theset{ {#1}_{1}, \cdots, {#1}_{#2} }} \newcommand{\tlz}[2]{{ #1_0, \cdots, #1_{#2} }} \newcommand{\tsl}[3]{\theset{ {#1}_{#2}, \cdots, {#1}_{#3} }} \newcommand{\fourier}[1]{\widehat{#1}} \newcommand{\cartpower}[1]{{ {}^{ \scriptscriptstyle\times^{#1} } }} \newcommand{\disjointpower}[2]{{#1}^{\scriptscriptstyle\coprod^{#2}}} \newcommand{\derivedtensorpower}[3]{{ {}^{ \scriptstyle {}_{#1} {\otimes_{#2}^{#3}} } }} \newcommand{\fiberpower}[3]{{#1}^{\scriptscriptstyle\fiberproduct{#2}^{#3}}} \newcommand{\powers}[1]{{ {}^{\cdot #1} }} \newcommand{\prodpower}[2]{{#1}^{\scriptscriptstyle\times^{#2}}} \newcommand{\skel}[1]{{ {}^{ (#1) } }} \newcommand{\smashpower}[2]{{#1}^{\scriptscriptstyle\smashprod^{#2}}} \newcommand{\sumpower}[1]{{ {}^{ \oplus{#1} } }} \newcommand{\tensorpower}[2]{{ {}^{ \scriptstyle\otimes_{#1}^{#2} } }} \newcommand{\tensorpowerk}[2]{{#1}^{\scriptscriptstyle\otimes_{k}^{#2}}} \newcommand{\transp}[1]{{ \, {}^{t}{ \left( #1 \right) } }} \newcommand{\wedgepower}[2]{{#1}^{\scriptscriptstyle\smashprod^{#2}}} \newcommand{\twistleft}[2]{{ {}^{#1} #2 }} \newcommand{\twistright}[2]{{ #2 {}^{#1} }} \newcommand{\globsec}[1]{{\Gamma\qty{#1} }} \newcommand{\addbase}[1]{{ {}_{pt} }} \newcommand{\catspan}[3]{\roof{#1}{#2}{#3}} \newcommand{\cptf}[1]{\overline{ #1 }} \newcommand{\cpt}[1]{\overline{#1}} \newcommand{\normalize}[1]{{#1}^{\nu}} \newcommand{\ksbacpt}[1]{\cpt{#1}^{\operatorname{KSBA}}} \newcommand{\normksbacpt}[1]{\normalize{ \cpt{#1} }} \newcommand{\bbcpt}[1]{\cpt{#1}^{ \operatorname{BB} }} \newcommand{\gitcpt}[1]{\cpt{#1}^{ \operatorname{GIT} }} \newcommand{\semifan}[1]{\mathcal{#1}} \newcommand{\semifans}[1]{\semifan{#1}_{\bullet}} \newcommand{\semitorfan}{\semifans{F}} \newcommand{\semitorcpt}[1]{\cpt{#1}^{\semitorfan}} \newcommand{\semifancpt}[2]{\cpt{#1}^{#2}} \newcommand{\torfan}{\Sigma} \newcommand{\torfans}{\torfan_{\bullet}} \newcommand{\torcpt}[1]{\semifancpt{#1}{ \torfans }} \newcommand{\coxfan}{\torfan^{\operatorname{Cox}}} \newcommand{\coxfans}{\torfans^{\operatorname{Cox}}} \newcommand{\coxcpt}[1]{\semifancpt{#1}{\coxfans}} \newcommand{\BBfan}{\Sigma^{\operatorname{BB}}} \newcommand{\halfpd}[1]{D_{#1}} \newcommand{\fullpd}[1]{\Omega_{#1}} \newcommand{\dmodgamma}[2]{{#1}/{#2}} \newcommand{\discgroup}[1]{A_{#1}} \newcommand{\diverges}{\mapstofrom} \newcommand{\langL}[1]{{}^{L}{#1}} \newcommand{\modulo}{{ \bigg/ }} \newcommand{\openimmerse}{\underset{\scriptscriptstyle O}{\hookrightarrow}} \newcommand{\qtext}[1]{{\quad \operatorname{#1} \quad}} \newcommand{\roof}[3]{#1 {\, \scriptstyle {}^\swarrow\, } #2 {\, \scriptstyle {}^\searrow\,} #3} \newcommand{\shift}[2]{{ \Sigma^{\scriptstyle[#2]} #1 }} \newcommand{\squares}[1]{{ {#1}_{\scriptscriptstyle \square} }} \newcommand{\weakeq}{\underset{\scriptscriptstyle W}{\rightarrow}} \newcommand{\congas}[1]{\underset{#1}{\cong}} \newcommand{\congbecause}[1]{\overset{#1}{\cong}} \newcommand{\equalsbecause}[1]{\overset{#1}{=}} \newcommand{\pwiso}{\underset{\mathrm{pw}}{\cong}} \newcommand{\lshriek}{{}_{!}} \newcommand{\pushf}{{}^{*}} \newcommand{\cofinal}{\mathsf{\emptyset}} \newcommand{\final}{\theset{\pt}} \newcommand{\freezmod}[1]{\ZZ\left[ {#1} \right]} \newcommand{\conjugate}[1]{{\overline{{#1}}}} \newcommand{\closure}[1]{\overline{#1}} \newcommand{\univcover}[1]{\overline{#1}} \newcommand{\bar}[1]{\overline{#1}} \newcommand{\hat}[1]{\widehat{#1}} \newcommand{\bundle}[1]{\mathcal{#1}} \newcommand{\vector}[1]{\mathbf{#1}} \newcommand{\vhat}[1]{\widehat{ \vector{#1} }} \newcommand{\diagonal}[1]{\Delta} \newcommand{\Diagonal}[1]{\Delta} \newcommand{\correspond}[1]{\theset{\substack{#1}}} \newcommand{\converges}[1]{\overset{#1}} \newcommand{\convergesto}[1]{\overset{#1}\too} \newcommand{\ddd}[2]{{\frac{d #1}{d #2}\,}} \newcommand{\dd}[2]{{\frac{\partial #1}{\partial #2}\,}} \newcommand{\evalfrom}{\Big|} \newcommand{\restrictionof}[2]{{\left.{{#1}} \right|_{{#2}} }} \newcommand{\ddt}{\tfrac{\dif}{\dif t}} \newcommand{\ddx}{\tfrac{\dif}{\dif x}} \newcommand{\logd}{{ \del^{\scriptsize \log} }} \newcommand{\theset}[1]{\left\{{#1}\right\}} \newcommand{\thevector}[1]{{\left[ {#1} \right]}} \newcommand{\mltext}[1]{\left\{\begin{array}{c}#1\end{array}\right\}} \newcommand{\Suchthat}{\middle\vert} \newcommand{\multinomial}[1]{\left(\!\!{#1}\!\!\right)} \newcommand{\realpart}[1]{{\mathcal{Re}({#1})}} \newcommand{\sheaf}[1]{\operatorname{\mathcal{#1}}} \newcommand{\smpt}[1]{\setminus\theset{#1}} \newcommand{\smts}[1]{\setminus\theset{ #1 }} \newcommand{\stirlingfirst}[2]{\genfrac{[}{]}{0pt}{}{#1}{#2}} \newcommand{\stirling}[2]{\genfrac\{\}{0pt}{}{#1}{#2}} \newcommand{\thecat}[1]{\mathbf{#1}} \newcommand{\constantsheaf}[1]{\underline{#1}} \newcommand{\vecc}[2]{\textcolor{#1}{\textbf{#2}}} \newcommand{\places}[1]{\mathrm{Pl}\qty{#1}} \newcommand{\ZZlocal}[1]{{ \ZZ_{\hat{#1}} }} \newcommand{\rad}[1]{\sqrt{#1}} \newcommand{\elts}[2]{{ {#1}_1, {#1}_2, \cdots, {#1}_{#2}}} \newcommand{\tselts}[2]{{ \theset{ {#1}_1, {#1}_2, \cdots, {#1}_{#2} } }} \newcommand{\mix}[1]{\overset{\scriptscriptstyle {#1} }{\times}} \newcommand{\fiberproduct}[1]{\underset{\scriptscriptstyle {#1} }{\times}} \newcommand{\fiberprod}[3]{{#1} \fiberproduct{#2} {#3}} \newcommand{\basechange}[1]{{ \fiberproduct{k} {#1} }} \newcommand{\fprod}[3]{\fiberprod{#1}{#2}{#3}} \newcommand{\qsymb}[2]{{ \left( {#1} \over {#2} \right) }} \newcommand{\kx}[1]{k[x_1, \cdots, x_{#1}]} \newcommand{\lktt}[1]{{L_{\mathrm{K3}, #1}}} \newcommand{\fractionalpart}[1]{\theset{#1}} \newcommand{\integerpart}[1]{\left[ {#1}\right]} \newcommand{\zadjoin}[1]{\ZZ\left[ {#1} \right]} \newcommand{\mapscorrespond}[2]{\mathrel{\operatorname*{\rightleftharpoons}_{#2}^{#1}}} \newcommand{\mapsvia}[1]{\xrightarrow{#1}} \newcommand{\mapsfromvia}[1]{\xleftarrow{#1}} \newcommand{\mapstovia}[1]{\xmapsto{#1}} \newcommand{\birationaliso}{\overset{\sim}{\rationalmap}} \newcommand{\sbirational}{\overset{\sim_{ \Stab} }{\rationalmap}} \newcommand{\isovia}[1]{\underset{#1}{\iso}} \newcommand{\isoin}[1]{\overset{#1}{\iso}} \newcommand{\injectsvia}[1]{\xhookrightarrow{#1}} \newcommand{\injectsfromvia}[1]{\xhookleftarrow{#1}} \newcommand{\relspec}{\underline{ \operatorname{Spec}}} \newcommand{\nerve}[1]{{ \mathcal{N}({#1}) }} \newcommand{\realize}[1]{{ \abs{#1} }} \newcommand{\opcat}[1]{{ {#1}^{\operatorname{op}} }} \newcommand{\oppositeof}[1]{{ {#1}^{\mathrm{op}} }} \newcommand{\dualof}[1]{{ {#1}^{\vee} }} \newcommand{\doubledualof}[1]{{ {#1}^{\vee\vee} }} \newcommand{\inverseof}[1]{{ {#1}^{-1} }} \newcommand{\unitsof}[1]{{ {#1}^{\times} }} \newcommand{\nonzeroof}[1]{{ {#1}^{\bullet} }} \newcommand{\interiorof}[1]{{ {#1}^{\circ} }} \newcommand{\sepclosure}[1]{{ {#1}^{\operatorname{sep}} }} \newcommand{\tiltof}[1]{{ {#1}^{\flat} }} \newcommand{\plusconstruction}[1]{{ {#1}^{+} }} \newcommand{\completionat}[2]{{ {#1}^{\wedge}_{#2} }} \newcommand{\procompletion}[1]{{ {#1}^{\wedge_{\scriptscriptstyle \pro}} }} \newcommand{\isoclasses}[1]{{ {#1}_{/\sim} }} \newcommand{\glue}[1]{{ \Disjoint_{#1} }} \newcommand{\normcomplex}[1]{{\norm{\complex{#1}}}} \newcommand{\Extalgebra}{\cocomplex{\bigwedge}} \newcommand{\Extalg}{\Extalgebra} \newcommand{\Extcomplex}{\cocomplex{ \Extalgebra}} \newcommand{\drcomplex}{{\cocomplex{\Omega}}} \newcommand{\cxH}{{\complex{H}}} \newcommand{\ccxH}{{\cocomplex{H}}} \newcommand{\sheafhom}{\mathop{\mathcal{H}\! \mathit{om}}} \newcommand{\smallprod}{{ \scriptscriptstyle\prod }} \newcommand{\eqLH}{{ \equalsbecause{\scriptscriptstyle\text{LH}} }} \newcommand{\eqae}{\underset{\ae}{=}} \newcommand{\eq}{\operatorname*{=}} \newcommand{\RM}[1]{\textup{\uppercase\expandafter{\romannumeral#1}}%} \newcommand{\caniso}{{ \underset{\can}{\iso} }} \newcommand{\dif}{\mathop{}\!\operatorname{d}} \newcommand{\rotate}[2]{{\style{display: inline-block; transform: rotate(#1deg)}{#2}}} \newcommand{\rrrarrows}{\mathrel{\substack{\textstyle\rightarrow\\[-0.6ex] \textstyle\rightarrow \\[-0.6ex] \textstyle\rightarrow}}} \newcommand{\righttriplearrows}{\operatorname{{\; \tikz{ \foreach \y in {0, 0.1, 0.2} { \draw [-stealth] (0, \y) -- +(0.5, 0);}} \; }}} \newcommand{\bdlattice}[2]{\overline{#1}_{ #2 }} \newcommand{\orthcomp}[2]{#1^{\perp #2}} \newcommand{\thecone}[1]{\mathfrak{#1}} \newcommand{\theposet}[1]{\mathcal{#1}} \newcommand{\modulistack}[1]{\mathcal{#1}} \newcommand{\RN}[1]{\textup{\uppercase\expandafter{\romannumeral#1}}} \newcommand{\torcptf}[2]{\overline{#1}^{#2}} \newcommand{\Sets}{{\mathsf{Set}}} \newcommand{\Poset}{\mathsf{Poset}} \newcommand{\Groups}{{\mathsf{Group}}} \newcommand{\Grp}{{\mathsf{Grp}}} \newcommand{\Ar}{{\mathsf{Ar}}} \newcommand{\Mot}{{\mathsf{Mot}}} \newcommand{\SW}{{\mathsf{SW}}} \newcommand{\cof}{{\mathsf{cof}}} \newcommand{\fib}{{\mathsf{fib}}} \newcommand{\der}{{\mathsf{d}}} \newcommand{\dg}{{\mathsf{dg}}} \newcommand{\comm}{{\mathsf{C}}} \newcommand{\pre}{{\mathsf{pre}}} \newcommand{\fn}{{\mathsf{fn}}} \newcommand{\smooth}{{\mathsf{sm}}} \newcommand{\Aff}{{\mathsf{Aff}}} \newcommand{\Ab}{{\mathsf{Ab}}} \newcommand{\Add}{{\mathsf{Add}}} \newcommand{\Assoc}{\mathsf{Assoc}} \newcommand{\Ch}{\mathsf{Ch}} \newcommand{\Coh}{{\mathsf{Coh}}} \newcommand{\Comm}{\mathsf{Comm}} \newcommand{\Corr}{\mathsf{Cor}} \newcommand{\Fin}{{\mathsf{Fin}}} \newcommand{\Free}{\mathsf{Free}} \newcommand{\Tors}{\mathsf{Tors}} \newcommand{\Perf}{\mathsf{Perf}} \newcommand{\Unital}{\mathsf{Unital}} \newcommand{\eff}{\mathsf{eff}} \newcommand{\Dc}{\mathbf{D}} \newcommand{\Db}{\mathsf{D}^b} \newcommand{\db}{\Db} \newcommand{\Const}{\mathsf{Const}} \newcommand{\Stable}{\mathsf{Stab}} \newcommand{\Vect}{{ \mathsf{Vect}}} \newcommand{\kvect}{{ \mathsf{Vect}\slice{k}}} \newcommand{\loc}{{\mathsf{loc}}} \newcommand{\locfree}{{\mathsf{locfree}}} \newcommand{\Bun}{{\mathsf{Bun}}} \newcommand{\Prinbun}{{ \mathsf{PrinBun}}} \newcommand{\bung}{{\mathsf{Bun}_G}} \newcommand{\Local}{\mathsf{Local}} \newcommand{\Field}{\mathsf{Field}} \newcommand{\Number}{\mathsf{Number}} \newcommand{\Numberfield}{\Field\slice{\QQ}} \newcommand{\NF}{\Numberfield} \newcommand{\Art}{\mathsf{Art}} \newcommand{\Global}{\mathsf{Global}} \newcommand{\Ring}{\mathsf{Ring}} \newcommand{\CMon}{\mathsf{CMon}} \newcommand{\CRing}{\mathsf{CRing}} \newcommand{\DedekindDomain}{\mathsf{DedekindDom}} \newcommand{\IntDomain}{\mathsf{IntDom}} \newcommand{\Dom}{\mathsf{Dom}} \newcommand{\Domain}{\mathsf{Domain}} \newcommand{\DVR}{\mathsf{DVR}} \newcommand{\Dedekind}{\mathsf{Dedekind}} \newcommand{\Quat}{{\mathsf{Quat}}} \newcommand{\Mod}{{\mathsf{Mod}}} \newcommand{\modr}{\modsright{R}} \newcommand{\grMod}{{\mathsf{grMod}}} \newcommand{\zmod}{\modsleft{\ZZ}} \newcommand{\qmod}{\modsleft{\QQ}} \newcommand{\rmod}{\modsleft{R}} \newcommand{\kmod}{\modsleft{k}} \newcommand{\cmod}{\modsleft{ \CC }} \newcommand{\fmod}{\modsleft{ \FF }} \newcommand{\oxmods}{\mods{\OO_X}} \newcommand{\amod}{\mods{A}} \newcommand{\gmod}{\mods{G}} \newcommand{\lmod}{\mods{L}} \newcommand{\Dmod}{\modsleft{\mathcal{D}}} \newcommand{\dmod}{\Dmod} \newcommand{\gr}{{\mathsf{gr}\,}} \newcommand{\mmod}{{\dash\mathsf{Mod}}} \newcommand{\Rep}{{\mathsf{Rep}}} \newcommand{\Irr}{{\mathsf{Irr}}} \newcommand{\Adm}{{\mathsf{Adm}}} \newcommand{\semisimp}{{\mathsf{ss}}} \newcommand{\Hodge}{{\mathsf{Hodge}}} \newcommand{\VectBundle}{{ \Bun\qty{\GL_r}}} \newcommand{\VectSp}{{ \VectSp }} \newcommand{\VectBun}{{ \VectBundle }} \newcommand{\Bung}{{ \Bun\qty{G}}} \newcommand{\Alg}{\mathsf{Alg}} \newcommand{\Hopf}{\mathsf{Hopf}} \newcommand{\alg}{\Alg} \newcommand{\scalg}{\mathsf{sCAlg}} \newcommand{\cAlg}{{\mathsf{cAlg}}} \newcommand{\calg}{\mathsf{CAlg}} \newcommand{\liegmod}{{\mathfrak{g}\dash\mathsf{Mod}}} \newcommand{\liealg}{{\mathsf{Lie}\dash\Alg}} \newcommand{\Lie}{\mathsf{Lie}} \newcommand{\kalg}{{}_{k} \Alg} \newcommand{\kAlg}{\kalg} \newcommand{\falg}{{}_{\FF} \Alg} \newcommand{\ralg}{{}_{R} \Alg} \newcommand{\rAlg}{\ralg} \newcommand{\zalg}{{}_{\ZZ} \Alg} \newcommand{\CCalg}{{}_{\CC} \Alg} \newcommand{\dga}{{\mathsf{dg\Alg}}} \newcommand{\cdga}{{ \mathsf{c}\dga }} \newcommand{\FMP}{\mathsf{FMP}} \newcommand{\dgla}{\dg\Lie\Alg} \newcommand{\DGLA}{\dgla} \newcommand{\Poly}{{\mathsf{Poly}}} \newcommand{\Hk}{{\mathsf{Hk}}} \newcommand{\Asm}{{\mathsf{Asm}}} \newcommand{\kSch}{{\mathsf{Sch}_{/k}}} \newcommand{\Grpd}{{\mathsf{Grpd}}} \newcommand{\inftyGrpd}{{ \underset{\infty}{ \Grpd }}} \newcommand{\Algebroid}{{\mathsf{Algd}}} \newcommand{\Loc}{\mathsf{Loc}} \newcommand{\Locsys}{\mathsf{LocSys}} \newcommand{\RingedSpace}{\mathsf{RingSp}} \newcommand{\LRS}{\Loc\RingedSpace} \newcommand{\IndCoh}{{\mathsf{IndCoh}}} \newcommand{\dbcoh}{\mathsf{D}^b\mathsf{Coh}} \newcommand{\DbCoh}{\dbcoh} \newcommand{\DCoh}{\mathsf{D}\mathsf{Coh}} \newcommand{\dcoh}{\DCoh} \newcommand{\QCoh}{{\mathsf{QCoh}}} \newcommand{\qcoh}{\QCoh} \newcommand{\ind}{\Indcat} \newcommand{\Pro}{\mathsf{pro}} \newcommand{\pro}{\Pro} \newcommand{\Cov}{{\mathsf{Cov}}} \newcommand{\presh}{\underset{ \mathsf{pre}} {\mathsf{Sh}}} \newcommand{\prest}{{\underset{ \mathsf{pre}} {\mathsf{St}} }} \newcommand{\Descent}{{\mathsf{Descent}}} \newcommand{\Desc}{{\mathsf{Desc}}} \newcommand{\FFlat}{{\mathsf{FFlat}}} \newcommand{\Perv}{\mathsf{Perv}} \newcommand{\smsch}{{ \smooth\Sch }} \newcommand{\Sch}{{\mathsf{Sch}}} \newcommand{\Schf}{{\mathsf{Schf}}} \newcommand{\Sh}{{\mathsf{Sh}}} \newcommand{\Stacks}{{\mathsf{St}}} \newcommand{\Var}{{\mathsf{Var}}} \newcommand{\Vark}{{ \Var_{/k}}} \newcommand{\Open}{{\mathsf{Open}}} \newcommand{\CW}{{\mathsf{CW}}} \newcommand{\ssets}{\mathsf{sSet}} \newcommand{\hoTop}{{\mathsf{hoTop}}} \newcommand{\hoType}{{\mathsf{hoType}}} \newcommand{\ho}{{\mathsf{ho}}} \newcommand{\SHC}{{\mathsf{SHC}}} \newcommand{\SH}{{\mathsf{SH}}} \newcommand{\Spaces}{{\mathsf{Spaces}}} \newcommand{\Spectra}{{\mathsf{Sp}}} \newcommand{\Sp}{{\mathsf{Sp}}} \newcommand{\Top}{{\mathsf{Top}}} \newcommand{\Bord}{{\mathsf{Bord}}} \newcommand{\TQFT}{{\mathsf{TQFT}}} \newcommand{\Kc}{{\mathsf{K^c}}} \newcommand{\triang}{{\mathsf{triang}}} \newcommand{\TTC}{{\mathsf{TTC}}} \newcommand{\dchrmod}{{\derivedcat{\Ch(\rmod)}}} \newcommand{\Finset}{{\mathsf{FinSet}}} \newcommand{\Cat}{\mathsf{Cat}} \newcommand{\Fun}{{\mathsf{Fun}}} \newcommand{\Kan}{{\mathsf{Kan}}} \newcommand{\Monoid}{\mathsf{Mon}} \newcommand{\Arrow}{\mathsf{Arrow}} \newcommand{\quasiCat}{{ \mathsf{quasiCat}}} \newcommand{\inftycat}{{ \underset{\infty}{ \Cat} }} \newcommand{\core}{{ \mathsf{core}}} \newcommand{\Indcat}{\mathsf{Ind}} \newcommand{\Prism}{\mathsf{Prism}} \newcommand{\Solid}{\mathsf{Solid}} \newcommand{\WCart}{\mathsf{WCart}} \newcommand{\Quadform}{{\mathsf{QuadForm}}} \newcommand{\HI}{{\mathsf{HI}}} \newcommand{\DM}{{\mathsf{DM}}} \newcommand{\hoA}{{\mathsf{ho}_*^{\scriptstyle \AA^1}}} \newcommand{\Tw}{\mathsf{Tw}} \newcommand{\SB}{\mathsf{SB}} \newcommand{\CSA}{\mathsf{CSA}} \newcommand{\CSS}{{ \mathsf{CSS}}} \newcommand{\FGL}{\mathsf{FGL}} \newcommand{\FI}{{\mathsf{FI}}} \newcommand{\CE}{{\mathsf{CE}}} \newcommand{\Fuk}{{\mathsf{Fuk}}} \newcommand{\Lag}{{\mathsf{Lag}}} \newcommand{\Mfd}{{\mathsf{Mfd}}} \newcommand{\Riem}{\mathsf{Riem}} \newcommand{\Wein}{{\mathsf{Wein}}} \newcommand{\deltaring}{{\delta\dash\mathsf{Ring}}} \newcommand{\terminal}{{ 0_{\scriptscriptstyle \uparrow}}} \newcommand{\initial}{{ \mathscr \emptyset^{\scriptscriptstyle \downarrow}}} \newcommand{\coeq}{\operatorname{coeq}} \newcommand{\cocoeq}{\operatorname{eq}} \newcommand{\cat}[1]{\mathsf{#1}} \newcommand{\GSets}{{G\dash\mathsf{Set}}} \newcommand{\derivedcat}[1]{\Dc {#1}} \newcommand{\bderivedcat}[1]{\Db {#1}} \newcommand{\ChainCx}[1]{\mathsf{Ch}\qty{ #1 }} \newcommand{\Fieldsover}[1]{{ \mathsf{Fields}_{#1}}} \newcommand{\torsors}[1]{{\mathsf{#1}\dash\mathsf{Torsors}}} \newcommand{\torsorsright}[1]{\mathsf{Torsors}\dash\mathsf{#1}} \newcommand{\torsorsleft}[1]{\mathsf{#1}\dash\mathsf{Torsors}} \newcommand{\bimods}[2]{({#1}, {#2})\dash\mathsf{biMod}} \newcommand{\modsleft}[1]{{}_{#1}\Mod} \newcommand{\modsright}[1]{\Mod_{#1}} \newcommand{\mods}[1]{\modsleft{#1}} \newcommand{\stmods}[1]{{\mathsf{#1}\dash\mathsf{stMod}}} \newcommand{\grmods}[1]{{\mathsf{#1}\dash\mathsf{grMod}}} \newcommand{\comods}[1]{{\mathsf{#1}\dash\mathsf{coMod}}} \newcommand{\gsetsleft}[1]{{}_{#1}\Sets} \newcommand{\gsetsright}[1]{\Sets_{#1}} \newcommand{\gset}[1]{\gsetsleft{#1}} \newcommand{\gsets}[1]{\gset{#1}} \newcommand{\VectBundlerk}[1]{{ \Bun\qty{\GL_{#1}}}} \newcommand{\VectBunrk}[1]{{ \VectBundlerk{#1}}} \newcommand{\algs}[1]{{ {}_{#1} \Alg }} \newcommand{\inftycatn}[1]{{ \underset{(\infty, {#1})}{ \Cat} }} \newcommand{\GSpaces}{{G\dash\mathsf{Spaces}}} \newcommand{\gspaces}[1]{{#1}\dash{\mathsf{Spaces}}} \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{\adj}[4]{#1 \mathrel{\underset{#4}{\overset{#3}{\rightleftarrows}}} #2} \newcommand{\tmf}{\mathrm{tmf}} \newcommand{\taf}{\mathrm{taf}} \newcommand{\TAF}{\mathrm{TAF}} \newcommand{\TMF}{\mathrm{TMF}} \newcommand{\String}{\mathrm{String}} \newcommand{\BO}{{\B \Orth}} \newcommand{\EO}{{\mathsf{E} \Orth}} \newcommand{\BSO}{{\B\SO}} \newcommand{\ESO}{{\mathsf{E}\SO}} \newcommand{\BG}{{\B G}} \newcommand{\EG}{{\mathsf{E} G}} \newcommand{\BP}{{\operatorname{BP}}} \newcommand{\BU}{\B{\operatorname{U}}} \newcommand{\MO}{{\operatorname{MO}}} \newcommand{\MSO}{{\operatorname{MSO}}} \newcommand{\MSpin}{{\operatorname{MSpin}}} \newcommand{\MString}{{\operatorname{MString}}} \newcommand{\MU}{{\operatorname{MU}}} \newcommand{\KO}{{\operatorname{KO}}} \newcommand{\KU}{{\operatorname{KU}}} \newcommand{\ku}{{\operatorname{ku}}} \newcommand{\smashprod}{\wedge} \newcommand{\hofib}{{\operatorname{hofib}}} \newcommand{\cofib}{{\operatorname{cofib}}} \newcommand{\hocofib}{{\operatorname{hocofib}}} \newcommand{\Loop}{{\Omega}} \newcommand{\Loops}{\Loop} \newcommand{\Suspend}{{\Sigma}} \newcommand{\Suspendpinf}{\operatorname{{\Sigma_+^\infty}}} \newcommand{\Loopinf}{\operatorname{{\Omega^\infty}}} \newcommand{\Loopsinf}{\Loopinf} \)

38  Embeddings, overlattices, and gluing

Remark 38.1 The basic vocabulary of lattices, primitive embeddings, orthogonal complements, discriminant groups, and the unimodular lattices \(\latI_{p, q}\) and \(\latII_{p, q}\) was fixed in [[lattice-theory|Lattice Theory]]. We now develop the finer theory that underlies the lattice computations of this monograph: the several equivalent characterizations of a primitive sublattice, the classification of primitive embeddings up to isometry, Nikulin’s correspondence between overlattices and isotropic subgroups of the discriminant form, the splitting of a unimodular sublattice off its ambient lattice, the classification of unimodular lattices, the finiteness of the set of primitive embeddings into an even unimodular lattice, and the behaviour of the discriminant group under scaling. Throughout, \(S\), \(T\), and \(L\) denote nondegenerate lattices in the sense of [[lattice-theory|Lattice Theory]], \(\beta\) denotes the ambient bilinear form when no confusion can arise, and \(A_L \definedas \dualof{L}/L\) is the discriminant group with its quadratic form \(q_L\).

38.1 Primitive and saturated sublattices

Definition 38.2 (Saturation) Let \(S\iscontainedin L\) be a sublattice. The saturation of \(S\) in \(L\) is the sublattice \[ \Sat_L(S) \definedas \theset{v\in L \mid nv\in S \text{ for some } n\in \ZZ\setminus\theset{0}} . \] Equivalently, \(\Sat_L(S) = S_\QQ\intersect L\), where \(S_\QQ \definedas S\tensor_\ZZ\QQ\) is regarded inside \(L_\QQ\). We say \(S\) is saturated in \(L\) if \(S = \Sat_L(S)\).

Proposition 38.3 (Characterization of primitive sublattices) Let \(S\iscontainedin L\) be a sublattice. The following conditions are equivalent.

  1. The inclusion \(S\injects L\) is a primitive embedding, i.e. \(\coker(S\injects L)\) is torsionfree.

  2. \(S\) is saturated in \(L\): \(S = \Sat_L(S)\).

  3. \(S_\QQ\intersect L = S\), where the intersection is taken in \(L_\QQ\).

  4. \(S\) is a direct summand of \(L\) as a \(\ZZ\)-module, i.e. \(L\cong S\oplus T\) for some submodule \(T\iscontainedin L\).

  5. Every \(\ZZ\)-basis of \(S\) extends to a \(\ZZ\)-basis of \(L\).

  6. Every \(\ZZ\)-linear functional \(S\to\ZZ\) is the restriction of a \(\ZZ\)-linear functional \(L\to\ZZ\).

  7. \(S = (S^{\perp L})^{\perp L}\), the double orthogonal complement of \(S\) in \(L\).

A sublattice satisfying these conditions is called a primitive sublattice.

Proof. We show \((1)\iff(2)\), \((2)\iff(3)\), \((2)\iff(4)\iff(5)\iff(6)\), and \((2)\iff(7)\).

\((1)\iff(2)\): By definition \(\coker(S\injects L) = L/S\), and \(L/S\) is torsionfree if and only if no nonzero element of \(L/S\) is torsion. An element \(v + S\) is torsion in \(L/S\) precisely when \(nv\in S\) for some nonzero \(n\in\ZZ\), i.e. when \(v\in\Sat_L(S)\). Thus \(L/S\) is torsionfree if and only if \(\Sat_L(S) = S\).

\((2)\iff(3)\): This is the second description of the saturation recorded in the saturation definition (Definition 38.2). If \(v\in S_\QQ\intersect L\), then \(v = \sum_i (a_i/n) s_i\) with \(s_i\in S\), \(a_i\in\ZZ\), and \(n\in\ZZ\setminus\theset{0}\), so \(nv\in S\) and \(v\in\Sat_L(S)\); conversely if \(nv\in S\) then \(v = (nv)/n\in S_\QQ\), so \(v\in S_\QQ\intersect L\). Hence \(\Sat_L(S) = S_\QQ\intersect L\), and \((2)\) and \((3)\) are the same equation.

\((2)\Rightarrow(4)\): The quotient \(L/S\) is a finitely generated \(\ZZ\)-module, hence isomorphic to \(\ZZ^k\oplus F\) with \(F\) finite. The torsion subgroup \(F\) is exactly \(\Sat_L(S)/S\), which vanishes by \((2)\), so \(L/S\cong\ZZ^k\) is free. A short exact sequence \(0\to S\to L\to L/S\to 0\) with \(L/S\) free splits, yielding \(L\cong S\oplus T\) with \(T\cong L/S\).

\((4)\Rightarrow(5)\): If \(L\cong S\oplus T\), then the union of a \(\ZZ\)-basis of \(S\) and a \(\ZZ\)-basis of \(T\) is a \(\ZZ\)-basis of \(L\), so any basis of \(S\) extends.

\((5)\Rightarrow(6)\): Fix a basis \(e_1,\ldots,e_r\) of \(S\), extended to a basis \(e_1,\ldots,e_r,e_{r+1},\ldots,e_n\) of \(L\). Given \(\varphi\colon S\to\ZZ\), define \(\tilde\varphi\colon L\to\ZZ\) by \(\tilde\varphi(e_i) = \varphi(e_i)\) for \(i\le r\) and \(\tilde\varphi(e_j) = 0\) for \(j > r\); then \(\tilde\varphi\) restricts to \(\varphi\) on \(S\).

\((6)\Rightarrow(2)\): Suppose \(v\in\Sat_L(S)\) with \(nv\in S\), \(n\ne 0\), but \(v\notin S\). Choose a \(\ZZ\)-basis \(s_1,\ldots,s_r\) of \(S\) and write \(nv = \sum_i a_i s_i\) with \(a_i\in\ZZ\). Since \(v\notin S\), some coefficient \(a_i\) is not divisible by \(n\); fix such an \(i\) and let \(\varphi\colon S\to\ZZ\) be the coordinate functional dual to \(s_i\), so \(\varphi(nv) = a_i\). By \((6)\) there is \(\tilde\varphi\colon L\to\ZZ\) restricting to \(\varphi\), and then \(n\tilde\varphi(v) = \tilde\varphi(nv) = \varphi(nv) = a_i\), forcing \(n\mid a_i\), a contradiction. Hence \(\Sat_L(S) = S\).

\((2)\Rightarrow(7)\): In general \(S\iscontainedin (S^{\perp L})^{\perp L}\) and the right-hand side is saturated (it is cut out by the vanishing of rational linear conditions, hence equals its own \(\QQ\)-span intersected with \(L\)). Because \(L\) is nondegenerate, \(S\) and \((S^{\perp L})^{\perp L}\) have the same \(\QQ\)-span, so \((S^{\perp L})^{\perp L} = S_\QQ\intersect L\). If \(S\) is saturated, this equals \(S\).

\((7)\Rightarrow(2)\): If \(S = (S^{\perp L})^{\perp L}\), then \(S\) equals a double orthogonal complement, which as just noted equals \(S_\QQ\intersect L\); by \((3)\) this is condition \((2)\).

38.2 Equivalence of embeddings

Definition 38.4 (Equivalence of primitive embeddings) Two primitive embeddings \(\iota_1\colon S\injects L_1\) and \(\iota_2\colon S\injects L_2\) are equivalent if there is an isometry \(f\in\operatorname{Isom}(L_1, L_2)\) with \(f\circ\iota_1 = \iota_2\). When \(L_1 = L_2 = L\), two primitive embeddings \(\iota_1,\iota_2\colon S\injects L\) are equivalent if they are related in this way by an element \(f\in\Orth(L)\). The set of equivalence classes of primitive embeddings of \(S\) into a fixed lattice \(L\) is denoted \(\Emb(S, L)\).

Remark 38.5 Since an equivalence identifies \(\iota_1(S)\) with \(\iota_2(S)\) as sublattices of \(L\), describing \(\Emb(S, L)\) amounts to classifying the \(\Orth(L)\)-orbits of primitive sublattices of \(L\) isometric to \(S\), together with the choice of isometry onto each such sublattice. This is the object controlled by the gluing theory of the next subsection and made finite, in the even unimodular case, by the embedding-finiteness proposition (Proposition 38.23).

Definition 38.6 (Isomorphic embeddings versus isomorphic primitive sublattices) Two primitive embeddings \(\iota_1\colon S\injects M_1\) and \(\iota_2\colon S\injects M_2\) can be compared in two inequivalent ways.

  1. They are isomorphic as embeddings if there is an isometry \(\varphi\colon M_1\iso M_2\) with \(\varphi\circ\iota_1 = \iota_2\), so that \(\varphi\) restricts to the identity of \(S\). This is the embedding-equivalence definition (Definition 38.4).

  2. They define isomorphic primitive sublattices if there is an isometry \(\varphi\colon M_1\iso M_2\) with \(\varphi(\iota_1(S)) = \iota_2(S)\), so that \(\varphi\) restricts to some automorphism of \(S\), not necessarily the identity.

The first relation is finer than the second, and the two classifications differ by the action of \(\Orth(S)\): the classes of the second kind are the orbits of the classes of the first kind under \(\Orth(S)\) acting by precomposition.

Remark 38.7 The distinction matters whenever \(\Orth(S)\) is large, and it is the source of two different answers to the question of how many primitive embeddings \(S\injects L\) there are. Nikulin’s classification of primitive embeddings (Nikulin 1980 Prop. 1.15.1) is stated for the first relation, in terms of the gluing data \((H_S, H_T, \gamma)\) of the embedding-gluing description (Remark 38.10); passing to the second relation divides out by the action of the image of \(\Orth(S)\) in \(\Orth(q_S)\) on those data, which is the extra quotient appearing in the uniqueness statement of Nikulin’s gluing theorem (Theorem 38.9).

38.3 Overlattices and gluing

Definition 38.8 (Overlattice) An overlattice of a lattice \(S\) is a lattice \(L\) containing \(S\) as a finite-index sublattice, with \(\restrictionof{\beta_L}{S} = \beta_S\). Equivalently, \(L\) is a lattice with \(S\iscontainedin L\iscontainedin \dualof{S}\), where the inclusions use the canonical map \(S\injects \dualof{S}\) of [[lattice-theory|Lattice Theory]] and its dual; the finite quotient \(L/S\) is then a subgroup of \(A_S = \dualof{S}/S\).

Theorem 38.9 (Nikulin's gluing correspondence) Let \(S\) be an even lattice. There is a bijection \[ \theset{\text{even overlattices } L \text{ of } S} \;\longleftrightarrow\; \theset{\text{isotropic subgroups } H\le A_S} \] between the set of even overlattices of \(S\) and the set of subgroups \(H\le A_S\) on which the discriminant quadratic form \(q_S\) vanishes identically. The bijection sends an overlattice to the isotropic subgroup it cuts out, and an isotropic subgroup to the overlattice it glues: \[ \begin{aligned} L &\longmapsto H_L \definedas L/S \iscontainedin A_S, \\ H &\longmapsto \inverseof{\eta}(H)\iscontainedin \dualof{S}, \end{aligned} \] where \(\eta\colon \dualof{S}\to A_S\) is the quotient map. Under this correspondence, \[ [L : S] = \abs{H}, \qquad A_L \cong H^{\perp}/H, \qquad \disc L = \frac{\disc S}{\abs{H}^2}, \] where \(H^{\perp}\le A_S\) is the orthogonal complement of \(H\) with respect to \(q_S\). Two even overlattices \(L\), \(L'\) of \(S\) are isometric by an isometry restricting to an element of \(\Orth(S)\) if and only if \(H_L\) and \(H_{L'}\) are conjugate under the image of \(\Orth(S)\) in \(\Orth(q_S)\).

Proof. Any lattice \(L\) intermediate between \(S\) and \(\dualof{S}\) contains \(S\) with finite index, and the pairing \(\beta_S\) extends to \(L\) with integer values precisely when the image \(H_L = L/S\iscontainedin A_S\) is isotropic for \(q_S\): for \(x + S, y + S\in H_L\) one has \(\beta_{S_\QQ}(x, y)\in\ZZ\) if and only if the associated bilinear form on \(A_S\) vanishes on \(H_L\), and evenness of \(L\) requires in addition \(q_S(x + S) = 0\) for all \(x + S\in H_L\). Conversely, given an isotropic \(H\le A_S\), the preimage \(\inverseof{\eta}(H)\iscontainedin \dualof{S}\) is an even overlattice of \(S\) with \(\inverseof{\eta}(H)/S = H\); the two constructions are mutually inverse.

For the numerical statements, \([L:S] = \abs{L/S} = \abs{H}\). Since \(\disc\) scales by the square of the index under passage to a finite-index sublattice, \(\disc S = [L:S]^2\disc L = \abs{H}^2\disc L\), giving the displayed formula. Finally, the discriminant form of \(L\) is computed on \(\dualof{L}/L\); one has \(\dualof{L} = \inverseof{\eta}(H^{\perp})\) inside \(S_\QQ\), whence \(A_L = \dualof{L}/L \cong H^{\perp}/H\).

The orbit statement is immediate from the definitions: an isometry of \(S\) extends to an isometry of \(\dualof{S}\) and hence acts on \(A_S\) through the natural map \(\Orth(S)\to\Orth(q_S)\), carrying the overlattice attached to \(H\) to the one attached to its image.

Remark 38.10 The correspondence of Nikulin’s gluing theorem (Theorem 38.9) is the engine behind the classification of primitive embeddings. A primitive embedding \(S\injects L\) with orthogonal complement \(T\definedas S^{\perp L}\) realizes \(L\) as an even overlattice of the orthogonal direct sum \(S\oplus T\), whose discriminant group is \(A_S\oplus A_T\) by the additivity recorded in [[lattice-theory|Lattice Theory]]. The corresponding isotropic subgroup \(H\le A_S\oplus A_T\) is the graph of an isometry \(\gamma\colon H_S\isoto H_T\) between subgroups \(H_S\le A_S\) and \(H_T\le A_T\), anti-isometric for the two discriminant forms; the embedding is thus determined by the gluing data \((H_S, H_T, \gamma)\). Comparing discriminants across the overlattice \(L\) of \(S\oplus T\) gives the discriminant formula \[ \abs{\disc T} = \frac{\abs{\disc L}\cdot\abs{H}^2}{\abs{\disc S}}, \qquad H\definedas H_L, \] recovering, when \(L\) is unimodular, the statement that \(\abs{\disc T} = \abs{\disc S}\) and that \(H_S = A_S\), \(H_T = A_T\) so that \(\gamma\colon A_S\isoto A_T\) is an isometry onto \(A_T\) equipped with the negated form; see the embedding-finiteness proposition (Proposition 38.23). The construction and these formulas are due to Nikulin (Nikulin 1980, secs. 1.4–1.5). The gluing subgroup \(H\) is also what decides whether a pair of isometries of \(S\) and of \(T\) assembles into an isometry of \(L\); that question is settled in the automorphism-lifting criterion (Theorem 43.5).

38.4 Splitting of unimodular sublattices

Definition 38.11 (Splitting) Let \(S\injects L\) be a primitive embedding with orthogonal complement \(T\definedas S^{\perp L}\). We say \(S\) splits \(L\) if \(L = S\oplus T\); equivalently, if \(L\) is the trivial index-\(1\) overlattice of \(S\oplus T\), i.e. the isotropic subgroup \(H_L\le A_{S\oplus T}\) from Nikulin’s gluing theorem (Theorem 38.9) is the zero group.

Proposition 38.12 (Unimodular sublattices split) Let \(S\) be a unimodular lattice admitting a primitive embedding into a nondegenerate lattice \(L\), and let \(T\definedas S^{\perp L}\) be its orthogonal complement. Then \(S\) splits \(L\): \[ L \cong S\oplus T . \] Moreover, if \(L\) is unimodular then \(T\) is unimodular as well.

Proof. First observe that \(S\intersect T = \theset{0}\): any \(x\in S\intersect T\) satisfies \(\beta_L(x, S) = 0\), and since \(S\) is nondegenerate this forces \(x = 0\). Thus the sum \(S + T\) inside \(L\) is direct, giving an inclusion \(S\oplus T\iscontainedin L\).

We show this inclusion is an equality. Let \(x\in L\) be arbitrary and consider the functional \(\restrictionof{\beta_L(x,\,\cdot\,)}{S}\colon S\to\ZZ\). Since \(S\) is unimodular, the canonical map \(S\to \dualof{S}\) is an isomorphism, so there exists \(s\in S\) with \(\beta_L(x, y) = \beta_S(s, y)\) for all \(y\in S\); that is, \(\beta_L(x - s, S) = 0\), so \(x - s\in T\). Hence \(x = s + (x - s)\in S\oplus T\), and \(L = S\oplus T\), which is the first claim.

For the second claim, \(L = S\oplus T\) gives \(\disc L = \disc S\cdot\disc T\). When \(L\) is unimodular, \(\disc L = \pm 1\), and since \(S\) is unimodular with \(\disc S = \pm 1\) we obtain \(\disc T = \pm 1\), so \(T\) is unimodular.

Lemma 38.13 (Divisibility of isotropic vectors in unimodular lattices) Let \(L\) be a nondegenerate unimodular lattice and let \(v\in L\) be a primitive isotropic vector. Then there exists \(w\in L\) with \(\beta_L(v, w) = 1\). In particular \(\div_L(v) = 1\) for every primitive vector \(v\in L\).

Proof. Since \(L\) is unimodular, the canonical map \(L\to \dualof{L}\) is an isomorphism, so every functional in \(\dualof{L} = \Hom_\ZZ(L, \ZZ)\) has the form \(\beta_L(u,\,\cdot\,)\) for a unique \(u\in L\). Because \(v\) is primitive, by the primitive-sublattice characterization (Proposition 38.3) it extends to a \(\ZZ\)-basis \(e_1 = v, e_2,\ldots,e_n\) of \(L\). Let \(\varphi\colon L\to\ZZ\) be the dual-basis functional with \(\varphi(v) = 1\) and \(\varphi(e_j) = 0\) for \(j > 1\). Writing \(\varphi = \beta_L(w,\,\cdot\,)\) for the corresponding \(w\in L\) and using symmetry gives \(\beta_L(v, w) = \beta_L(w, v) = \varphi(v) = 1\). For the divisibility statement, the image \(\beta_L(v, L) = \div_L(v)\ZZ\) contains \(\beta_L(v, w) = 1\), so \(\div_L(v) = 1\).

Corollary 38.14 (Hyperbolic splitting of unimodular lattices) Let \(L\) be a nondegenerate unimodular lattice containing a primitive isotropic vector. Then \(L\) splits off a rank-\(2\) unimodular hyperbolic plane: \[ L \cong P\oplus P^{\perp L}, \qquad P \cong \begin{cases} U, & L \text{ even},\\ \latI_{1, 1}, & L \text{ odd}. \end{cases} \]

Proof. Let \(e\in L\) be a primitive isotropic vector. By the unimodular-divisibility lemma (Lemma 38.13) choose \(w\in L\) with \(\beta_L(e, w) = 1\), and set \(k\definedas w^2\). The sublattice \(P\definedas\generators{e, w}\) has Gram matrix \(\begin{bmatrix}0 & 1\\ 1 & k\end{bmatrix}\) of determinant \(-1\), hence \(P\) is a rank-\(2\) unimodular sublattice, and it is primitive since a unimodular sublattice is saturated by the primitive-sublattice characterization (Proposition 38.3). The isometry type of \(P\) is governed by the parity of \(k = w^2\): the Gram matrix \(\begin{bmatrix}0 & 1\\ 1 & k\end{bmatrix}\) gives \(P\cong U\) when \(k\) is even and \(P\cong\latI_{1, 1}\) (the odd rank-\(2\) unimodular hyperbolic lattice) when \(k\) is odd. We adjust \(w\) within its coset to realize the parity dictated by \(L\); note that adding to \(w\) any vector of \(\generators{e}^{\perp L}\) preserves \(\beta_L(e, w) = 1\).

If \(L\) is even then \(k = w^2\) is even; replacing \(w\) by \(w - \tfrac{k}{2}e\) (and \(e\in\generators{e}^{\perp L}\) since \(e^2 = 0\)) leaves \(\beta_L(e, w) = 1\) unchanged and makes \(w^2 = 0\), so \(P\cong U\).

If \(L\) is odd we arrange \(w^2\) to be odd, so that \(P\cong\latI_{1, 1}\). Every \(x\in L\) satisfies \(x - \beta_L(e, x)\,w\in\generators{e}^{\perp L}\), so \(L = \generators{e}^{\perp L} + \ZZ w\). Were \(\generators{e}^{\perp L}\) to consist entirely of even-norm vectors and \(w^2\) even, every \(x = y + mw\) (\(y\in\generators{e}^{\perp L}\)) would have \(x^2 = y^2 + 2m\,\beta_L(y, w) + m^2 w^2\) even, forcing \(L\) even — contrary to hypothesis. Hence either \(w^2\) is already odd, or \(\generators{e}^{\perp L}\) contains a vector \(u\) of odd norm; in the latter case replace \(w\) by \(w + u\), which preserves \(\beta_L(e, w) = 1\) and gives \((w + u)^2 = w^2 + 2\beta_L(w, u) + u^2\) odd. Either way \(k = w^2\) is odd and \(P\cong\latI_{1, 1}\).

Since \(P\) is unimodular, the unimodular-splitting proposition (Proposition 38.12) gives \(L\cong P\oplus P^{\perp L}\).

38.5 Maximal and split maximal lattices

Definition 38.15 (Maximal lattices) An even lattice \(L'\) is maximal if its discriminant group contains no nonzero isotropic subgroup, that is if \(q_{L'}\) vanishes on no nonzero subgroup of \(A_{L'}\). An inclusion \(L\iscontainedin L'\) with \(L'\) maximal and \(L'\) an overlattice of \(L\) in the sense of the overlattice definition (Definition 38.8) is a maximal overlattice of \(L\).

Lemma 38.16 Every even lattice admits a maximal overlattice. A unimodular lattice is maximal.

Proof. By Nikulin’s gluing theorem (Theorem 38.9) the even overlattices of \(L\) correspond to the isotropic subgroups of \(A_L\), and the discriminant form of the overlattice attached to \(H\) is carried by \(H^{\perp}/H\). Starting from \(H = 0\) and repeatedly enlarging \(H\) by an isotropic element of \(H^{\perp}\) terminates, since \(A_L\) is finite, at a subgroup for which \(H^{\perp}/H\) has no nonzero isotropic subgroup; the corresponding overlattice is maximal. A unimodular lattice has \(A_L = 0\), so the condition is vacuous.

Definition 38.17 (Split maximal lattices) A maximal lattice \(L'\) of signature \((2, n)\) is split if it decomposes as \[ L' \cong U\oplus L_1, \qquad L_1 \cong U\oplus L_0 , \] for some lattice \(L_0\); equivalently, if \(L'\) contains \(U^{\oplus 2}\) as an orthogonal direct summand.

Theorem 38.18 (Maximal lattices of signature $(2, n)$ split for $n\geq 5$) Every maximal lattice of signature \((2, n)\) with \(n\geq 5\) is split.

Proof. This is recorded in (Dawes 2022, sec. 3.1), where it is attributed to Attwell-Duval; split maximal lattices are also common for \(n < 5\), by the criterion of (Nikulin 1980 Cor. 1.13.5).

Theorem 38.19 (Transitivity on isotropic sublattices of a split maximal lattice)

Let \(L'\) be a split maximal lattice of signature \((2, n)\).

  1. For any primitive isotropic \(x, y\in L'\) there exists \(\tau(x, y)\in\Orth^+(L')\) with \(\tau(x, y)\,x = y\); in particular \(\Orth^+(L')\) acts transitively on primitive isotropic vectors.

  2. Two primitive totally isotropic sublattices \(E_1, E_2\iscontainedin L'\) lie in the same \(\Orth^+(L')\)-orbit if and only if \(E_1^{\perp}/E_1\cong E_2^{\perp}/E_2\).

Proof. Both statements are in (Dawes 2022, sec. 3.1): (1) is Algorithm 3.3, which constructs \(\tau(x,y)\) explicitly from the two hyperbolic summands of the split-maximal definition (Definition 38.17), and (2) is the orbit criterion of Attwell-Duval recorded there, together with the canonical \(\ZZ\)-basis \(S(E)\) that a totally isotropic sublattice of a maximal lattice determines.

38.6 Classification of unimodular lattices

Theorem 38.20 (Classification of indefinite unimodular lattices) Any indefinite unimodular lattice is determined up to isometry by its rank, index, and parity. Explicitly, an indefinite unimodular lattice of signature \((p, q)\) is isometric to \(\latI_{p, q} = \generators{1}^{\oplus p}\oplus\generators{-1}^{\oplus q}\) if it is odd, and to \(\latII_{p, q}\) (which requires \(p - q\equiv 0\pmod 8\)) if it is even. The same uniqueness by rank, index, and parity holds for definite unimodular lattices of rank at most \(8\).

Theorem 38.21 (Classification of small unimodular lattices)

Let \(L\) be any unimodular lattice, definite or indefinite, with \(\rank_\ZZ L\le 4\). Then either

  1. \(L\) is odd and \(L\cong\latI_{p, q}\) for some \((p, q)\) with \(p + q = \rank_\ZZ L\), or

  2. \(L\) is even and \(L\cong U\) or \(L\cong U^{\oplus 2}\).

Remark 38.22 The indefinite classification is Serre’s theorem on integral quadratic forms (Serre 1973 Ch. V); the uniqueness statement for definite unimodular lattices of small rank, and the \(\rank\le 4\) enumeration, are classical and may be found in Milnor–Husem"oller (Milnor and Husemöller 1973 Ch. II) and in Conway–Sloane (Conway and Sloane 2010 Ch. 15). The even case is especially rigid: in the range \(\rank_\ZZ L\le 4\) the only even unimodular lattices are \(U\) (rank \(2\)) and \(U^{\oplus 2}\) (rank \(4\)), there being no even unimodular lattice of odd rank and none of rank \(0\) other than the zero lattice. The constraint \(p - q\equiv 0\pmod 8\) for \(\latII_{p, q}\) reflects the fact that the signature of an even unimodular lattice is divisible by \(8\).

38.7 Finiteness of embeddings

Proposition 38.23 (Finiteness of embeddings into even unimodular lattices) If \(S\) and \(L\) are even lattices and \(L\) is unimodular, then \(\Emb(S, L)\) is a finite set.

Proof. By the unimodular-splitting proposition (Proposition 38.12) and the embedding-gluing description (Remark 38.10), a primitive embedding \(S\injects L\) into an even unimodular \(L\) is equivalent to the data of its orthogonal complement \(T\definedas S^{\perp L}\) together with an isometry \[ \gamma\colon A_S\xrightarrow{\;\sim\;} A_T(-1), \] because unimodularity of \(L\) forces the gluing subgroup to be the whole graph of \(\gamma\) (equivalently \(H_S = A_S\), \(H_T = A_T\)). Two such embeddings are equivalent in \(\Emb(S, L)\) if and only if the corresponding \(\gamma\) differ by the action of \(\Orth(q_T)\); the equivalence class therefore depends only on the isometry class of \(T\) and on a \(\Orth(q_T)\)-orbit of isometries \(A_S\isoto A_T(-1)\).

Each ingredient is finite. The discriminant groups \(A_S\) and \(A_T\) are finite abelian groups, so the set \(\operatorname{Isom}(A_S, A_T(-1))\) of discriminant-form isometries and the group \(\Orth(q_T)\) are finite. The isometry class of \(T\) is constrained to a fixed genus in the sense of the genus definition (Definition 37.14) (its signature is \(\sign L - \sign S\) and its discriminant form is \(-q_S\)), and a genus of lattices contains only finitely many isometry classes; equivalently, the class group \(\cl(T)\) from the genus definition (Definition 37.14) is finite. A finite union of finite sets of \(\Orth(q_T)\)-orbits is finite, so \(\Emb(S, L)\) is finite.

38.8 The exact sequence for scaled lattices

Proposition 38.24 (Discriminant group of a scaled lattice) Let \(L\) be a lattice and \(m\) a positive integer, and let \(L(m)\) be the twist of \(L\) by \(m\) ([[lattice-theory|Lattice Theory]]). There is a short exact sequence of finite abelian groups \[ 0 \to L/mL \to A_{L(m)} \to A_L \to 0 . \] In particular, if \(L\) is unimodular then \(A_L = 0\) and \(A_{L(m)}\cong L/mL\cong(\ZZ/m\ZZ)^{\rank L}\).

Proof. The underlying module of \(L(m)\) is \(L\), with form \(\beta_{L(m)} = m\beta_L\). Consequently the canonical map \(\iota_{L(m)}\colon L(m)\to \dualof{L(m)}\) is \(m\) times the canonical map \(\iota_L\colon L\to \dualof{L}\) after the identification \(\dualof{L(m)}\cong \dualof{L}\) of underlying modules. Thus \(\dualof{L(m)}\cong \dualof{L}\) and the image of \(L(m)\) inside \(\dualof{L(m)}\) is \(m\iota_L(L)\). The discriminant group is \[ A_{L(m)} = \dualof{L(m)}/L(m) \cong \dualof{L}/mL . \] The inclusion \(mL\iscontainedin L\iscontainedin \dualof{L}\) then yields the short exact sequence \[ 0 \to L/mL \to \dualof{L}/mL \to \dualof{L}/L \to 0, \] which is the claimed sequence \(0\to L/mL\to A_{L(m)}\to A_L\to 0\). If \(L\) is unimodular then \(\iota_L\) is an isomorphism, so \(A_L = 0\) and \(A_{L(m)}\cong L/mL\cong(\ZZ/m\ZZ)^{\rank L}\).

Proposition 38.25 (The orthogonal group exact sequence) Let \(L\) be a lattice. Every isometry \(f\in\Orth(L)\) extends by functoriality to an isometry of \(\dualof{L}\) and hence induces an automorphism of the discriminant form \(A_L\), defining a group homomorphism \[ \psi\colon\Orth(L)\to\Orth(q_L) . \] Writing \(\tilde\Orth(L)\definedas\ker\psi\) for the stable orthogonal group of \(L\) ([[lattice-theory|Lattice Theory]]) and \(\Orth^*(q_L)\definedas\coker\psi\), there is an exact sequence \[ 0 \to \tilde\Orth(L) \to \Orth(L) \xrightarrow{\;\psi\;} \Orth(q_L) \to \Orth^*(q_L) \to 0 . \]

Remark 38.26 The cokernel \(\Orth^*(q_L)\) measures the obstruction to lifting an automorphism of the discriminant form \(q_L\) to an isometry of \(L\). By Nikulin’s surjectivity criterion, \(\psi\) is surjective, i.e. \(\Orth^*(q_L) = 0\), whenever \(L\) is indefinite and \[ \ell(A_L) + 2 \le \rank L, \] where \(\ell(A_L)\) is the length from the discriminant-form definition (Definition 37.8), i.e. the minimal number of generators of \(A_L\) (Nikulin 1980 Cor. 1.5.2, Thm. 1.14.2). For a unimodular lattice such as \(U\) or \(E_8\) the discriminant group is trivial, so \(\Orth(q_L) = 0\) and \(\tilde\Orth(L) = \Orth(L)\); the same triviality underlies the surjectivity statement invoked for \(\lkt\) in the embedding-sequence lemma (Lemma 48.2).