Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

The unique middle label of a reconnected cap

Abstract

The unique middle label of a reconnected cap.

Theorem 1.1 (The unique middle label of a reconnected cap).

Proof. Machine-checked in Lean as D5/S3/Combinatorics/PerfectMatchings/NonclosedCapLabels.cap_outer_label (✓ std3). ∎

Source. Repository-derived.

Commentary.

Partner-closed intervals transport the labels through all intervening arcs in every relative-order case of a nonclosed cap.

Theorem 1.2 (The unique middle label of a reconnected cap).

Proof. Machine-checked in Lean as D5/S3/Combinatorics/PerfectMatchings/NonclosedCapLabels.nonclose_compatible_iff (✓ std3). ∎

Source. Repository-derived.

Commentary.

Compatibility after reconnecting the two original partners is equivalent to compatibility before surgery with exactly the prescribed middle label. Both side equations and every surviving endpoint are retained.

References