finset_sum_collision_preserving
def
A rational-valued function x on A is collision-preserving if it satisfies every additive collision: x a + x b = x c + x d whenever a + b = c + d with a, b, c, d ∈ A.
Statement
def finset_sum_collision_preserving {G : Type*} [AddCommMonoid G] (A : Finset G) (x : G → ℚ) : Prop
- Source
- step towards nus_min_card_ge_c_log_sq
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 3
- finset_sum_collision_preserving_const_of_minimalIf A is NUS, no proper subset of A is NUS (A is inclusion-minimal), and x is a rational collision-preserving weight on A, then x is…
- nus_int_collision_preserving_const_of_minimalIf A is NUS, no proper subset of A is NUS, and x : G → ℤ is constant across additive collisions on A, then x is constant on A.
- finset_has_no_unique_sums_max_layerLet A be NUS and let x be a rational collision-preserving weight on A. Then the set of elements of A maximizing x (i.e. {a ∈ A : x a = M}…
Lean source view module on GitHub
/-- Rational collision-preserving weight on A: additive relations in A force the same relations among the weights. -/ def finset_sum_collision_preserving {G : Type*} [AddCommMonoid G] (A : Finset G) (x : G → ℚ) : Prop := ∀ a ∈ A, ∀ b ∈ A, ∀ c ∈ A, ∀ d ∈ A, a + b = c + d → x a + x b = x c + x d