The same-color pair count is determined by the squared color-class sizes
ProvedLX.same_color_pair_countcayley-graphscombinatoricsglushkov-lxgroup-theory
Let be a natural number and let be any two-coloring. Write for the sizes of its two color classes and let count pairs with . Then
The diagonal contributes exactly , including when one color class is empty; each distinct same-color pair contributes twice to the squared class counts. This identity converts pair counting into a quadratic expression in class sizes, enabling lower bounds by balancing the two classes.
Preamble
/-
Adapted from https://github.com/snow-ghost/glushkov-lx-lean at 8cddcd222b591673dc63475d9d45b9ed5c6eb92c.
MIT License
Copyright (c) 2026 S. Uskov
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
-/
import Mathlib
import Definitions.Def_LX_TwoColorPairs
namespace LX
end LX
namespace LX
end LX
open LX
open scoped BigOperators
variable {n : ℕ}
Formal statement
theorem LX.same_color_pair_count (χ : Fin n → Bool) :
2*sameColorPairs χ+n=(colorCount χ true)^2+(colorCount χ false)^2 := by sorrySource