All MicroEvals
### Why fixing the collision loses no colliding candidate S...
Create MicroEval

### Why fixing the collision loses no colliding candidate S...

Prompt

### Why fixing the collision loses no colliding candidate Suppose a polynomial map \(F\) satisfies \[ \det DF=c\ne0,\qquad F(P)=F(Q),\qquad P\ne Q. \] Choose an invertible constant matrix \(A\) whose first column is \(Q-P\). Define \[ G(t)=\bigl(DF(P)A\bigr)^{-1} \bigl(F(P+At)-F(P)\bigr). \] Then \[ G(0)=G(1,0)=0,\qquad DG(0)=I, \] and \[ \det DG(t) = \frac{\det DF(P+At)}{\det DF(P)} = 1. \] Only affine coordinate changes are used. Polynomiality and the degree bound are preserved. This removes the unknown collision points and the distinctness constraint **without imposing triangularity, homogeneity, nilpotence, or properness**.

Drag to resize
Drag to resize

Response not available

Drag to resize
Drag to resize
Drag to resize