Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A007318
- Concludes
- shift_x_plus_one of Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.
- Premises
- Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-1552ddb865ca9874· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A007318", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-2568d7880203b8a6302b67cb7ba645d56e28a7e41a86cd866bcaee3cc98d4753dab, 15,709 bytes (3,094 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-bc392a6ff7c9acaf(hadamard_kernel)n-bc392a6ff7c9acaf(real_rooted)n-bc392a6ff7c9acaf(interlacing)n-bc392a6ff7c9acaf(one_signed_coefficients)