Proof step e-f033b6e7de8ef377

basis_map A013609 → concludes about basis_map_A013609 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions. JSON

Theorem

Geometric basis map (elementary) polytool ?

Operation

Image under a basis map u^k -> P_k

{
  "map": "A013609",
  "operation": "basis_map"
}

Premises

• Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions. (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }
• { "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: basis_map, SHA-256 0ab91a86f8e111947c7219426bfabe6ac2758a507280b5e1d542eb58db128a7a, 13,652 bytes (2,551 compressed); download JSON

Cited by

• n-8217f7f3de935aeb (real_rooted)
• n-8217f7f3de935aeb (one_signed_coefficients)
• n-8217f7f3de935aeb (hadamard_kernel)
• n-8217f7f3de935aeb (interlacing)