Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A007318
- Concludes
- shift_x_plus_one of veronese_section_2_0 of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
- Premises
- veronese_section_2_0 of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_0 of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-585d39e7ec6d37f9· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A007318", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-2563b617b34f73e76432d76f8a9391564b40293c684a56ea0d7d5fea18bdc497bb9, 14,583 bytes (2,814 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f714ad53b60ca2b8(one_signed_coefficients)n-f714ad53b60ca2b8(hadamard_kernel)n-f714ad53b60ca2b8(real_rooted)n-f714ad53b60ca2b8(interlacing)