Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes
shift_x_plus_one of Triangle T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j*T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m = 2, and j = 2, read…
Premises
Theorem
polytool ?
Lean
RealRooted Polynomial.Splits.comp_of_degree_le_one
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-fb2734f8dbd2eb51 · JSON
Operation
Image under a real-rootedness preserver
{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "-1"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
preserver_image, SHA-256 84f28dd2395e4f06015d2a58b97d5cfd2ad185ab6bc8607ad5605227bd092c17, 14,990 bytes (3,370 compressed); download
polytool replayed the certificate when the step was written.
Cited by