Showing changes from revision #30 to #31:
Added | Removed | Changed
Very A few lattice people is use the quadratic formula for real quadratic functions in applications of mathematics. (The quadratic formula also doesn’t hold for most types of real numbers in constructive mathematics.) Instead, they use numerical solvers in a computer or on a calculator, and it would be better for students to understand the numerical analysis algorithms behind the numerical solvers:set with terms , and functions , , such that
Given a real quadratic function , for real numbers , , , where , suppose we want to find an approximate zero of . The real quadratic function has discriminant and has 2 zeroes if , 1 zero of multiplicity 2 at if , or no zeroes of . (In constructive mathematics, there are real quadratic functions where it isn’t possible to determine the number of zeroes the real quadratic function has.) Assume that . Select a real number as the initial guess, where or , and the next guess would be defined as
and are commutative monoids
and are idempotent: for all terms , and
for all and , and
A -complete lattice is a lattice with a function
such that
The algorithm isn’t valid when because of division by zero. When , the algorithm converges towards the zero at , and when , the algorithm converges towards the zero , where is where the extremum (minimum/maximum) of the parabola occurs.
This is known as Newton’s method for real quadratic functions, and could be introduced in any secondary school algebra course. The proof would have to wait until a calculus course, but the proof of the fundamental theorem of algebra requires some form of real or complex analysis and the fundamental theorem of algebra is still taught in secondary school algebra.
A -frame is a -complete lattice such that
Sierpinski space is an initial -frame, and thus could be generated as a higher inductive type.