Proof step e-5cc1f9826e25e5f1

preserver_image affine, shift 0 → concludes about shift_x_plus_one of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals… 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

• Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals… (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" } } }
• { "claim": "interlacing", "from_index": 2, "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 e00732edf6e65cc089e64e3ee074b4435fa8d36b8310e3628d3cad56be9a48fe, 22,870 bytes (5,449 compressed); download JSON

Cited by

• n-40ba0d1f2a40a97e (real_rooted)
• n-40ba0d1f2a40a97e (one_signed_coefficients)
• n-40ba0d1f2a40a97e (hadamard_kernel)
• n-40ba0d1f2a40a97e (interlacing)