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) (0<=k<=2n) is the number of Delannoy paths of length n, having k steps.
- Premises
- Triangle read by rows: T(n, k) (0<=k<=2n) is the number of Delannoy paths of length n, having k steps.
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) (0<=k<=2n) is the number of Delannoy paths of length n, having k steps.
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-94bde939ea1457ab· 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" } } }- Certificate
basis_map, SHA-256e7f14b236c18fcb99aa3e8dcfb33f89d48dc383fefa251b6305153326d8b054c, 11,882 bytes (2,122 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-dbf83e3ea48cbbcf(real_rooted)n-dbf83e3ea48cbbcf(one_signed_coefficients)n-dbf83e3ea48cbbcf(hadamard_kernel)