Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A007318
- Concludes
- shift_x_plus_one of basis_map_A013610 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
- Premises
- basis_map_A013610 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-3c9c28a3ed554604· 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-256db4a279ab58891086e89f4f8e555ccc31b17b34d65d4c400b37c0e6a6ed1725c, 10,261 bytes (2,294 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-fe9a040afa3cc625(one_signed_coefficients)n-fe9a040afa3cc625(hadamard_kernel)n-fe9a040afa3cc625(interlacing)n-fe9a040afa3cc625(real_rooted)