Documentation

Complexity.Computability.Circuit.Fusion.Consistency

Exact consistency and the approximation interpretation of Fusion #

The witnesses used for general set constructions require only acceptance of inputs true at the reference point. Oliveira's nonmonotone Fusion model instead requires exact agreement on both positive and negative literals [Oliveira2018Approximation, Definition 6]. These conditions are different even when both polarities are supplied.

The observation of a set at a witness changes membership only at the distinguished point. Under exact consistency it preserves supplied inputs. Unions have no positive error and intersections have no negative error; the positive intersection error is precisely failure to preserve the restricted pair. This is the local model bridge in Oliveira's Theorem 3. It does not prove the random-pair lemma or the fixed-distribution counting barrier.

Main definitions #

Main results #

References #

def Cslib.Circuits.Fusion.Semifilter.IsConsistentWith {U : Type u_1} {ι : Type u_2} (F : Semifilter U) (coordinates : U → ι → Bool) (point : ι → Bool) :

Exact agreement on positive and negative coordinate literals. The carrier U can be the negative inputs, while point is a positive input outside this carrier.

Instances For
    theorem Cslib.Circuits.Fusion.Semifilter.IsConsistentWith.unique {U : Type u_1} {ι : Type u_2} {F : Semifilter U} {coordinates : U → ι → Bool} {point₁ point₂ : ι → Bool} (h₁ : F.IsConsistentWith coordinates point₁) (h₂ : F.IsConsistentWith coordinates point₂) :
    point₁ = point₂

    A semifilter consistent with two bit vectors determines the same vector.

    def Cslib.Circuits.Fusion.SemifilterWitness.IsExact {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) :

    Exact consistency strengthens the one-sided above field of a semifilter witness.

    Instances For
      theorem Cslib.Circuits.Fusion.SemifilterWitness.isExact_iff {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) :
      w.IsExact ↔ ∀ (i : Fin n), ↑w.point ∉ input i → ¬w.filter (Subtype.val ⁻¹' input i)

      Since acceptance of true inputs is already required, exactness is equivalent to rejection of every false input.

      theorem Cslib.Circuits.Fusion.SemifilterWitness.isExact_of_isConsistentWith {n : ℕ} {ι : Type u_3} {target : Set (ι → Bool)} (indices : Fin n → ι) (polarities : Fin n → Bool) {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target (fun (j : Fin n) => {x : ι → Bool | x (indices j) = polarities j}) admissible) (h : w.filter.IsConsistentWith Subtype.val ↑w.point) :

      Exact coordinate consistency gives exactness for every supplied family of literals. The family can contain both polarities, repetitions, or only selected literals.

      def Cslib.Circuits.Fusion.SemifilterWitness.observe {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) (s : Set U) :
      Set U

      Observation in a single witness fiber of the extended approximation model. Away from its distinguished point, membership is unchanged.

      Instances For
        @[simp]
        theorem Cslib.Circuits.Fusion.SemifilterWitness.mem_observe_point {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) (s : Set U) :
        theorem Cslib.Circuits.Fusion.SemifilterWitness.observe_input {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) (h : w.IsExact) (i : Fin n) :
        w.observe (input i) = input i

        Exact consistency makes every supplied input unchanged by observation.

        theorem Cslib.Circuits.Fusion.SemifilterWitness.observe_inter_subset {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) (s t : Set U) :
        w.observe (s ∩ t) ⊆ w.observe s ∩ w.observe t

        Observation accepts no more points of an intersection than the intersection of observations. Thus the approximation model has no negative intersection error.

        theorem Cslib.Circuits.Fusion.SemifilterWitness.union_subset_observe {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) (s t : Set U) :
        w.observe s ∪ w.observe t ⊆ w.observe (s ∪ t)

        Unions have no positive error in the observation model.

        theorem Cslib.Circuits.Fusion.SemifilterWitness.inter_error {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) (s t : Set U) (x : U) :

        Positive intersection errors occur exactly at the distinguished point and exactly when the restricted pair covers the witness semifilter.

        theorem Cslib.Circuits.Fusion.SemifilterWitness.not_mem_observe_target {U : Type u_1} {n : ℕ} {target : Set U} {input : Fin n → Set U} {admissible : Semifilter ↑targetᶜ → Prop} (w : SemifilterWitness target input admissible) :
        ↑w.point ∉ w.observe target

        The target's distinguished positive point is always an observation error.