Proof step e-0f2bf5edb3121755

basis_map A013610 → concludes about basis_map_A013610 of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n. JSON

Theorem

Geometric basis map (elementary) polytool ?

Operation

Image under a basis map u^k -> P_k

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

Premises

• Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n. (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" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: basis_map, SHA-256 fc9fbfdf439eb2cfe6745a1db0358da18628e3abed18beccde24a840e1ed160e, 6,877 bytes (1,395 compressed); download JSON

Cited by

• n-c4fd821a14172d5f (real_rooted)
• n-c4fd821a14172d5f (one_signed_coefficients)
• n-c4fd821a14172d5f (hadamard_kernel)