Definition Transported edge scores, schedules and remaining conditions
✓ definition formalized

Transported edge scores, schedules and remaining conditions

Fix finite-generator real Coxeter systems \(W,W'\) and an interval order isomorphism \[ \varphi:[u,b]_W\simeq[u',b']_{W'}. \] Let \(E\) be the finite set of source-interval reflection edges.

The transported edge and its score

For \(e:x\to_Wy\), reflection-graph invariance gives the target edge \[ \varphi_*e:\varphi(x)\to_{W'}\varphi(y). \] Its positive target root is \(\alpha'_e\). Define the transported slope \[ s(e)=\sigma'(\alpha'_e), \] where \(\sigma'\) is the target geometric slope.

The edge map is injective: equality of target edges gives equality of both target endpoints, and injectivity of \(\varphi\) gives equality of both source endpoints. It also reaches every target edge between vertices of \([u',b']\): apply \(\varphi^{-1}\) to both endpoints and use reflection-graph invariance in reverse.

Lean's transportedScore is a lexicographic pair of real numbers. For its chosen geometric functional, evaluation on a normalized positive root is its geometric slope, so the pair is \[ \operatorname{score}(e)=(s(e),s(e)). \] Thus comparison of these pairs agrees with comparison of the real transported slopes.

Sorting the full edge set

For a finite set \(F\) and a score in any linearly ordered set, sortedSchedule converts \(F\) to a list and applies merge sort using the comparison \[ \operatorname{score}(f)\le\operatorname{score}(e) \] to place \(e\) before \(f\). Merge sort preserves the entries of the original list, so the result contains each member of \(F\) exactly once. Its scores are weakly decreasing.

The transported schedule \(\mathcal T\) uses the full edge set \(E\) and the transported score. Hence it contains every source-interval edge once, and for positions \(i<j\), \[ s(\mathcal T_i)\ge s(\mathcal T_j). \] The chronological schedule is its reverse, \[ \mathcal C=\operatorname{reverse}(\mathcal T). \] It also contains every edge once, with weakly increasing slopes.

For example, if two edges have score \(1\) and another has score \(3\), the chronological score list is \(1,1,3\). The two equal-scored edges occupy adjacent positions; each edge still occurs once.

The two list directions

An elementary edge operator acts on a vector of vertex values. In a written product, the rightmost operator acts first. The decreasing transported schedule describes the written outermost-first product. Its reversed chronological schedule describes successive removal of edge conditions from the vertices.

Remaining outgoing conditions

For any list \(p\) of interval edges and vertex \(x\), define \[ \mathcal R_p(x)= \{f\in\operatorname{Out}(x):f\text{ occurs in }p\}. \] This is remainingConditions. The empty list gives the empty selection. If \(p\) contains every edge, it gives the full outgoing selection.

For any list beginning with \(e:x\to y\) and followed by \(q\), the source selection is \[ \mathcal R_{e::q}(x)=\{e\}\cup\mathcal R_q(x). \] Selections at vertices other than \(x\) are unchanged by removing the first entry. In particular the condition set at \(y\) is unchanged because an upward edge has distinct endpoints.

For a duplicate-free list, \(e\) does not occur in \(q\), so removing the first entry deletes exactly that source condition. This applies to the chronological schedule.

For a suffix consisting of the current edge \(e\) followed by a list \(q\), the schedule-suffix theorem identifies \(\mathcal R_q(x)\) and \(\mathcal R_q(y)\) with strict later-score conditions at the two endpoints.

Relation to the OpenAI notes

Exact suffix conditions specialize the ambient inclusion.

OpenAI notes: The notes formulate the current endpoint conditions as the edges strictly later than the current edge in a transported reflection order. dih:count, edge:bound.

Lean (primary): The actual schedule is a complete duplicate-free sorted list with a diagonal lexicographic score; its reverse is chronological. Two sorted-list lemmas, same-source score injectivity and consecutive-edge score inequality identify both suffix selections with the ambient later-edge set. Upper-interval restriction then transfers both kernels and the upper freeness hypothesis. EdgeLocalization:40, PositiveTransfer:1228, PositiveTransfer:1225, PositiveTransfer:1306, PositiveTransfer:1315, TerminalKernels:1126.

Role in the proof: The Blueprint states the exact suffix assumption and distinguishes weak list ordering from the strict score test at the two current endpoints.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.SchedulePaths.sortedSchedule: ReflectionOrders.lean:582.

OAI.KLInvariance.SchedulePaths.mem_sortedSchedule: ReflectionOrders.lean:585.

OAI.KLInvariance.SchedulePaths.sortedSchedule_nodup: ReflectionOrders.lean:588.

OAI.KLInvariance.SchedulePaths.sortedSchedule_pairwise: ReflectionOrders.lean:592.

OAI.KLInvariance.BruhatGraph.transportedEdge: EdgeLocalization.lean:23.

OAI.KLInvariance.BruhatGraph.transportedEdge_injective: EdgeLocalization.lean:28.

OAI.KLInvariance.BruhatGraph.transportedEdge_lift: EdgeLocalization.lean:62.

OAI.KLInvariance.BruhatGraph.transportedScore: EdgeLocalization.lean:35.

OAI.KLInvariance.BruhatGraph.transportedSlope: PositiveTransfer.lean:1222.

OAI.KLInvariance.BruhatGraph.transportedScore_eq: PositiveTransfer.lean:1228.

OAI.KLInvariance.BruhatGraph.transportedSchedule: EdgeLocalization.lean:40.

OAI.KLInvariance.BruhatGraph.transportedSchedule_nodup: EdgeLocalization.lean:45.

OAI.KLInvariance.BruhatGraph.transportedSchedule_full: EdgeLocalization.lean:50.

OAI.KLInvariance.BruhatGraph.transportedSchedule_pairwise: EdgeLocalization.lean:56.

OAI.KLInvariance.BruhatGraph.chronologicalSchedule: PositiveTransfer.lean:1225.

OAI.KLInvariance.BruhatGraph.chronologicalSchedule_pairwise: PositiveTransfer.lean:1234.

OAI.KLInvariance.BruhatGraph.chronologicalSchedule_nodup: PositiveTransfer.lean:1244.

OAI.KLInvariance.BruhatGraph.chronologicalSchedule_full: PositiveTransfer.lean:1248.

OAI.KLInvariance.BruhatGraph.remainingConditions: PositiveTransfer.lean:1089.

OAI.KLInvariance.BruhatGraph.remainingConditions_nil: PositiveTransfer.lean:1093.

OAI.KLInvariance.BruhatGraph.remainingConditions_cons_source: PositiveTransfer.lean:1097.

OAI.KLInvariance.BruhatGraph.remainingConditions_cons_other: PositiveTransfer.lean:1105.

Used by