Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

HardyCapsetEvaluationData016coverRows02V420261021

Definition
HardyCapsetEvaluationData016coverRows02V420261021

by Somehow · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

cap-setfinite-geometry

Exact literal projections of the original certificate fields, for kernel-checked evaluation. Each use is linked to the original certificate by reflexivity; no new mathematical hypothesis is introduced.

Definition code
import Definitions.Def_HardyCapsetBooleanVerifier20261020
set_option maxRecDepth 200000
set_option maxHeartbeats 0
namespace HardyCapset20261020.Cert
def ec016_256 : Array Nat := #[223]
def ec016_257 : Array Nat := #[296]
def ec016_258 : Array Nat := #[93, 114, 116]
def ec016_259 : Array Nat := #[141]
def ec016_260 : Array Nat := #[68, 85, 242]
def ec016_261 : Array Nat := #[157, 234]
def ec016_262 : Array Nat := #[105, 208]
def ec016_263 : Array Nat := #[16, 112]
def ec016_264 : Array Nat := #[297]
def ec016_265 : Array Nat := #[102]
def ec016_266 : Array Nat := #[298]
def ec016_267 : Array Nat := #[299]
def ec016_268 : Array Nat := #[8, 252]
def ec016_269 : Array Nat := #[135, 300]
def ec016_270 : Array Nat := #[32, 61]
def ec016_271 : Array Nat := #[150, 239, 241]
def ec016_272 : Array Nat := #[124, 204, 206]
def ec016_273 : Array Nat := #[107, 131, 212]
def ec016_274 : Array Nat := #[301]
def ec016_275 : Array Nat := #[23, 129, 202]
def ec016_276 : Array Nat := #[215, 302]
def ec016_277 : Array Nat := #[303]
def ec016_278 : Array Nat := #[79, 132]
def ec016_279 : Array Nat := #[217, 304]
def ec016_280 : Array Nat := #[158]
def ec016_281 : Array Nat := #[146, 240, 305]
def ec016_282 : Array Nat := #[52]
def ec016_283 : Array Nat := #[35, 185]
def ec016_284 : Array Nat := #[245]
def ec016_285 : Array Nat := #[152, 176]
def ec016_286 : Array Nat := #[306]
def ec016_287 : Array Nat := #[156, 244]
def ec016_288 : Array Nat := #[191, 202]
def ec016_289 : Array Nat := #[137, 155]
def ec016_290 : Array Nat := #[2, 49]
def ec016_291 : Array Nat := #[203, 246]
def ec016_292 : Array Nat := #[245]
def ec016_293 : Array Nat := #[307]
def ec016_294 : Array Nat := #[94, 231]
def ec016_295 : Array Nat := #[308]
def ec016_296 : Array Nat := #[252, 253]
def ec016_297 : Array Nat := #[51, 120, 121]
def ec016_298 : Array Nat := #[95, 123]
def ec016_299 : Array Nat := #[96, 192]
def ec016_300 : Array Nat := #[50, 227]
def ec016_301 : Array Nat := #[219, 309]
def ec016_302 : Array Nat := #[77]
def ec016_303 : Array Nat := #[93, 179]
def ec016_304 : Array Nat := #[145, 243]
def ec016_305 : Array Nat := #[310]
def ec016_306 : Array Nat := #[36, 57, 175]
def ec016_307 : Array Nat := #[159, 225]
def ec016_308 : Array Nat := #[37, 250]
def ec016_309 : Array Nat := #[186, 190]
def ec016_310 : Array Nat := #[311]
def ec016_311 : Array Nat := #[76, 246, 247, 248]
def ec016_312 : Array Nat := #[193, 251]
def ec016_313 : Array Nat := #[117, 140]
def ec016_314 : Array Nat := #[97, 136, 153]
def ec016_315 : Array Nat := #[125, 128, 160, 248]
def ec016_316 : Array Nat := #[312]
def ec016_317 : Array Nat := #[97, 249]
def ec016_318 : Array Nat := #[313]
def ec016_319 : Array Nat := #[194, 314]
def ec016_320 : Array Nat := #[53, 98, 195, 196]
def ec016_321 : Array Nat := #[201, 254]
def ec016_322 : Array Nat := #[96, 110, 197]
def ec016_323 : Array Nat := #[315]
def ec016_324 : Array Nat := #[201, 254]
def ec016_325 : Array Nat := #[222, 316]
def ec016_326 : Array Nat := #[9, 135]
def ec016_327 : Array Nat := #[92]
def ec016_328 : Array Nat := #[81]
def ec016_329 : Array Nat := #[70, 144, 236]
def ec016_330 : Array Nat := #[220, 221]
def ec016_331 : Array Nat := #[18, 101, 111]
def ec016_332 : Array Nat := #[317]
def ec016_333 : Array Nat := #[42]
def ec016_334 : Array Nat := #[318]
def ec016_335 : Array Nat := #[319]
def ec016_336 : Array Nat := #[127, 174]
def ec016_337 : Array Nat := #[320]
def ec016_338 : Array Nat := #[233]
def ec016_339 : Array Nat := #[55, 80, 235]
def ec016_340 : Array Nat := #[56]
def ec016_341 : Array Nat := #[4, 88, 173, 209]
def ec016_342 : Array Nat := #[224, 247, 251]
def ec016_343 : Array Nat := #[172, 188, 189]
def ec016_344 : Array Nat := #[226, 321]
def ec016_345 : Array Nat := #[171, 200, 249]
def ec016_346 : Array Nat := #[200, 250]
def ec016_347 : Array Nat := #[20, 249]
def ec016_348 : Array Nat := #[154]
def ec016_349 : Array Nat := #[106]
def ec016_350 : Array Nat := #[98, 220]
def ec016_351 : Array Nat := #[211, 246, 247, 248]
def ec016_352 : Array Nat := #[137, 322]
def ec016_353 : Array Nat := #[323]
def ec016_354 : Array Nat := #[5, 100]
def ec016_355 : Array Nat := #[167]
def ec016_356 : Array Nat := #[103, 192]
def ec016_357 : Array Nat := #[324]
def ec016_358 : Array Nat := #[91, 195]
def ec016_359 : Array Nat := #[228, 325]
def ec016_360 : Array Nat := #[141]
def ec016_361 : Array Nat := #[210, 224, 254]
def ec016_362 : Array Nat := #[149, 238]
def ec016_363 : Array Nat := #[148, 326]
def ec016_364 : Array Nat := #[38, 232]
def ec016_365 : Array Nat := #[178, 181]
def ec016_366 : Array Nat := #[244, 253]
def ec016_367 : Array Nat := #[74, 151, 183]
def ec016_368 : Array Nat := #[327]
def ec016_369 : Array Nat := #[245]
def ec016_370 : Array Nat := #[328]
def ec016_371 : Array Nat := #[25, 115, 133]
def ec016_372 : Array Nat := #[19, 26, 205]
def ec016_373 : Array Nat := #[138]
def ec016_374 : Array Nat := #[329]
def ec016_375 : Array Nat := #[95, 221, 330]
def ec016_376 : Array Nat := #[140, 230, 244]
def ec016_377 : Array Nat := #[229, 331]
def ec016_378 : Array Nat := #[10, 113, 130]
def ec016_379 : Array Nat := #[11, 94]
def ec016_380 : Array Nat := #[142]
def ec016_381 : Array Nat := #[332]
def ec016_382 : Array Nat := #[333]
def ec016_383 : Array Nat := #[196, 232, 334]
end HardyCapset20261020.Cert
Source
Private source: 八维 cap 的超平面补点定理, 2026-10-13, sections 2–5. The exact baseline is the previously uploaded HardyCapsetModel20261020. This is a conditional fixed-core theorem for that baseline.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me