Words / CONCEPT
AdaptiveMergePrefix
For an arbitrary additive commutative group, a word is Good exactly when every nonempty proper contiguous interval has nonzero sum. Equality of prefixes at i < j is permitted only for i = 0 and j = length. The entire word may have sum zero. The prefixSum and ProperIntervals names transparently use SeparatedPrefixReflection.pref and Good. The equivalence directly consumes that original module's good_iff, with no finite-ambient, torsion, nonzero-total, strict-cone or separation assumption. This consumed adapter supplies no new mathematical content.
Prefix collisions exactly characterize proper intervals
RELATIONSHIP ATLAS
Every connection, in context.
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A zero pair and its original complementstructural-affinity · Closed
- AdaptiveMergeRepairstructural-affinity · Closed
- AdaptiveMergeSignedForkstructural-affinity · Closed
- AdaptiveMergeZeroCrossingstructural-affinity · Closed
- Affine prefix geometry on actual wordsstructural-affinity · Closed
- Original-label Good orders above half girthstructural-affinity · Closed
- Restricted pair sums and additive stabilizersstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Certified provenance