Dice Question Streamline Icon: https://streamlinehq.com

Find a proof of redshift for TC(k(n)) independent of syntomic cohomology

Develop a proof, not relying on syntomic cohomology, that the topological cyclic homology TC(k(n)) of the connective cover k(n) of the (2p−2)-periodic Morava K-theory K(n) has chromatic height exactly n+1 (i.e., its T(n+1)-localization is nonzero while its T(m)-localizations vanish for all m>n+1).

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper proves chromatic redshift for algebraic K-theory of Morava K-theory by analyzing TC(k(n)) via syntomic cohomology, a sophisticated tool drawing on recent advances in prismatic theory.

The authors note that, despite substantial effort, no proof of redshift for TC(k(n)) avoiding syntomic cohomology is known, highlighting a methodological gap. An alternative argument could provide broader conceptual insight and potentially apply in contexts where syntomic techniques are unavailable or unwieldy.

References

Currently (and despite substantial effort), there is no proof of redshift for TC(k(n)) that does not rely on detailed information about syntomic cohomology.

Syntomic cohomology of Morava K-theory (2410.07048 - Angelini-Knoll et al., 9 Oct 2024) in Section 1.2 (following Remark 1.2.2)