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) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences…
- Premises
- Triangle read by rows: T(n,k) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences …
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) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences …
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-e673d3504e8c361f· 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": 1, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-256eb7cbefefdc02cbe3ad89e0885b1ddbf0da3177a8807afcc25733b93a5162c71, 14,522 bytes (2,903 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4136850a6fb31f1d(real_rooted)n-4136850a6fb31f1d(one_signed_coefficients)n-4136850a6fb31f1d(hadamard_kernel)n-4136850a6fb31f1d(interlacing)