Proof step

Geometric basis map (elementary)

Image under a basis map u^k -> P_k A013611

Concludes

Premises

Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Theorem

polytool ?

Checked

polytool replayed · Lean not attempted

Technical details

Step id

e-f4298ff451e78d20 · JSON

Operation

Image under a basis map u^k -> P_k

{
  "map": "A013611",
  "operation": "basis_map"
}

Claims

{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}

{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "unordered"
}

Certificate

basis_map, SHA-256 346d94c5d664bc6221aea0fe31aaa6d755b2350f6c311cba333d890e5f67d13e, 14,585 bytes (2,817 compressed); download

polytool replayed the certificate when the step was written.

Cited by