Define a polynomial-time reduction L₁ ≤ₚ L₂.

Answer

A polynomial-time computable function f such that for every instance x, x ∈ L₁ iff f(x) ∈ L₂.

f maps instances of L₁ to instances of L₂ in polynomial time and preserves yes/no membership in both directions.