Definition Freeness of all terminal kernels in a transported schedule
✓ definition formalized

Freeness of all terminal kernels in a transported schedule

For an interval isomorphism and the edge-processing order transported from the target reflection order, terminal-kernel freeness means the following:

For every suffix of the processing order and every vertex \(x\) in the interval, retain exactly the upward conditions at \(x\) belonging to that suffix. The resulting module \(L_x(F)\) is free over the coefficient polynomial ring.

The condition quantifies every vertex and every suffix. It is therefore compatible with induction through smaller upper intervals.

References

6. Reciprocity and simultaneous induction.

Lean formalization

OAI.KLInvariance.BruhatGraph.FreeSuffixes: SimultaneousInvariance.lean:118.

Used by