Boolean evaluation of the certificate-truncated positive DNF
DefinitionNarrowDNF_CertificateBoundscombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, a local activation family, a Boolean readout, and a certificate-size cutoff. For an input , let be the coordinates that are both active under and labelled one in . Retain exactly the terms arising from accepted inputs with .
The function defined by this bundle is the actual finite disjunction
It is implemented by Boolean evaluation of the already defined finite set of truncated certificate terms, with duplicate terms removed. The empty disjunction evaluates to false and an empty term evaluates to true. No monotonicity, measurability, positive-certificate property, or approximation error estimate is assumed by the definition; those hypotheses and conclusions belong to the certificate-bound theorem nodes.
Definition code
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Data.Bool.Basic
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Image
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_Certificates
namespace NarrowDNF
end NarrowDNF
namespace NarrowDNF.Activation
end NarrowDNF.Activation
namespace NarrowDNF
namespace Activation
open scoped BigOperators
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
noncomputable def truncatedDNF (J : Activation ι) (u : Cube ι → Bool)
(w : ℕ) (x : Cube ι) : Bool := by
classical exact decide (DNFHolds (J.truncatedTerms u w) x)
end Activation
end NarrowDNF
Source