Proof step e-51281bad32c8f5cd

preserver_image affine, shift 0 → concludes about basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). 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\",\"intercept\":\"-1\"}"
}

Premises

• Triangle read by rows: T(n,k) = binomial(k,n-k). (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-4, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": false, "value": "-3" }, "upper": { "closed": true, "value": "1" } } }
• { "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: preserver_image, SHA-256 22655a469341f2e8874ffb79d69a896ca01ec1cd8fcce4b96cf6b350cdb87856, 19,446 bytes (3,787 compressed); download JSON

Cited by

• n-27bb5540b6efd4ae (real_rooted)
• n-27bb5540b6efd4ae (interlacing)