Real-rooted atlas

Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver reversal, shift 0

Concludes
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 (0 <= k <= floor(n/2)…
Premises
Theorem
polytool ?
Lean
RealRooted route reversed RealRooted.X_pow_mul_reverse_eq_zero_or_splits, RealRooted.reflect_eq_zero_or_splits
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-9f4ef744e9f7773b · JSON
Operation
Image under a real-rootedness preserver
{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
Certificate
preserver_image, SHA-256 3fa0ee872037d09f9ceeffd3dd34c8f2941dda4cfc9557c342d844cf425cc76a, 11,559 bytes (3,124 compressed); download
polytool replayed the certificate when the step was written.
Cited by