Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013611
- Concludes
- basis_map_A013611 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-a03f46702edbd12c· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013611", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
basis_map, SHA-2560331643f6fae8dc2876ab979588bff6eb804feb35c0df109c349ee562500a11a, 11,890 bytes (2,121 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-da7295b3362987cc(real_rooted)n-da7295b3362987cc(one_signed_coefficients)n-da7295b3362987cc(hadamard_kernel)