Proof step e-2bc76bcaa23d62fb

preserver_image affine, shift 2 → concludes about Triangle read by rows: T(n, m) = S1(n, m)*9^(n-m), where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). 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": 2,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"affine\",\"slope\":\"-2/9\",\"intercept\":\"1\"}"
}

Premises

• Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x. (sequence)
  uses: Every row P_n, n >= 2, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "9/2" } } }
• { "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 c22739690aa87f473ad4c26534e72dabd3cf39094f8bb3a1f26a654dadc54647, 10,464 bytes (2,955 compressed); download JSON

Cited by

• n-59f3eb88935e03d3 (one_signed_coefficients)
• n-59f3eb88935e03d3 (interlacing)
• n-59f3eb88935e03d3 (real_rooted)