Documentation

Complexitylib.Metacomplexity.MCSP.Magnification.AntiChecker.Counter.Relation

Anti-checker counter relation #

This module exposes the exact finite relation estimated by the conditional approximate counter circuits in the Anti-Checker Lemma construction.

Valid fixed-width descriptions surviving a labeled sample vector have exactly the existing canonical survivor count.

theorem Complexity.GapMCSP.Magnification.AntiCheckerLemma.codeMatchesTargetSamples_iff {count arity : } (target : BitString arityBool) (inputs : Fin countBitString arity) (code : List Bool) :
CodeMatchesLabeledSamples (fun (sample : Fin count) => SuccinctMCSP.Sample.ofFunction target (inputs sample)) code AntiChecker.ConsistentCode target (List.ofFn inputs) code

Explicit target labels recover the existing target-relative consistency predicate on the corresponding input list.

theorem Complexity.GapMCSP.Magnification.AntiCheckerLemma.candidateLabeledSurvivorCount_targetSamples {count arity threshold : } (target : BitString arityBool) (inputs : Fin countBitString arity) :
(candidateLabeledSurvivorCount arity threshold fun (sample : Fin count) => SuccinctMCSP.Sample.ofFunction target (inputs sample)) = AntiChecker.candidateSurvivorCount target threshold (List.ofFn inputs)

Counting target-labeled vectors agrees exactly with the canonical survivor count on the corresponding input list.

The fixed-width sample codec preserves the survivor count exactly.

@[simp]

Decoding a packed target-labeled vector recovers the existing canonical survivor count on its input list.