Proof step e-5a12e548117a4094
basis_map_theorem → concludes about Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1). JSON
Theorem
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
Operation
Basis map theorem for the node's own rule
{
"operation": "basis_map_theorem"
}
Premises
None: this step is a direct theorem check.
Claims
- { "claim": "basis_map_preserver", "input_interval": "[-1, 1]", "output_interval": "(-inf, +inf)", "statement": "every real polynomial with all roots in E = [-1, 1] has a real-rooted image" }
- { "claim": "basis_map_preserver", "input_interval": "[-1, 1]", "output_interval": "[-4, 0]", "statement": "every real polynomial with all roots in E = [-1, 1] has an image with all roots in I = [-4, 0]" }
- { "claim": "basis_map_preserver", "input_interval": "[-1, 0]", "output_interval": "[-4, 0]", "statement": "every PF input with all roots in [-1, 0] has a PF image; no larger [-R, 0] works" }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
basis_map_theorem, SHA-2563604415578967da11340c05f0bd7265340203e2a498581be7a8ec7fc034dfabd, 5,246 bytes (1,333 compressed); download JSON
Cited by
n-976cdb6e4a693ec8(basis_map_preserver)