Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.34992

Semiadditive Power Operations in Chromatic Height $1$

Beckham Myers
View original source ↗Read source document ↗Export metadata ↓

Abstract

We recast the theory of power operations in chromatic height $1$ using higher semiadditivity. In particular, we show that if the height $1$ cyclotomic extension of a commutative algebra $R$ is Galois, then power operations on $R$-algebras are exactly $δ$-ring operations. We also show that semiadditive power operations on chromatically localized algebraic $K$-theory agree with power operations defined using polynomial functoriality. As an application, we deduce that the map from the $K$-theory of a $\mathbb{Q}$-linear symmetric monoidal category to its $K(1)$-localization is a $δ$-ring homomorphism on the level of underlying spaces. It is well known that operations on the $K$-theory of $\mathbb{Q}$-linear symmetric monoidal categories are $λ$-ring operations, and since $δ$-rings are `$p$-typical' $λ$-rings, this is an instance of the redshift philosophy.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Beckham Myers. 2026-10-26. Semiadditive Power Operations in Chromatic Height $1$. https://arxiv.org/abs/2610.34992

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A minimising principle for interval covers of zigzag persistence modules

Zigzag persistence modules serve as an essential tool in topological data analysis. The fundamental theorem of persistent homology states that any zigzag persistence module decomposes into a direct sum of simple building blocks called interval modules. We consider an interval cover, a possibly redundant family of interval submodules spanning every vertex space of a finite zigzag persistence module. We give an elementary descent argument that replaces a redundant cover with a minimal one that is an interval decomposition. This provides an optimisation perspective on persistence modules and their interval decomposition. As an application, we give an estimate of the generalised rank invariant in terms of a cover.

math.AT↗
arXiv2026

Limit Computation Over Posets via Minimal Initial Functors

It is well known that limits can be computed by restricting along an initial functor, and that this often simplifies limit computation. We systematically study the algorithmic implications of this idea for diagrams indexed by a poset. We say an initial functor $F\colon C\to D$ with $C$ small is minimal if the sets of objects and morphisms of $C$ each have minimum cardinality, among the sources of all initial functors with target $D$. For $Q$ a finite poset or $Q\subseteq \mathbb N^d$ an interval (i.e., a convex, connected subposet), we describe all minimal initial functors $F\colon P\to Q$. In particular, we show that such $F$ is always a subposet inclusion, up to isomorphism. We give efficient algorithms to compute a choice of minimal initial functor. In the case that $Q\subseteq \mathbb N^d$ is an interval, we give asymptotically optimal bounds on $|\hom P|$, the number of relations in $P$ (including identities), in terms of the number $n$ of minima of $Q$: We show that $|\hom P|=Θ(n)$ for $d\leq 3$, and $|\hom P|=Θ(n^2)$ for $d>3$. We apply these results to give new bounds on the cost of computing $\lim G$ for a functor $G \colon Q\to \mathbf{Vec}$ valued in vector spaces. For $Q$ connected, we also give new bounds on the cost of computing the generalized rank of $G$ (i.e., the rank of the induced map $\lim G\to \operatorname{colim} G$), which is of interest in topological data analysis.

math.AT↗
arXiv2026

New Bounds on Distributional Sectional Category and Applications to Distributional Homotopic Distance

In this paper, we establish several new bounds for the distributional sectional category ($\mathrm{dsecat}$). We first prove Jauhari's conjecture, thereby establishing a cohomological lower bound for $\mathrm{dsecat}$ with arbitrary coefficients. We then obtain an analogous lower bound with rational coefficients by constructing a natural graded $\mathbb{Q}$-linear section of the homomorphism induced in cohomology by the symmetric diagonal. As applications, we provide several computations of the distributional sectional category. We also establish multiplicative product and composition inequalities for $\mathrm{dsecat}$. Finally, we apply these results to distributional homotopic distance. A sequential version of this invariant was recently introduced by Jauhari and Oprea; we give an equivalent formulation in terms of distributed homotopies and derive new fibration and multiplicative triangle inequalities.

math.AT↗