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 read by rows: T(n,k) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 8.
Premises
Theorem
polytool ?
Lean
RealRooted Polynomial.Splits.comp_of_degree_le_one
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-e9f91532c17a7b97 · 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 b9a0e18980ef7362a91032d4b16b077ac919019353776745f80ce899e3f50d13, 11,994 bytes (3,036 compressed); download
polytool replayed the certificate when the step was written.
Cited by