Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A007318
- Concludes
- Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).
- Premises
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-07c97fbc7caecdc2· 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-2564548aecbaadf1c4b45aaccfcd57093be46d7cc070eefdd46c27bf875fa6c82ec, 14,119 bytes (2,644 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-57b4b14604f4c0d7(one_signed_coefficients)n-57b4b14604f4c0d7(hadamard_kernel)n-57b4b14604f4c0d7(real_rooted)n-57b4b14604f4c0d7(interlacing)