Fixed-core hyperplane completion: total size at most 512
ProvedHardyCapset20261020.hyperplane_completion_boundFor the exact 512-point baseline S, any affine hyperplane H in the eight-dimensional space over the field with three elements, and any cap A containing S outside H, the cardinality of A is at most 512. Added points may lie anywhere in the entire space, including outside H. The nonzero normal hypothesis makes H a genuine hyperplane. This is a conditional fixed-core theorem, not an upper bound for arbitrary caps.
Formalization status: the complete theorem is Proved on Prove2me. The verified reduction uses 246 representative completion bounds, nine signed-permutation generators, and exhaustive orbit coverage. All current dependencies are closed. The finite checks use exact Lean arithmetic and kernel-checked evaluation; they do not rely on numerical solver tolerances.
Scope: S is the specified fixed 512-point set, and A must contain every point of S outside H. Added points can be anywhere in the full ambient space. The theorem does not assert that every cap in the ambient space has at most 512 points.
import Definitions.Def_HardyCapsetModel20261020 set_option autoImplicit false
namespace HardyCapset20261020
theorem hyperplane_completion_bound (n : Point) (hn : n ≠ 0)
(t : ZMod 3) (A : Finset Point) (hA : IsCap A)
(hcore : core n t ⊆ A) : A.card ≤ 512 := by sorry
end HardyCapset20261020