Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013610
- Concludes
- basis_map_A013610 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-29e09f921a50b8b9· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013610", "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-2561e6ca72ad4222927a68bc83b60ee15b1997e24740db2b124b138e9449043e27f, 15,709 bytes (3,100 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-9796bf969c11399f(real_rooted)n-9796bf969c11399f(one_signed_coefficients)n-9796bf969c11399f(hadamard_kernel)n-9796bf969c11399f(interlacing)