Matching works

1 work

math.CT — Category Theory

Higher Galois Recognition and Parameter Descent

Contributed by Zhenyu Sun

Let n≥0n\geq0 and let X\mathcal X be a bounded coherent ∞\infty-topos. Suppose that finitely many noninitial coherent nn-truncated objects cover its terminal object, and that every coherent nn-truncated object in each of their slices has a finite covering family of sections. We identify X≤ncoh\mathcal X^{\mathrm{coh}}_{\leq n} with Fun⁡(M,Sπ,≤n)\operatorname{Fun}(M,\mathcal S_{\pi,\leq n}) for a π\pi-finite (n+1)(n+1)-type MM, recovered by all finite models preserving finite limits, finite coproducts, and effective epimorphisms. Descent uses degrees through n+2n+2 for objects and n+1n+1 for maps; both bounds are sharp for finite homotopy actions. Every exact functor FF between recognized categories has a universal parameter PF=F!(1)P_F=F_!(1) and a canonical factorization through its slice with fully faithful second functor. This parameter characterizes full faithfulness, conservativity, and all exact slice factorizations. For successive abelian Postnikov layers, we identify the space of marked exact lifts with a path space of Eilenberg--Mac Lane sections with local coefficients. The obstruction, classes of lifts, and relative automorphisms occur in degrees r+1r+1, rr, and r−1r-1. We compute a twisted parity obstruction and, for odd primes, classify cyclic self-equivalence components by a pp-adic valuation. A nonzero Postnikov class can persist in the identity component. For continuous finite families over a profinite (n+1)(n+1)-type, we prove that a uniform finite-section atlas exists precisely when the complete model space is π\pi-finite. Exact functors from finite model semantics, together with their lift spaces, satisfy finite-stage descent, while explicit profinite examples separate objectwise trivialization from uniform parameter elimination.

Author comments: 49 pages. Second paper in the series Model groupoids and finite homotopy semantics. Includes two verification scripts and their outputs.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 11, 202649 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations