Documentation

Complexity.Computability.QueryComplexity.SensitivitySeparation.Internal.FixedCoordinates

Superquadratic sensitivity separation: fixed coordinates #

This file counts the functions α → β between finite types that agree with a given function v on a prescribed finset s of coordinates, via an explicit equivalence with the functions on the complement of s. The resulting exact count is used to compute the sizes of labeling events in which some labels are prescribed.

Main definitions #

Main results #

References #

def Cslib.QueryComplexity.SensitivitySeparation.Internal.fixedCoordinatesEquiv {α β : Type} [DecidableEq α] (s : Finset α) (v : α → β) :
{ f : α → β // ∀ i ∈ s, f i = v i } ≃ ({ i : α // i ∉ s } → β)

Functions with prescribed coordinates are equivalent to functions on the remaining coordinates.

Instances For
    theorem Cslib.QueryComplexity.SensitivitySeparation.Internal.card_fixedCoordinates {α β : Type} [Fintype α] [Fintype β] [DecidableEq α] (s : Finset α) (v : α → β) [DecidablePred fun (f : α → β) => ∀ i ∈ s, f i = v i] :
    {f : α → β | ∀ i ∈ s, f i = v i}.card = Fintype.card β ^ (Fintype.card α - s.card)

    The number of functions α → β agreeing with v on s is Fintype.card β ^ (Fintype.card α - s.card).