Ambiguous boundaries and a common interior period #
Lemma 5.7 (lem:periodic-interior) of paper/nivat.tex. A forward boundary
rule propagates agreement to a right half-line. Periodicity of the difference
then rules out agreement on any complete boundary edge. Counting the resulting
ambiguous extensions bounds the complexity of a word whose letters collect
all the interior rows; Morse–Hedlund gives one period for those rows.
An agreeing boundary block extends indefinitely to the right when the next value is
determined by the preceding k agreeing letters. Lemma 5.7 (lem:periodic-interior).
A periodic difference that vanishes on a right half-line vanishes at every integer index.
Lemma 5.7 (lem:periodic-interior).
The occurring-pattern boundary rule holds for every translate of the configuration, because
translating both test positions preserves the rule. Lemma 5.8 (lem:row-lifting).
Two translates with agreeing interiors and a nonzero periodic boundary difference cannot
agree on any complete translated boundary edge: agreement would propagate to a half-line and
then to the whole boundary. Lemma 5.7 (lem:periodic-interior).
The interior patterns encountered by translating one configuration in the horizontal basis
direction. Lemma 5.7 (lem:periodic-interior).
Equations
- Nivat.TwoFactors.innerOrbit x C = Set.range fun (i : ℤ) => Nivat.patternAt x C (i, 0)
Instances For
The horizontal interior orbit is finite because it is a subset of the patterns of a
finite-range configuration on a finite window. Lemma 5.7 (lem:periodic-interior).
When every horizontally translated edge differs but the interiors agree, each encountered
interior pattern has two boundary extensions, so their number is bounded by the total
boundary cost. Lemma 5.7 (lem:periodic-interior).
Collecting one staggered coordinate from each interior row gives a finite-alphabet word
whose length-r complexity is at most r; Morse–Hedlund supplies one period for every
entire interior row. Lemma 5.7 (lem:periodic-interior).