ScalingStacks

[009W]

Proposition 5.2.5.

Fix any \(n \geq -2\). A commutative square of spaces Original paper diagram in which the maps are truncated and connected as indicated is necessarily a pullback square.

[009X]

Proof.

Consider the commuting diagram Original paper diagram where we have used that truncated and connected maps are stable under pullback. By Lemma 5.2.4, the map \(A \rightarrow B \times_D C\) is both \(n\)-connected and \(n\)-truncated, and so is an equivalence. ◻

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Yu Leon Liu, Aaron Mazel-Gee, David Reutter, Catharina Stroppel, Paul Wedrich

Original source: arXiv:2401.02956v2

Original source · 2401.02956v2