join_complete_turan_weight
The edge weighting function assigning rational weights (ℚ) to unordered pairs e : Sym2 (Fin a ⊕ Fin (n - a)): weight 2 / (r * (r - 1) : ℚ) if both endpoints lie in Fin a (via Sum.inl), weight 1 / ((r - 1) : ℚ) if one endpoint lies in Fin a and the other in Fin (n - a) (via Sum.inr), and weight 0 if both endpoints lie in Fin (n - a).
Statement
def join_complete_turan_weight (n r a : ℕ) (e : Sym2 (Fin a ⊕ Fin (n - a))) : ℚ- Defined in
- arXiv:2610.41371 Eq. (5)
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Used by 1
- join_complete_turan_fractional_cover_and_total_weightLet n, r, a be integers with r ≥ 3 and a ≤ n. The edge weighting w_a is a fractional K_r-cover of G_a = K_a ∨ T_{r-1}(n-a), and the total…
Read back from the Lean
Definition of a function join_complete_turan_weight which takes natural numbers n, r, and a, and an unordered pair e : Sym2 (Fin a ⊕ Fin (n - a)), and returns a rational number.
For an unordered pair e = s(u, v) with u, v : Fin a ⊕ Fin (n - a), the value is:
- 2 / (r * (r - 1) : ℚ) if both u and v belong to Fin a (i.e., both are Sum.inl _);
- 1 / ((r - 1) : ℚ) if one of u, v belongs to Fin a (Sum.inl _) and the other belongs to Fin (n - a) (Sum.inr _);
- 0 if both u and v belong to Fin (n - a) (i.e., both are Sum.inr _).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The edge weighting w_a on the join graph G_a = K_a ∨ T_{r-1}(n-a). -/ def join_complete_turan_weight (n r a : ℕ) (e : Sym2 (Fin a ⊕ Fin (n - a))) : ℚ := Sym2.lift ⟨fun u v => match u, v with | Sum.inl _, Sum.inl _ => 2 / (r * (r - 1) : ℚ) | Sum.inl _, Sum.inr _ => 1 / ((r - 1) : ℚ) | Sum.inr _, Sum.inl _ => 1 / ((r - 1) : ℚ) | Sum.inr _, Sum.inr _ => 0, by intro u v cases u <;> cases v <;> rfl ⟩ e