Proof step
Liu–Wang theorem for three-term recurrences
Theorem check of the sequence's own rule liu wang three term
- Concludes
- Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in …
- Premises
- none: a direct theorem check
- Theorem
- [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ?
- Lean
- RealRooted
route
signRealRooted.threeTerm_interlaces_of_nonnegCoeffs,RealRooted.threeTerm_interlaces,RealRooted.threeTerm_hasNonnegCoeffs - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-4245d0a31fdf9485· JSON- Operation
- Theorem check of the sequence's own rule
{ "operation": "theorem_check", "theorem": "liu_wang_three_term" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "previous_interlaces_next" }- Certificate
theorem_check, SHA-256947657383cb86cf9853ebba892829c78b2832ade2fa88ea5e50e532bc21b3629, 4,005 bytes (1,397 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-b0fc620949fb5990(real_rooted)n-b0fc620949fb5990(one_signed_coefficients)n-b0fc620949fb5990(hadamard_kernel)n-b0fc620949fb5990(interlacing)
References
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003