Indexed mutation-closure certificate for prepared pair 4

Proved

D1Bound5.PairLightClosurePrepared4.chunk01_checked

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

diophantine-tuplesnumber-theory

For prepared pair 4, 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_SmallPairPureClosureData4Destinations_Definitions
import Definitions.Def_D1Bound5_SmallPairPureClosureData4Vertices_Definitions
import Definitions.Def_D1Bound5_SmallPairPureClosureData4_Definitions

Formal statement

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


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

end D1Bound5.PairLightClosurePrepared4
end

Source

D1Bound5/SmallPairPureClosure4Chunk01.lean, lines 8-12, SHA-256 3b37fe235cb1d1a78aa730923c1c0a777dc30fc3937f172a8c8419e3067d6fb3. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph