ScalingStacks

Proof. [03DN]

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.

All statements follow easily from the definition of LλL_{\lambda}. Namely, the cells correspond to the subsets I⊂Δ∩(ℤd)∗I\subset\Delta\cap(\mathbb{Z}^{d})^{*}: the corresponding linear functions ⟨m,n⟩+λ⁡(m),m∈I\langle m,n\rangle+\lambda(m),\ m\in I, saturate the maximum in LλL_{\lambda}. Since λ\lambda is a concave function this can happen only if II is a set of vertices of some simplex σ¯∈S∗{0}\overline{\sigma}\in S\ast\{0\}. This proves (1).

For (3) we notice that a dd-cell is a domain of linearity of LλL_{\lambda}, labeled by the vertex m∈vert⁡(S)∪{0}m\in\operatorname{vert}(S)\cup\{0\} whose corresponding linear function ⟨m,n⟩+λ⁡(m)\langle m,n\rangle+\lambda(m) is maximal. In particular, the central cell Q{0}λQ^{\lambda}_{\{0\}} is the set of n∈ℝdn\in\mathbb{R}^{d}, such that the maximum is achieved by ⟨{0},n⟩+λ⁡(0)\langle\{0\},n\rangle+\lambda(0), i.e.

⟨m,n⟩+λ⁡(m)≤λ⁡(0), all ​m∈Δ∩(ℤd)∗,\langle m,n\rangle+\lambda(m)\leq\lambda(0),\ \text{ all }m\in\Delta\cap(\mathbb{Z}^{d})^{*},

which are exactly the defining inequalities for Δλ∨\Delta^{\vee}_{\lambda}.

More generally, a point nn is in (the closure of) Qσ¯λQ^{\lambda}_{\overline{\sigma}} if and only if:

⟨m−v,n⟩+λ⁡(m)≤λ⁡(v)−λ⁡(m), all ​v∈vert​σ¯,m∈Δ∩(ℤd)∗,\displaystyle\langle m-v,n\rangle+\lambda(m)\leq\lambda(v)-\lambda(m),\ \text{ all }v\in\mathrm{vert}\overline{\sigma},\ m\in\Delta\cap(\mathbb{Z}^{d})^{*},
 and ​⟨v1,n⟩+λ⁡(v1)=⟨v2,n⟩+λ⁡(v2),v1,v2∈vert⁡(σ¯),\displaystyle\text{ and }\ \langle v_{1},n\rangle+\lambda(v_{1})=\langle v_{2},n\rangle+\lambda(v_{2}),\ v_{1},v_{2}\in\mathrm{vert}(\overline{\sigma}),

which are exactly the defining inequalities for the polyhedron Fσ∨+NCΔ⁡(σ¯)F^{\vee}_{\sigma}+\operatorname{NC}_{\Delta}(\overline{\sigma}). ∎

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