Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013609
- Concludes
- basis_map_A013609 of Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, k-1).
- Premises
- Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, k-1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n, k) = binomial(n, k) if n < 3, otherwise T(n, k) = binomial(n, k) + 2*binomial(n-2, k-1).
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-f8901aba387a9aca· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013609", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 4, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-256a97ef55af52ec352700c3fc4a600562625330ba3bfb79fdbe987ea53b649583e, 10,827 bytes (2,375 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e38d87bbd8360c23(real_rooted)n-e38d87bbd8360c23(one_signed_coefficients)n-e38d87bbd8360c23(hadamard_kernel)n-e38d87bbd8360c23(interlacing)