Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Coprime Double Commutation

Abstract

Coprime address translations doubly commute and their divisible subspaces meet at the product address.

Theorem 1.1 (Coprime backward and forward shifts commute).

Proof. Machine-checked in Lean as D5/S3/Zeros/NicaCovariance/DoubleCommutation.backward_shift_comp_forward_translation_of_coprime (✓ std3). ∎

Source. Repository-derived.

Commentary.

At a coordinate divisible by v, both compositions recover the same coefficient after swapping the normalized additions of u and v. At every other coordinate, coprimality cancels the u factor from the divisibility test, so both zero-extended translations vanish.

Theorem 1.2 (Coprime forward translations doubly commute).

Proof. Machine-checked in Lean as D5/S3/Zeros/NicaCovariance/DoubleCommutation.adjoint_forward_translation_comp_of_coprime (✓ std3). ∎

Source. Repository-derived.

Commentary.

The adjoint of forward translation by u is the backward shift by u. The double-commutation identity is therefore the preceding coprime commutation theorem after rewriting that adjoint, with no additional coordinate argument.

Theorem 1.3 (Coprime divisible subspaces meet at the product address).

Proof. Machine-checked in Lean as D5/S3/Zeros/NicaCovariance/DoubleCommutation.divisibleSubspace_inf_of_coprime (✓ std3). ∎

Source. Repository-derived.

Commentary.

Membership in the meet means that a coefficient family vanishes away from both divisibility supports. For coprime encoded addresses, divisibility by their product is equivalent to simultaneous divisibility by u and v, so the meet is exactly the subspace at their normalized table sum.

References