AFTD Auto-Formalizing Theoretical Domains

condorcet_join_cycle_tensor_mixed_fiber_bound

theoremverified

For the fixed19-vertex residue tournament, let left and right real fiber masses lie between0 and a common nonnegative bound k. Assume that both sides have a positive entry, some fiber on either side is zero, and whenever a tournament triangle has a positive opposite-side root, the masses at its other two vertices on the chosen side sum to at most k. Then twice the combined mass is at most37*k. This is a certificate for a particular tensor-family obstruction, not a statement about arbitrary S3 relations.

Statement

theorem condorcet_join_cycle_tensor_mixed_fiber_bound
    (l r : Fin 19 → ℝ) (k : ℝ) (hk : 0 ≤ k)
    (hl : ∀ a, 0 ≤ l a ∧ l a ≤ k) (hr : ∀ a, 0 ≤ r a ∧ r a ≤ k)
    (hlpos : ∃ a, 0 < l a) (hrpos : ∃ a, 0 < r a)
    (hmissing : ∃ a, l a = 0 ∨ r a = 0)
    (htri : ∀ a b c, condorcet_tensor_triangle a b c →
      (0 < r c → l a+l b ≤ k) ∧ (0 < l c → r a+r b ≤ k)) :
    2 * ((∑ a, l a)+(∑ a, r a)) ≤ 37*k
Source
IN-372 supporting structural diagnostic for OP-19, 2026-10-30. Exact finite certificates and source/counting arguments documented in In372Oct30/ResearchNotes.txt. No novelty or research advance is claimed; the main election statement remains unchanged.
Verified
30 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • condorcet_private_triple_stationarity_obstructionThere exist a strict tournament R on19 vertices with a common predecessor for every ordered triple, a chosen three-element set J(a) for…
  • g$g(S,M) = \dim_{\mathbb{F}_p}(S^{\perp}_M) - \dim_{\mathbb{F}_p}(S_M)$.
Used by 1

The proof, explained

