Quantum and CircuitsReading edition

Complete safe-packet degree

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

Complete safe-packet degree

CLAIM C02

15.1 Pointwise coverage rather than one easy packet

Let

\[ I_f=\{h\in\mathcal R_n:h(1+f)=0\}. \]

This is the ideal of functions supported only on the accepting set of \(f\). For nonzero \(f\), the one-packet parameter is

\[ \alpha_1(f)=\min\{\deg h:0\ne h\in I_f\}. \]

It asks for one safe nonzero polynomial, which may detect only an easy portion of the accepting set. One-sided polynomial immunity is established terminology in this setting; see the background reference [54].

For a positive input \(v\), define instead

\[ \beta_v(f)=\min\{\deg h:h\in I_f,\ h(v)=1\},\qquad \beta(f)=\max_{v:f(v)=1}\beta_v(f). \]

Set \(\beta(0)=0\). Thus \(\beta(f)\) is the degree needed before safe polynomials collectively detect every positive input. Finally, put

\[ \beta^*(f)=\max_{\ell\in{\operatorname{Aff}}_n}\beta(f+\ell), \]

where \({\operatorname{Aff}}_n\) is the set of affine Boolean functions on the logical inputs.

Proposition 15.1: Basic size bounds

For nonzero \(f\) on \(n\) inputs,

\[ \alpha_1(f)\le\beta(f)\le n. \]

If \(f\) has at least two positive inputs, then \(\beta(f)\le n-1\). In particular \(\beta^*(f)\le n\).

Proof

Any polynomial detecting a specified positive input is nonzero, giving the first inequality. For \(v\in{\{0,1\}}^n\), its point indicator is

\[ \delta_v(x)=\prod_{i:v_i=1}x_i\prod_{i:v_i=0}(1+x_i). \]

If \(f(v)=1\), then \(\delta_v\in I_f\) and has degree \(n\), proving the upper bound.

If \(v\) and \(w\) are distinct positive inputs, \(\delta_v+\delta_w\) is safe and equals one at \(v\). The degree-\(n\) coefficients of its two summands are both one, so they cancel. Its degree is at most \(n-1\). Do this for each positive \(v\). The last assertion applies the general bound to every affine adjustment, with the stated zero convention.

Proposition 15.2: Affine input invariance

Invertible affine changes of logical input coordinates preserve \(\alpha_1\), \(\beta\), and \(\beta^*\), with the pointwise parameters transported by the corresponding bijection of inputs.

Proof

Composition with an affine map cannot increase multilinear degree. Composition with its affine inverse proves equality of degrees. Such composition bijects the accepting and rejecting inputs, hence maps safe polynomials bijectively to safe polynomials and preserves their pointwise detecting property. It also permutes the affine output masks used in the definition of \(\beta^*\).

Source and conversion record

Source SHA-256: d4ac05f793c2c04fc6b50c38e0f7e9a44269c2dc948f255a60b5edeecb2f7e4e

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index