ProximityPrize.SubmissionUpper.HalfRadiusCollision.exists_dot_surjective_of_card_sq_lt
ProvedProximityPrize.SubmissionUpper.HalfRadiusCollision.exists_dot_surjective_of_card_sq_ltproximity-prize
Existence of a surjective dot-product map under a finite-field cardinality bound.
Original Proximity Prize source by GitHub contributor gpsanant; preserved in upper submission bd59768c-5fe4-466a-a8f2-e94a39ae4d4a (224323f053d0d1dfa78d7b9625194fe0133f04bc). Ported from Lean 4.32.2 to 4.33.1 with independently checked statements, full source and target kernel replay, quotient checks and transitive axiom checks. This provider publication is not a new competition submission.
Preamble
import Mathlib
import Init
import Definitions.Def_ProximityPrize_SubmissionUpper_HalfRadiusCollision_dot
namespace ProximityPrize.SubmissionUpper.HalfRadiusCollision
open scoped BigOperators
variable {F : Type} [Field F] [Fintype F] [DecidableEq F]
Formal statement
theorem exists_dot_surjective_of_card_sq_lt {k : ℕ} (A : Finset (Fin k → F))
(hlarge : (Fintype.card F - 1) ^ 2 < A.card) :
∃ v : Fin k → F, A.image (fun x => dot x v) = Finset.univ := by sorry
end HalfRadiusCollision
end SubmissionUpper
end ProximityPrize
Source