The proof bounds the total mass of left and right fibers by analyzing the number of positive roots on each side. When a side has at least two positive roots, they generate a 19-cycle of triangles covering all vertices, bounding twice the mass by 19*k in general and by 18*k if a fiber is zero. If both sides have two positive roots, the guaranteed zero fiber ensures twice the combined sum is at most 18*k + 19*k = 37*k; if either side has at most one positive root, its total mass is at most k while the other is at most 17*k, yielding 2*(17*k + k) = 36*k <= 37*k.

  1. condorcet_tensor_triangle is decidable

    Unfolding the definition into finite conjunctions and disjunctions of decidable relations and using typeclass inference.

    lines 12–13

    uses condorcet_tensor_triangle

      unfold condorcet_tensor_triangle
      infer_instance
  2. condorcet_tensor_pair_cycle forms a 19-cycle where every step forms a triangle with r or s automation

    Decided by finite exhaustive search on all pairs in Fin 19.

    line 28

    uses condorcet_tensor_pair_cycle, condorcet_tensor_triangle

      decide
  3. cyclic shifts are bijective automation

    Verified by finite exhaustion over Fin 19.

    line 31

        Function.Bijective (fun i : Fin 19 => i+j) := by decide
  4. each vertex forms two specific triangles automation

    Verified by finite exhaustion over Fin 19.

    line 35

    uses condorcet_tensor_triangle

        condorcet_tensor_triangle (3+r) (5+r) r := by decide
  5. sum over an odd cycle of length 19 is bounded by 19*k / 2

    Summing the edge inequalities along the cycle, the cyclic shift bijectivity doubles the vertex sum.

    lines 40–42

    uses sum_le_sum, univ, sum_add_distrib, condorcet_tensor_shift_bijective, two_mul

      have h := sum_le_sum (s := (univ : Finset (Fin 19))) (fun i _ => hedge i)
      rw [sum_add_distrib, (condorcet_tensor_shift_bijective 1).sum_comp l] at h
      simpa [two_mul] using h
  6. sum over an odd cycle with a zero entry is bounded by 9*k

    Partitioning the remaining 18 vertices into 9 consecutive pairs and applying the pair bounds.

    lines 47–67

    uses Fin.sum_univ_succ, Fin.sum_univ_zero, add_zero

      have h1 := hedge 1
      have h3 := hedge 3
      have h5 := hedge 5
      have h7 := hedge 7
      have h9 := hedge 9
      have h11 := hedge 11
      have h13 := hedge 13
      have h15 := hedge 15
      have h17 := hedge 17
      change l 1+l 2 ≤ k at h1
      change l 3+l 4 ≤ k at h3
      change l 5+l 6 ≤ k at h5
      change l 7+l 8 ≤ k at h7
      change l 9+l 10 ≤ k at h9
      change l 11+l 12 ≤ k at h11
      change l 13+l 14 ≤ k at h13
      change l 15+l 16 ≤ k at h15
      change l 17+l 18 ≤ k at h17
      simp only [Fin.sum_univ_succ, Fin.sum_univ_zero, add_zero]
      change 2 * (l 0+(l 1+(l 2+(l 3+(l 4+(l 5+(l 6+(l 7+(l 8+(l 9+(l 10+(l 11+(l 12+(l 13+(l 14+(l 15+(l 16+(l 17+(l 18))))))))))))))))))) ≤ 18*k
      linarith
  7. sum with two pair bounds is bounded by 17*k

    Summing the two pair bounds and the individual bounds on the remaining 15 vertices.

    lines 72–89

    uses Fin.sum_univ_succ, Fin.sum_univ_zero, add_zero

      have h0 := hle 0
      have h4 := hle 4
      have h6 := hle 6
      have h7 := hle 7
      have h8 := hle 8
      have h9 := hle 9
      have h10 := hle 10
      have h11 := hle 11
      have h12' := hle 12
      have h13 := hle 13
      have h14 := hle 14
      have h15 := hle 15
      have h16 := hle 16
      have h17 := hle 17
      have h18 := hle 18
      simp only [Fin.sum_univ_succ, Fin.sum_univ_zero, add_zero]
      change (l 0+(l 1+(l 2+(l 3+(l 4+(l 5+(l 6+(l 7+(l 8+(l 9+(l 10+(l 11+(l 12+(l 13+(l 14+(l 15+(l 16+(l 17+(l 18))))))))))))))))))) ≤ 17*k
      linarith
  8. two roots give a 19*k bound on twice the sum

    Composing l with the Hamiltonian cycle permutation and applying the odd cycle bound.

    lines 97–105

    uses condorcet_tensor_pair_cycle_check, condorcet_tensor_odd_cycle_sum_bound, Function.comp_apply

      classical
      obtain ⟨hbij,hcycle⟩ := condorcet_tensor_pair_cycle_check r s hrs
      let f := condorcet_tensor_pair_cycle r s
      have hedge : ∀ i : Fin 19, l (f i)+l (f (i+1)) ≤ k :=
        fun i => hpair _ _ (hcycle i)
      have hsum : (∑ i, l (f i)) = ∑ a, l a := hbij.sum_comp l
      refine ⟨?_,?_⟩
      · have h := condorcet_tensor_odd_cycle_sum_bound (l ∘ f) k hedge
        simpa only [Function.comp_apply, hsum] using h
  9. two roots with a zero fiber give an 18*k bound on twice the sum

    Rotating the cycle to place the zero fiber at index 0 and applying the odd cycle zero bound.

    lines 106–120

    uses condorcet_tensor_odd_cycle_zero_bound, condorcet_tensor_shift_bijective

      · intro a ha
        obtain ⟨j,hj⟩ := hbij.surjective a
        let g : Fin 19 → ℝ := fun i => l (f (i+j))
        have hg : ∀ i : Fin 19, g i+g (i+1) ≤ k := by
          intro i
          simpa only [g, add_assoc, add_comm, add_left_comm] using hedge (i+j)
        have hg0 : g 0 = 0 := by
          change f j = a at hj
          simpa only [g, zero_add, hj] using ha
        have h := condorcet_tensor_odd_cycle_zero_bound g k hg hg0
        have hgsum : (∑ i, g i) = ∑ a, l a := by
          change (∑ i, (l ∘ f) (i+j)) = ∑ a, l a
          rw [(condorcet_tensor_shift_bijective j).sum_comp (l ∘ f)]
          exact hsum
        simpa only [hgsum] using h
  10. one root gives a 17*k bound on the sum

    Translating the fiber by r and applying the two-pair bound with the two verified triangle pairs.

    lines 126–130

    uses condorcet_tensor_two_pair_sum_bound, condorcet_tensor_single_pairs_check, condorcet_tensor_shift_bijective

      let g : Fin 19 → ℝ := fun i => l (i+r)
      have h := condorcet_tensor_two_pair_sum_bound g k (fun i => hle _)
        (hpair _ _ (condorcet_tensor_single_pairs_check r).1)
        (hpair _ _ (condorcet_tensor_single_pairs_check r).2)
      simpa only [g, (condorcet_tensor_shift_bijective r).sum_comp l] using h
  11. if left has two positive roots, r is bounded

    Pick positive roots and apply the two-roots bound to r.

    lines 140–149

    uses condorcet_tensor_two_roots_mass_bound

      classical
      obtain ⟨a,ha⟩ := hlpos
      obtain ⟨b,hb⟩ := hrpos
      by_cases hltwo : ∃ a', a' ≠ a ∧ 0 < l a'
      · obtain ⟨a',haa',ha'⟩ := hltwo
        obtain ⟨hR,hRzero⟩ := condorcet_tensor_two_roots_mass_bound r k a' a haa' (by
          intro x y h
          rcases h with h | h
          · exact (htri x y a' h).2 ha'
          · exact (htri x y a h).2 ha)
  12. if both sides have two positive roots, combined mass is bounded by 37*k / 2

    Both sides satisfy the two-roots bound and at least one side has a zero fiber.

    lines 150–161

    uses condorcet_tensor_two_roots_mass_bound

        by_cases hrtwo : ∃ b', b' ≠ b ∧ 0 < r b'
        · obtain ⟨b',hbb',hb'⟩ := hrtwo
          obtain ⟨hL,hLzero⟩ := condorcet_tensor_two_roots_mass_bound l k b' b hbb' (by
            intro x y h
            rcases h with h | h
            · exact (htri x y b' h).1 hb'
            · exact (htri x y b h).1 hb)
          obtain ⟨c,hc|hc⟩ := hmissing
          · have h := hLzero c hc
            linarith
          · have h := hRzero c hc
            linarith
  13. if right has only one positive root, combined mass is bounded

    Right is supported on one vertex, and left is bounded by 17*k.

    lines 162–170

    uses le_antisymm, le_of_not_gt, sum_eq_single, condorcet_tensor_one_root_mass_bound

        · have hrzero : ∀ c, c ≠ b → r c = 0 := by
            intro c hc
            have hnot : ¬0 < r c := fun h => hrtwo ⟨c,hc,h⟩
            exact le_antisymm (le_of_not_gt hnot) (hr c).1
          have hsumR : (∑ c, r c) = r b := sum_eq_single b (fun c _ hc => hrzero c hc) (by simp)
          have hL := condorcet_tensor_one_root_mass_bound l k b (fun c => (hl c).2)
            (fun x y h => (htri x y b h).1 hb)
          rw [hsumR]
          linarith [(hr b).2]
  14. if left has only one positive root, combined mass is bounded

    Left is supported on one vertex, and right is bounded by 17*k.

    lines 171–179

    uses le_antisymm, le_of_not_gt, sum_eq_single, condorcet_tensor_one_root_mass_bound

      · have hlzero : ∀ c, c ≠ a → l c = 0 := by
          intro c hc
          have hnot : ¬0 < l c := fun h => hltwo ⟨c,hc,h⟩
          exact le_antisymm (le_of_not_gt hnot) (hl c).1
        have hsumL : (∑ c, l c) = l a := sum_eq_single a (fun c _ hc => hlzero c hc) (by simp)
        have hR := condorcet_tensor_one_root_mass_bound r k a (fun c => (hr c).2)
          (fun x y h => (htri x y a h).2 ha)
        rw [hsumL]
        linarith [(hl a).2]

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

open Finsetopen scoped BigOperatorsset_option maxHeartbeats 20000000set_option maxRecDepth 20000def condorcet_tensor_triangle (a b c : Fin 19) : Prop :=  (condorcet_private_stationary_relation a b ∧    condorcet_private_stationary_relation b c ∧ condorcet_private_stationary_relation c a) ∨  (condorcet_private_stationary_relation b a ∧    condorcet_private_stationary_relation a c ∧ condorcet_private_stationary_relation c b)instance (a b c : Fin 19) : Decidable (condorcet_tensor_triangle a b c) := by  unfold condorcet_tensor_triangle  infer_instancedef condorcet_tensor_hamilton_order : Fin 19 → Fin 19 :=  ![0,2,16,5,14,10,1,18,9,17,3,6,11,7,12,13,4,15,8]def condorcet_tensor_pair_cycle (r s i : Fin 19) : Fin 19 :=  if condorcet_private_stationary_relation r s then r+(s-r)*condorcet_tensor_hamilton_order i  else s+(r-s)*condorcet_tensor_hamilton_order itheorem condorcet_tensor_pair_cycle_check : ∀ r s : Fin 19, r ≠ s →    Function.Bijective (condorcet_tensor_pair_cycle r s) ∧    ∀ i : Fin 19,      condorcet_tensor_triangle (condorcet_tensor_pair_cycle r s i)        (condorcet_tensor_pair_cycle r s (i+1)) r ∨      condorcet_tensor_triangle (condorcet_tensor_pair_cycle r s i)        (condorcet_tensor_pair_cycle r s (i+1)) s := by  decidetheorem condorcet_tensor_shift_bijective : ∀ j : Fin 19,    Function.Bijective (fun i : Fin 19 => i+j) := by decidetheorem condorcet_tensor_single_pairs_check : ∀ r : Fin 19,    condorcet_tensor_triangle (1+r) (2+r) r ∧    condorcet_tensor_triangle (3+r) (5+r) r := by decidetheorem condorcet_tensor_odd_cycle_sum_bound (l : Fin 19 → ℝ) (k : ℝ)    (hedge : ∀ i : Fin 19, l i + l (i+1) ≤ k) :    2 * (∑ i, l i) ≤ 19*k := by  have h := sum_le_sum (s := (univ : Finset (Fin 19))) (fun i _ => hedge i)  rw [sum_add_distrib, (condorcet_tensor_shift_bijective 1).sum_comp l] at h  simpa [two_mul] using htheorem condorcet_tensor_odd_cycle_zero_bound (l : Fin 19 → ℝ) (k : ℝ)    (hedge : ∀ i : Fin 19, l i + l (i+1) ≤ k) (hz : l 0 = 0) :    2 * (∑ i, l i) ≤ 18*k := by  have h1 := hedge 1  have h3 := hedge 3  have h5 := hedge 5  have h7 := hedge 7  have h9 := hedge 9  have h11 := hedge 11  have h13 := hedge 13  have h15 := hedge 15  have h17 := hedge 17  change l 1+l 2 ≤ k at h1  change l 3+l 4 ≤ k at h3  change l 5+l 6 ≤ k at h5  change l 7+l 8 ≤ k at h7  change l 9+l 10 ≤ k at h9  change l 11+l 12 ≤ k at h11  change l 13+l 14 ≤ k at h13  change l 15+l 16 ≤ k at h15  change l 17+l 18 ≤ k at h17  simp only [Fin.sum_univ_succ, Fin.sum_univ_zero, add_zero]  change 2 * (l 0+(l 1+(l 2+(l 3+(l 4+(l 5+(l 6+(l 7+(l 8+(l 9+(l 10+(l 11+(l 12+(l 13+(l 14+(l 15+(l 16+(l 17+(l 18))))))))))))))))))) ≤ 18*k  linariththeorem condorcet_tensor_two_pair_sum_bound (l : Fin 19 → ℝ) (k : ℝ)    (hle : ∀ i, l i ≤ k) (h12 : l 1+l 2 ≤ k) (h35 : l 3+l 5 ≤ k) :    (∑ i, l i) ≤ 17*k := by  have h0 := hle 0  have h4 := hle 4  have h6 := hle 6  have h7 := hle 7  have h8 := hle 8  have h9 := hle 9  have h10 := hle 10  have h11 := hle 11  have h12' := hle 12  have h13 := hle 13  have h14 := hle 14  have h15 := hle 15  have h16 := hle 16  have h17 := hle 17  have h18 := hle 18  simp only [Fin.sum_univ_succ, Fin.sum_univ_zero, add_zero]  change (l 0+(l 1+(l 2+(l 3+(l 4+(l 5+(l 6+(l 7+(l 8+(l 9+(l 10+(l 11+(l 12+(l 13+(l 14+(l 15+(l 16+(l 17+(l 18))))))))))))))))))) ≤ 17*k  linariththeorem condorcet_tensor_two_roots_mass_bound (l : Fin 19 → ℝ) (k : ℝ)    (r s : Fin 19) (hrs : r ≠ s)    (hpair : ∀ a b, condorcet_tensor_triangle a b r ∨ condorcet_tensor_triangle a b s →      l a+l b ≤ k) :    2 * (∑ a, l a) ≤ 19*k ∧    (∀ a, l a = 0 → 2 * (∑ b, l b) ≤ 18*k) := by  classical  obtain ⟨hbij,hcycle⟩ := condorcet_tensor_pair_cycle_check r s hrs  let f := condorcet_tensor_pair_cycle r s  have hedge : ∀ i : Fin 19, l (f i)+l (f (i+1)) ≤ k :=    fun i => hpair _ _ (hcycle i)  have hsum : (∑ i, l (f i)) = ∑ a, l a := hbij.sum_comp l  refine ⟨?_,?_⟩  · have h := condorcet_tensor_odd_cycle_sum_bound (l ∘ f) k hedge    simpa only [Function.comp_apply, hsum] using h  · intro a ha    obtain ⟨j,hj⟩ := hbij.surjective a    let g : Fin 19 → ℝ := fun i => l (f (i+j))    have hg : ∀ i : Fin 19, g i+g (i+1) ≤ k := by      intro i      simpa only [g, add_assoc, add_comm, add_left_comm] using hedge (i+j)    have hg0 : g 0 = 0 := by      change f j = a at hj      simpa only [g, zero_add, hj] using ha    have h := condorcet_tensor_odd_cycle_zero_bound g k hg hg0    have hgsum : (∑ i, g i) = ∑ a, l a := by      change (∑ i, (l ∘ f) (i+j)) = ∑ a, l a      rw [(condorcet_tensor_shift_bijective j).sum_comp (l ∘ f)]      exact hsum    simpa only [hgsum] using htheorem condorcet_tensor_one_root_mass_bound (l : Fin 19 → ℝ) (k : ℝ)    (r : Fin 19) (hle : ∀ i, l i ≤ k)    (hpair : ∀ a b, condorcet_tensor_triangle a b r → l a+l b ≤ k) :    (∑ a, l a) ≤ 17*k := by  let g : Fin 19 → ℝ := fun i => l (i+r)  have h := condorcet_tensor_two_pair_sum_bound g k (fun i => hle _)    (hpair _ _ (condorcet_tensor_single_pairs_check r).1)    (hpair _ _ (condorcet_tensor_single_pairs_check r).2)  simpa only [g, (condorcet_tensor_shift_bijective r).sum_comp l] using htheorem condorcet_join_cycle_tensor_mixed_fiber_bound    (l r : Fin 19 → ℝ) (k : ℝ) (hk : 0 ≤ k)    (hl : ∀ a, 0 ≤ l a ∧ l a ≤ k) (hr : ∀ a, 0 ≤ r a ∧ r a ≤ k)    (hlpos : ∃ a, 0 < l a) (hrpos : ∃ a, 0 < r a)    (hmissing : ∃ a, l a = 0 ∨ r a = 0)    (htri : ∀ a b c, condorcet_tensor_triangle a b c →      (0 < r c → l a+l b ≤ k) ∧ (0 < l c → r a+r b ≤ k)) :    2 * ((∑ a, l a)+(∑ a, r a)) ≤ 37*k := by  classical  obtain ⟨a,ha⟩ := hlpos  obtain ⟨b,hb⟩ := hrpos  by_cases hltwo : ∃ a', a' ≠ a ∧ 0 < l a'  · obtain ⟨a',haa',ha'⟩ := hltwo    obtain ⟨hR,hRzero⟩ := condorcet_tensor_two_roots_mass_bound r k a' a haa' (by      intro x y h      rcases h with h | h      · exact (htri x y a' h).2 ha'      · exact (htri x y a h).2 ha)    by_cases hrtwo : ∃ b', b' ≠ b ∧ 0 < r b'    · obtain ⟨b',hbb',hb'⟩ := hrtwo      obtain ⟨hL,hLzero⟩ := condorcet_tensor_two_roots_mass_bound l k b' b hbb' (by        intro x y h        rcases h with h | h        · exact (htri x y b' h).1 hb'        · exact (htri x y b h).1 hb)      obtain ⟨c,hc|hc⟩ := hmissing      · have h := hLzero c hc        linarith      · have h := hRzero c hc        linarith    · have hrzero : ∀ c, c ≠ b → r c = 0 := by        intro c hc        have hnot : ¬0 < r c := fun h => hrtwo ⟨c,hc,h⟩        exact le_antisymm (le_of_not_gt hnot) (hr c).1      have hsumR : (∑ c, r c) = r b := sum_eq_single b (fun c _ hc => hrzero c hc) (by simp)      have hL := condorcet_tensor_one_root_mass_bound l k b (fun c => (hl c).2)        (fun x y h => (htri x y b h).1 hb)      rw [hsumR]      linarith [(hr b).2]  · have hlzero : ∀ c, c ≠ a → l c = 0 := by      intro c hc      have hnot : ¬0 < l c := fun h => hltwo ⟨c,hc,h⟩      exact le_antisymm (le_of_not_gt hnot) (hl c).1    have hsumL : (∑ c, l c) = l a := sum_eq_single a (fun c _ hc => hlzero c hc) (by simp)    have hR := condorcet_tensor_one_root_mass_bound r k a (fun c => (hr c).2)      (fun x y h => (htri x y a h).2 ha)    rw [hsumL]    linarith [(hl a).2]
See it in the graphDiscuss this resultChallenge it