Proof step e-6b0b885431c4352b

preserver_image affine, shift 0 → concludes about shift_x_plus_one of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (… 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) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (… (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" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 789fc54cca1cd2c05cffb1a3fff0ab2cb479232468ee34be9640ad5fd617d28b, 10,028 bytes (2,872 compressed); download JSON

Cited by

• n-fe5f0667f4ce56c9 (real_rooted)
• n-fe5f0667f4ce56c9 (one_signed_coefficients)
• n-fe5f0667f4ce56c9 (hadamard_kernel)