ScalingStacks

Proof of theorem 5.5.2.

The case \(n\geq k\) is lemma 5.6.2. For \(k> n\), decompose the square as By Lemmas 5.6.2 and 5.6.3 the bottom and top squares are pullbacks, respectively. ◻