Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013611
- Concludes
- basis_map_A013611 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-7cd69fbfccf31b75· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013611", "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-2565fe591a2bcc05447bb709c98586561a63523b110ec004f82cb88802afa93ee96, 10,837 bytes (2,377 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-59281eca5ea2cc86(real_rooted)n-59281eca5ea2cc86(one_signed_coefficients)n-59281eca5ea2cc86(hadamard_kernel)n-59281eca5ea2cc86(interlacing)