Proof step e-40a62e5a79cc0439

preserver_image affine, shift 0 → concludes about Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0011 (n,k>=0). JSON

Theorem

Affine, reversal and Möbius substitutions (elementary) polytool ?

Lean (RealRooted): Polynomial.Splits.comp_of_degree_le_one

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"affine\",\"slope\":\"1/48\",\"intercept\":\"-1/48\"}"
}

Premises

• Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0. (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": "1" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 041175fe2dd64904370c44594eefa8d7e9b7f741548af90088514983b4951a45, 7,452 bytes (2,255 compressed); download JSON

Cited by

• n-7bfbd1a79b2d2b76 (real_rooted)