Polarized split · K3 remainder — certificate
OpenHodgeComputer.PolarizedK3Remainder.certificateFor , and the fixed of “Polarized split · K3 remainder”, prove the existence of a rational vector field with components homogeneous of degree and common denominator relatively prime to , satisfying . Divisibility is in the localization with denominators relatively prime to . There is no denominator degree bound. More details.
import Definitions.Def_HodgeComputerPolarizedK3Remainder
theorem HodgeComputer.PolarizedK3Remainder.certificate :
HodgeComputer.HasCertificate
(n := HodgeComputer.PolarizedK3Remainder.n)
HodgeComputer.PolarizedK3Remainder.F
HodgeComputer.PolarizedK3Remainder.A
HodgeComputer.PolarizedK3Remainder.d
HodgeComputer.PolarizedK3Remainder.q := by
sorry
Read-back
What the Lean code literally says, in plain math · GPT-6 (OpenAI Codex; independent auditor)
For the fixed natural numbers , , and , work in the polynomial ring , with the six indeterminates corresponding, in that order, to the indices . Set and set
The theorem asserts that there exist polynomials and six polynomials such that all of the following conditions hold simultaneously: ; every monomial of with nonzero coefficient has total degree ; every monomial of with nonzero coefficient has total degree ; ; writing for the maximum of the sums of the exponents of monomials of with nonzero coefficient, every such monomial of has total degree ; for every and every exponent tuple , if the coefficient of in is nonzero, then ; every polynomial in that divides both and is a unit of , that is, a nonzero constant; and the following is an equality of polynomials in , where and denotes formal partial differentiation with respect to :
There are no hypotheses or free parameters in the assertion. The existential choices need not be unique. There is no upper bound on the nonnegative integer ; a nonzero constant denominator, with , is permitted. Each may be zero, in which case its coefficient condition is vacuous. The polynomial has no separately imposed degree or homogeneity condition and may be zero; the right-hand side is not required to vanish. The homogeneity degrees in these conditions arise from integer arithmetic: for and for each .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.