AFTD Auto-Formalizing Theoretical Domains

op_518_positive_fibre_adj_of_adj

theoremverifiedformalization

For every natural number m > 0, and any functions u, v : OrderedTriple (Fin m) → ℤˣ that are rank-3 signotopes whose positive fibres are uniform rank-3 chirotopes on WithTop (Fin m), if u and v are adjacent in the higher Bruhat order bruhat_order_three_graph (Fin m), then their positive fibres are adjacent in chirotope_three_graph (WithTop (Fin m)).

Statement

theorem op_518_positive_fibre_adj_of_adj (m : ℕ) (hm : 0 < m) (u v : OrderedTriple (Fin m) → ℤˣ) (hu : is_rank_three_signotope u) (hv : is_rank_three_signotope v) (hu_chi : is_rank_three_uniform_chirotope (positive_fibre_three u)) (hv_chi : is_rank_three_uniform_chirotope (positive_fibre_three v)) (h : (bruhat_order_three_graph (Fin m)).Adj ⟨u, hu⟩ ⟨v, hv⟩) : (chirotope_three_graph (WithTop (Fin m))).Adj ⟨positive_fibre_three u, hu_chi⟩ ⟨positive_fibre_three v, hv_chi⟩
Formalizes
arXiv:2610.03808 Lemma 6.9(a)
Verified
27 Oct 2026
Axioms
Quot.soundpropext
Built on 9
  • OrderedTripleAn ordered triple in a preordered type is a triple of elements (a, b, c) with a < b and b < c.
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • is_rank_three_signotopeA function u : OrderedTriple α → ℤˣ assigning units of ℤ ({+1, -1}) to ordered triples in a linearly ordered type α is a rank-3 signotope…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • positive_fibre_threeThe positive fibre of a function u : OrderedTriple α → ℤˣ on a linearly ordered type α is the function on OrderedTriple (WithTop α) with…
  • is_rank_three_uniform_chirotopeA function chi : OrderedTriple α → ℤˣ assigning units of ℤ to ordered triples in a linearly ordered type α is a uniform rank-3 chirotope…
  • differs_at_oneTwo functions f and g of type ι → ℤˣ (taking values in the units of ℤ, {+1, -1}) differ at exactly one index if there is a unique index i…
  • chirotope_three_graphThe mutation walk graph of uniform rank-3 chirotopes on Ω is the simple graph whose vertices are uniform rank-3 chirotopes chi :…
  • bruhat_order_three_graphThe higher Bruhat order B(α, 2) is the simple graph whose vertices are rank-3 signotopes u : OrderedTriple α → ℤˣ (subtypes of functions…

Read back from the Lean

For any natural number $m$ with $0 < m$, and any two sign-assignments on ordered triples of $\mathrm{Fin}(m)$, $u, v : \mathrm{OrderedTriple}(\mathrm{Fin}(m)) \to \mathbb{Z}^\times$: assume that: 1. $u$ is a rank-three signotope (is_rank_three_signotope u), 2. $v$ is a rank-three signotope (is_rank_three_signotope v), 3. the positive fibre extension of $u$ to $\mathrm{WithTop}(\mathrm{Fin}(m))$ is a rank-three uniform chirotope (is_rank_three_uniform_chirotope (positive_fibre_three u)), 4. the positive fibre extension of $v$ to $\mathrm{WithTop}(\mathrm{Fin}(m))$ is a rank-three uniform chirotope (is_rank_three_uniform_chirotope (positive_fibre_three v)), and 5. $\langle u, hu \rangle$ and $\langle v, hv \rangle$ are adjacent in the Bruhat order graph bruhat_order_three_graph (Fin m) (that is, $u$ and $v$ differ at exactly one ordered triple of $\mathrm{Fin}(m)$); then $\langle \mathrm{positive\_fibre\_three}(u), hu\_chi \rangle$ and $\langle \mathrm{positive\_fibre\_three}(v), hv\_chi \rangle$ are adjacent in the chirotope graph chirotope_three_graph (WithTop (Fin m)) (that is, their positive fibre extensions differ at exactly one ordered triple of $\mathrm{WithTop}(\mathrm{Fin}(m))$).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The theorem shows that an edge in the higher Bruhat graph B(m, 2) maps to an edge in the rank-3 chirotope mutation graph via the positive fibre construction. Adjacency in both graphs means differing at exactly one triple. Since u and v differ at a unique triple t₀, their positive fibres also differ at the triple t̃₀ obtained by embedding t₀ into WithTop (Fin m). Any triple containing the top element evaluates to 1 under both fibres, so no other differences can occur, establishing that t̃₀ is the unique triple of disagreement.

  1. Adjacency of u and v in the higher Bruhat graph means they differ at a unique ordered triple t₀.

    Adjacency in bruhat_order_three_graph and chirotope_three_graph is defined as differing at exactly one triple (differs_at_one). Unfolding this definition on the adjacency hypothesis h yields a unique triple t₀ ∈ OrderedTriple (Fin m) such that u(t₀) ≠ v(t₀) and u(y) = v(y) for all y ≠ t₀.

    lines 3–6

      have _ := hm
      change differs_at_one (positive_fibre_three u) (positive_fibre_three v)
      have h_diff : differs_at_one u v := h
      rcases h_diff with ⟨t₀, ht₀_ne, ht₀_uniq⟩
  2. The candidate triple at which the positive fibres differ is the coerced triple t̃₀ = ⟨some t₀.a, some t₀.b, some t₀.c, ...⟩.

    To show differs_at_one for the positive fibres, we must provide a witness and show it is unique. We propose the triple formed by embedding each coordinate of t₀ into WithTop (Fin m) via some, preserving the strict inequalities t₀.a < t₀.b and t₀.b < t₀.c using WithTop.coe_lt_coe.mpr. This splits the goal into showing that the fibres differ at t̃₀ and that any triple where they differ equals t̃₀.

    line 7

    uses WithTop.coe_lt_coe.mpr

      refine ⟨⟨some t₀.a, some t₀.b, some t₀.c, WithTop.coe_lt_coe.mpr t₀.ab, WithTop.coe_lt_coe.mpr t₀.bc⟩, ?_, ?_⟩
  3. The positive fibres of u and v differ at t̃₀.

    For any triple whose components are all proper elements of Fin m, positive_fibre_three evaluates by definition to the underlying signotope. Thus positive_fibre_three u t̃₀ = u(t₀) and positive_fibre_three v t̃₀ = v(t₀). Since u(t₀) ≠ v(t₀), assuming the positive fibres are equal leads directly to a contradiction.

    lines 8–12

      · intro h_eq
        apply ht₀_ne
        have h1 : positive_fibre_three u ⟨some t₀.a, some t₀.b, some t₀.c, WithTop.coe_lt_coe.mpr t₀.ab, WithTop.coe_lt_coe.mpr t₀.bc⟩ = u t₀ := rfl
        have h2 : positive_fibre_three v ⟨some t₀.a, some t₀.b, some t₀.c, WithTop.coe_lt_coe.mpr t₀.ab, WithTop.coe_lt_coe.mpr t₀.bc⟩ = v t₀ := rfl
        rw [← h1, ← h2, h_eq]
  4. Any triple at which the positive fibres differ cannot contain the top element (none).

    Let t = ⟨a, b, c, hab, hbc⟩ be an ordered triple in WithTop (Fin m) at which the positive fibres differ. If a = none, b = none, or c = none, the definition of positive_fibre_three defaults to 1 for both u and v. This would make both fibres equal to 1, contradicting the hypothesis that they differ. Therefore, all three coordinates must be of the form some.

    lines 13–20

      · intro t ht
        rcases t with ⟨a, b, c, hab, hbc⟩
        rcases a with _ | a
        · exact (ht rfl).elim
        · rcases b with _ | b
          · exact (ht rfl).elim
          · rcases c with _ | c
            · exact (ht rfl).elim
  5. Any triple where the positive fibres differ must equal t̃₀.

    Since all coordinates are proper elements of Fin m, the positive fibres evaluate to u and v on the underlying triple in Fin m (with inequalities recovered via WithTop.coe_lt_coe.mp). Because the fibres differ, u and v differ at this triple, so by the uniqueness of t₀ it must equal t₀. Hence t = t̃₀, completing the proof of uniqueness.

    lines 21–26

    uses WithTop.coe_lt_coe.mp

            · have h_ne : u ⟨a, b, c, WithTop.coe_lt_coe.mp hab, WithTop.coe_lt_coe.mp hbc⟩ ≠
                          v ⟨a, b, c, WithTop.coe_lt_coe.mp hab, WithTop.coe_lt_coe.mp hbc⟩ := ht
              have h_eq : (⟨a, b, c, WithTop.coe_lt_coe.mp hab, WithTop.coe_lt_coe.mp hbc⟩ : OrderedTriple (Fin m)) = t₀ :=
                ht₀_uniq _ h_ne
              subst h_eq
              rfl
WithTop.coe_lt_coe.mpr
A strict inequality a < b in α implies the strict inequality ↑a < ↑b between their coercions into WithTop α.
WithTop.coe_lt_coe.mp
A strict inequality ↑a < ↑b between coerced elements in WithTop α implies the strict inequality a < b in α.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- An adjacent step in B(m, 2) maps to an adjacent step in the rank-3 chirotope mutation graph. -/theorem op_518_positive_fibre_adj_of_adj (m : ℕ) (hm : 0 < m) (u v : OrderedTriple (Fin m) → ℤˣ) (hu : is_rank_three_signotope u) (hv : is_rank_three_signotope v) (hu_chi : is_rank_three_uniform_chirotope (positive_fibre_three u)) (hv_chi : is_rank_three_uniform_chirotope (positive_fibre_three v)) (h : (bruhat_order_three_graph (Fin m)).Adj ⟨u, hu⟩ ⟨v, hv⟩) : (chirotope_three_graph (WithTop (Fin m))).Adj ⟨positive_fibre_three u, hu_chi⟩ ⟨positive_fibre_three v, hv_chi⟩ := by  have _ := hm  change differs_at_one (positive_fibre_three u) (positive_fibre_three v)  have h_diff : differs_at_one u v := h  rcases h_diff with ⟨t₀, ht₀_ne, ht₀_uniq⟩  refine ⟨⟨some t₀.a, some t₀.b, some t₀.c, WithTop.coe_lt_coe.mpr t₀.ab, WithTop.coe_lt_coe.mpr t₀.bc⟩, ?_, ?_⟩  · intro h_eq    apply ht₀_ne    have h1 : positive_fibre_three u ⟨some t₀.a, some t₀.b, some t₀.c, WithTop.coe_lt_coe.mpr t₀.ab, WithTop.coe_lt_coe.mpr t₀.bc⟩ = u t₀ := rfl    have h2 : positive_fibre_three v ⟨some t₀.a, some t₀.b, some t₀.c, WithTop.coe_lt_coe.mpr t₀.ab, WithTop.coe_lt_coe.mpr t₀.bc⟩ = v t₀ := rfl    rw [← h1, ← h2, h_eq]  · intro t ht    rcases t with ⟨a, b, c, hab, hbc⟩    rcases a with _ | a    · exact (ht rfl).elim    · rcases b with _ | b      · exact (ht rfl).elim      · rcases c with _ | c        · exact (ht rfl).elim        · have h_ne : u ⟨a, b, c, WithTop.coe_lt_coe.mp hab, WithTop.coe_lt_coe.mp hbc⟩ ≠                      v ⟨a, b, c, WithTop.coe_lt_coe.mp hab, WithTop.coe_lt_coe.mp hbc⟩ := ht          have h_eq : (⟨a, b, c, WithTop.coe_lt_coe.mp hab, WithTop.coe_lt_coe.mp hbc⟩ : OrderedTriple (Fin m)) = t₀ :=            ht₀_uniq _ h_ne          subst h_eq          rfl
See it in the graphDiscuss this resultChallenge it