Indexed mutation-closure certificate for prepared pair 10

Proved

D1Bound5.PairLightClosurePrepared10.chunk00_checked

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

For prepared pair 10, the indexed closure certificate succeeds for at most 64 supplied witness rows. For each row, the two supplied square roots are checked and both signed mutations are verified either by an exact lookup in the complete original vertex list or by a norm strictly exceeding (10^1100). Both signs retain the full original global destination vertex list.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightClosure_Definitions
import Definitions.Def_D1Bound5_SmallPairPureClosureData10Destinations_Definitions
import Definitions.Def_D1Bound5_SmallPairPureClosureData10Vertices_Definitions
import Definitions.Def_D1Bound5_SmallPairPureClosureData10_Definitions

Formal statement

section
namespace D1Bound5.PairLightClosurePrepared10
set_option autoImplicit false
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightClosurePrepared10.chunk00_checked :
    pairLightIndexedWitnessesPrefixBool 0 1 a b anchorRoot (10^1100) vertices 64
      (witnesses.drop 0) (destinations.drop 0) = true := by sorry

end D1Bound5.PairLightClosurePrepared10
end

Source

D1Bound5/SmallPairPureClosure10Chunk00.lean, lines 8-12, SHA-256 5b2d42e49c380ae4a0af54090be5853ab760873bfe089892a2cba94d7c1f7d40. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph