Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Constructive factorization of an admissible QSP polynomial pair

Statement

For every integer d≥0, a pair P,Q∈C[x] is QSP-admissible of degree bound d if and only if there is a real phase list Φ=(ϕ0,…,ϕd) such that UΦ(x)=(P(x)s(x)Q(x)(−1)d+1s(x)Q∗(x)(−1)dP∗(x))(x∈[−1,1]). The converse is constructive: a leading-coefficient phase peel reduces the degree at each nonconstant stage. The polynomial identity, determinant signs, product order, and phase convention are exactly those in Admissible polynomial pair for Hermitian-reflection QSP and QSP signal matrix and ordered phase sequence.

Facts & Assumptions

Given: An integer d≥0 and polynomials P,Q∈C[x].

[F1]

Admissible polynomial pair for Hermitian-reflection QSP: the degree bounds and parities are d and d−1, and PP∗+(1−x2)QQ∗=1 as a polynomial identity.

[F2]

Unitarity, determinant, and polynomial form of a QSP sequence: a length-d reflection sequence has the displayed determinant-(−1)d matrix form and its upper entries are an admissible pair.

[F3]

Hermitian-reflection and SU(2) QSP convention conversion: for d≥1, the reflection sequence is id times the explicitly phase-shifted SU(2) sequence; the map between phase lists is invertible and the scalar is retained under control.

[F4]

Every nonzero complex number has a unique polar form r(cos⁡θ+isin⁡θ) with r>0 and −π<θ≤π: every nonzero complex number has polar form r(cos⁡θ+isin⁡θ) with r>0.

[F5]
[F6]

Over an integral domain, degrees add under multiplication of nonzero polynomials: for nonzero polynomials over a domain, the degree of a product is the sum of the degrees.

[F7]

Division algorithm for polynomials over a field: division by a nonzero polynomial over a field gives a unique quotient and a remainder that is zero or has degree strictly below the divisor. In particular, division by x−α leaves the constant remainder R(α), so R(α)=0 implies x−α divides R.

[F8]

QSP signal matrix and ordered phase sequence: UΦ=Z(ϕ0)∏j=1d(WRZ(ϕj)) in the stated left-to-right, right-to-left matrix order; for d=0, UΦ=Z(ϕ0).

[F9]

For displayed 2×2 complex matrices, M†:=M‾T and “unitary” means M†M=MM†=I; P∗ and Q∗ continue to mean coefficient conjugation of polynomials.

Proof

1.1F2F8

If the pair comes from a phase list, Unitarity, determinant, and polynomial form of a QSP sequence gives exactly the stated matrix form, degree/parity bounds, and polynomial identity for the sequence defined in [F8]. This proves the forward implication.

1.2F1F4F5F8basegivenalgebra

Let d=0 and suppose the pair is admissible. Then Q=0 and P is constant with ∣P∣=1. Set ϕ0=Arg⁡(P) from the unique principal polar representation [F4]; [F5] gives P=eiϕ0. By [F8], UΦ=Z(ϕ0)=diag⁡(P,P∗), the required matrix.

1.3F1F4F5F8basealgebra

Let d=1. Parity gives P=ax and Q=b for constants a,b∈C. Evaluating the identity at x=0 and x=1 gives ∣b∣=∣a∣=1. Set α=Arg⁡(a) and β=Arg⁡(b) by [F4], so [F5] gives a=eiα and b=eiβ; then set ϕ0=(α+β)/2, ϕ1=(α−β)/2. By the order in [F8], direct multiplication of Z(ϕ0)WR(x)Z(ϕ1) gives entries ax, s(x)b, s(x)b‾, and −xa‾, exactly the four entries in the Statement for d=1.

1.4F1F2F3F9givenalgebra

Now let d≥2 and assume the converse has been constructed at every smaller nominal degree. Put PS=i−dP and QS=i−(d+1)Q. Multiplication by unit complex scalars preserves the bounds, parities and coefficient-conjugate identity in [F1]. The corresponding source-convention matrix is MS(x)=(PS(x)is(x)QS(x)is(x)QS∗(x)PS∗(x)). For real x, the diagonal entries of MS†MS are ∣PS∣2+s2∣QS∣2=1, and the off-diagonal entries cancel as isPS∗QS−isQSPS∗=0 and its conjugate. Thus MS†MS=I; together with det⁡MS=PSPS∗+(1−x2)QSQS∗=1 from [F1], this makes MS unitary by [F9]. Also WS†WS=WSWS†=I and det⁡WS=1 by direct multiplication using x2+s2=1, while every Z(ψ) is unitary with determinant 1 by [F2, F9]. Thus the peel multiplies by unitary matrices.

1.5F1F3F4F5F6F7givenalgebra

If PS is constant, then the identity at x=1 gives ∣PS∣=1. For every x∈(−1,1) it then gives (1−x2)∣QS(x)∣2=0, hence QS(x)=0 throughout that interval. If QS were nonzero of degree m, choose m+1 distinct points in (−1,1); repeated division by their linear factors using [F7] would force a divisor of degree m+1 of QS, contradicting [F6]. Thus QS=0. The parity of the nonzero constant PS forces d even. Set ψ0=Arg⁡(PS) by [F4], so [F5] gives PS=eiψ0. Direct multiplication using x2+s2=1 gives WSZ(π/2)WS=Z(π/2) and therefore WSZ(π/2)WSZ(−π/2)=I. This identity is the length-two phase product Z(0)WSZ(π/2)WSZ(−π/2). Insert it on the left of the current sequence; the adjacent Z(−π/2) and initial Z(ψ0) combine to Z(ψ0−π/2) by [F3], so the result is again a standard phase list and has two additional signal factors. Repeating this d/2 times pads the constant sequence to nominal degree d.

1.6F1F4F5F6algebra

Otherwise let ℓ=deg⁡PS≥1, with leading coefficients pℓ for PS and qm for QS. The identity forces QS≠0 and m=ℓ−1: if m≥ℓ, the highest term of −(x2)QSQS∗ has degree 2m+2>2ℓ and cannot cancel; if m<ℓ−1, the degree-2ℓ term ∣pℓ∣2x2ℓ cannot cancel. At degree 2ℓ, the coefficients therefore satisfy ∣pℓ∣2−∣qℓ−1∣2=0. Thus r:=pℓ/qℓ−1 has modulus one. Set ψd=Arg⁡(r)/2 using [F4]; then [F5] gives e2iψd=r.

2.1F1F6F9step 1.6algebra

Multiply MS on the right by Z(−ψd)WS†, where WS=(xisisx). The result has the same form with P′=e−iψdxPS+eiψd(1−x2)QS,Q′=eiψdxQS−e−iψdPS. The possible degree-(ℓ+1) coefficient of P′ and degree-ℓ coefficient of Q′ both equal zero by e2iψd=pℓ/qℓ−1. Their parities then give deg⁡P′≤ℓ−1 and deg⁡Q′≤ℓ−2, the bounds for nominal degree d−1. The right multiplier and MS are unitary with determinant 1, so their product N=(ABCD) is also unitary with determinant 1. The cofactor formula gives N−1=(D−B−CA), whereas [F9] gives N−1=N†=(A∗C∗B∗D∗). Equating entries yields D=A∗ and C=−B∗. Since A=P′ and B=isQ′, this is the required lower row [isQ′∗,P′∗]. If a=e−iψd, then P′=axPS+a‾(1−x2)QS and Q′=a‾xQS−aPS; expanding their coefficient-conjugate products cancels the two mixed terms and leaves P′P′∗+(1−x2)Q′Q′∗=(x2+1−x2)(PSPS∗+(1−x2)QSQS∗)=1. So (P′,Q′) is admissible at nominal degree d−1.

3.1F1F3step 1.2step 1.3step 1.4step 1.5step 2.1IHinductionconstruct

Put k=d−1≥1 and M′=MSZ(−ψd)WS†, the matrix in step 2.1. The pair (ikP′,ik+1Q′) is admissible at nominal degree k, since the unit scalars preserve degree, parity and the coefficient-conjugate identity. Apply the reflection-convention induction hypothesis to this pair. Its displayed matrix is ikM′ entrywise: the lower-row factors are (−1)k+1i−(k+1)=ik+1 and (−1)ki−k=ik. By [F3], convert that reflection phase list to a source-convention list with ikUS=ikM′, hence US=M′. Reversing the peel gives MS=M′WSZ(ψd), so appending ψd constructs the required finite source-convention list. Each induction call has strictly smaller nominal degree; steps 1.2, 1.3 and 1.5 supply the bases and constant padding.

4.1F3step 1.1step 1.2step 1.3step 1.4step 3.1discharge-induction: step 1.4algebra∎

For d≥2, apply the inverse affine phase map in [F3] to obtain a reflection phase list Φ. Since UR(Φ)=idUS(Ψ), its upper-left entry is idPS=P, its upper-right entry is id+1sQS=sQ, and its lower entries are (−1)d+1sQ∗ and (−1)dP∗. Thus it is the required reflection sequence and the converse follows. Together with the forward implication and both base cases this proves the equivalence for all d≥0.

Depends on

Used by

Dependency tree · two levels

43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources