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) (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-16a835f21d117a04· 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" } } }- Certificate
basis_map, SHA-25606112203c6494ab76efac8d454e12766959aab2ff2bc2c84161e33461c7910f8, 11,876 bytes (2,111 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-d9640fb05f96c50b(one_signed_coefficients)n-d9640fb05f96c50b(hadamard_kernel)n-d9640fb05f96c50b(real_rooted)