ScalingStacks

Proof. [02RG]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

We consider the inclusion ℤ→N~​(Λ)\mathbb{Z}\to{\widetilde{N}}(\Lambda) that sends n∈ℤn\in\mathbb{Z} to the class of (0,n)(0,n). There is a commutative diagram with exact rows and columns

0\textstyle{0\ignorespaces\ignorespaces\ignorespaces\ignorespaces}0\textstyle{0\ignorespaces\ignorespaces\ignorespaces\ignorespaces}0\textstyle{0\ignorespaces\ignorespaces\ignorespaces\ignorespaces}N⁡(Λ)∩ℤ\textstyle{N(\Lambda)\cap\mathbb{Z}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}ℤ\textstyle{\mathbb{Z}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}ℤ/(N⁡(Λ)∩ℤ)\textstyle{\mathbb{Z}/(N(\Lambda)\cap\mathbb{Z})\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}0\textstyle{0}0\textstyle{0\ignorespaces\ignorespaces\ignorespaces\ignorespaces}N⁡(Λ)\textstyle{N(\Lambda)\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}N~​(Λ)\textstyle{{\widetilde{N}}(\Lambda)\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}N~​(Λ)/N​(Λ)\textstyle{{\widetilde{N}}(\Lambda)/N(\Lambda)\ignorespaces\ignorespaces\ignorespaces\ignorespaces}0\textstyle{0}N⁡(Λ)/(N⁡(Λ)∩ℤ)\textstyle{N(\Lambda)/(N(\Lambda)\cap\mathbb{Z})\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}N~​(Λ)/ℤ\textstyle{{\widetilde{N}}(\Lambda)/\mathbb{Z}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}0\textstyle{0}0\textstyle{0}

It is easy to see that the bottom arrow in the diagram is an isomorphism. By the Snake lemma the right vertical arrow is an isomorphism. Therefore

mult(Λ)=[ℤ:N(Λ)∩ℤ].\operatorname{mult}(\Lambda)=[\mathbb{Z}:N(\Lambda)\cap\mathbb{Z}].

We verify that N(Λ)∩ℤ={n∈ℤ∣∃p∈aff(Λ),np∈N},N(\Lambda)\cap\mathbb{Z}=\{n\in\mathbb{Z}\mid\exists p\in\operatorname{aff}(\Lambda),\ np\in N\}, from which the lemma follows. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.