exercise 53.1.
The two accesses require {(?𝗐𝗂𝖽𝗍𝗁,𝗂𝗇𝗍)} and {(?𝗁𝖾𝗂𝗀𝗁𝗍,𝗂𝗇𝗍)}; the constant requires empty. The inner addition takes the union of height with empty, and the outer addition unions width with that result. Since 𝑅 ∧𝖼𝑆 =𝑅 ∪𝑆 =𝑅 ⊕𝖼𝑆, condition 𝐹 is reflexivity of subset inclusion.
exercise 53.2.
Take the discrete preorder on {𝑎,𝑢,𝑏} and set 𝗎𝗌𝖾 =𝑢. Neither 𝑎 ≤𝑢 nor 𝑢 ≤𝑎 holds, so use is neither greatest nor least. Consequently the first step of both pointed substitution proofs is unavailable. This only blocks those proofs; it is not a counterexample to preservation.
exercise 53.3.
The body 𝑥 +𝑥 contracts ⟨1⟩ and ⟨1⟩ to the latent scalar 2. The argument 𝑦 +𝑦 has vector ⟨2⟩. Application scales it to 2 ×⟨2⟩ =⟨4⟩. The two additions occur inside the separate body and argument derivations; multiplication occurs only at application.
exercise 53.4.
Flat call-by-value substitutes an argument at 𝗎𝗌𝖾 and retains the receiving scalar. Top-pointed call-by-name first uses 𝑠 ≤𝗎𝗌𝖾 and has the same conclusion. Bottom-pointed call-by-name concludes at 𝑟 ⊛𝑠 and needs equality, commutativity, and idempotence of the three flat operations. Structural substitution replaces the bound variable’s vector cell 𝑟 by 𝑟 ⊛𝑆; its unique position removes the need for pointedness.
exercise 53.5.
Let 𝜌(?𝑤) =4, 𝜌(?ℎ) =7, and take (𝜌,(4,7)) ∈𝐷𝑅∪𝑆(𝗂𝗇𝗍 ×𝗂𝗇𝗍). The split image is (𝜌|𝑅,4) ∈𝐷𝑅(𝗂𝗇𝗍) and (𝜌|𝑆,7) ∈𝐷𝑆(𝗂𝗇𝗍). For the separate forgetting square, res𝑅∅(res𝑅∪𝑆𝑅(𝜌,(4,7)))=((𝜌|𝑅)|∅,(4,7))=(𝜌|∅,(4,7)), because restriction composes by intersection. The path through 𝑆 is res𝑆∅(res𝑅∪𝑆𝑆(𝜌,(4,7)))=((𝜌|𝑆)|∅,(4,7))=(𝜌|∅,(4,7)). Hence the square commutes in 𝐷∅(𝗂𝗇𝗍 ×𝗂𝗇𝗍).
exercise 53.6.
The least vector is ⟨3,1⟩: the maximum offsets for 𝑥 and 𝑦 are 3 and 1. At time 3, the three reads are 𝜌(𝑥)1, 𝜌(𝑦)2, and 𝜌(𝑥)0, in syntax order.