Homotopy Type Theory UMyn8W7b (Rev #31, changes)

Showing changes from revision #30 to #31: Added | Removed | Changed

Comments Real about numbers school mathematics

A Lattices replacement and for the quadratic formulaσ\sigma-frames

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 LL with terms :L\bot:L, :L\top:L and functions :L\wedge:L, :L\vee:L, such that

Given a real quadratic function f:f:\mathbb{R} \to \mathbb{R}, f(x)ax 2+bx+cf(x) \coloneqq a x^2 + b x + c for real numbers a:a:\mathbb{R}, b:b:\mathbb{R}, c:c:\mathbb{R}, where |a|>0\vert a \vert \gt 0, suppose we want to find an approximate zero of ff. The real quadratic function has discriminant Δ=b 24ac\Delta = b^2 - 4 a c and has 2 zeroes if Δ>0\Delta \gt 0, 1 zero of multiplicity 2 at 2ax i+b=02 a x_i + b = 0 if Δ=0\Delta = 0, or no zeroes of Δ<0\Delta \lt 0. (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 Δ>0\Delta \gt 0. Select a real number x 0:x_0:\mathbb{R} as the initial guess, where 2ax 0+b>02 a x_0 + b \gt 0 or 2ax 0+b<02 a x_0 + b \lt 0, and the next guess would be defined as

  • (L,,)(L, \top, \wedge) and (L,,)(L, \bot, \vee) are commutative monoids

  • \wedge and \vee are idempotent: for all terms a:La:L, aa=aa \wedge a = a and aa=aa \vee a = a

  • for all a:La:L and b:Lb:L, a(ab)=aa \wedge (a \vee b) = a and a(ab)=aa \vee (a \wedge b) = a

x i+1=x iax i 2+bx i+c2ax i+bx_{i+1} = x_i - \frac{a x_i^2 + b x_i + c}{2 a x_i + b}

A σ\sigma-complete lattice is a lattice LL with a function

x i+1=x iax i 2+12bx i+12bx i+c2ax i+bx_{i+1} = x_i - \frac{a x_i^2 + \frac{1}{2} b x_i + \frac{1}{2} b x_i + c}{2 a x_i + b}
x i+1 n: = (x i )12(x in )12bx i+c2ax i+b:(L)L x_{i+1} \Vee_{n:\mathbb{N}} = (-)(n): x_i (\mathbb{N} - \to \frac{1}{2} L) x_i \to - L \frac{\frac{1}{2} b x_i + c}{2 a x_i + b}
x i+1=12(x ibx i+2c2ax i+b)x_{i+1} = \frac{1}{2} \left(x_i - \frac{b x_i + 2 c}{2 a x_i + b}\right)

such that

The algorithm isn’t valid when 2ax 0+b=02 a x_0 + b = 0 because of division by zero. When 2ax 0+b>02 a x_0 + b \gt 0, the algorithm converges towards the zero at x>b2ax \gt -\frac{b}{2a}, and when 2ax 0+b<02 a x_0 + b \lt 0, the algorithm converges towards the zero x<b2ax \lt -\frac{b}{2a}, where b2a-\frac{b}{2a} is where the extremum (minimum/maximum) of the parabola occurs.

  • for all n:n:\mathbb{N} and s:Ls:\mathbb{N} \to L,

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.

s(n)( n:s(n))=s(n)s(n) \wedge \left(\Vee_{n:\mathbb{N}} s(n)\right) = s(n)
  • for all x:Lx:L and s:Ls:\mathbb{N} \to L, if s(n)x=s(n)s(n) \wedge x = s(n) for all n:n:\mathbb{N}, then
(( n:s(n))x= n:s(n))\left(\left(\Vee_{n:\mathbb{N}} s(n)\right) \wedge x = \Vee_{n:\mathbb{N}} s(n)\right)

A σ\sigma-frame is a σ\sigma-complete lattice such that

  • for all x:Lx:L and s:Ls:\mathbb{N} \to L,
x( n:s(n))= n:(xs(n))x \wedge \left(\Vee_{n:\mathbb{N}} s(n)\right) = \Vee_{n:\mathbb{N}} (x \wedge s(n))

Sierpinski space

Sierpinski space Σ\Sigma is an initial σ\sigma-frame, and thus could be generated as a higher inductive type.

Revision on May 8, 2022 at 16:33:21 by Anonymous?. See the history of this page for a list of all contributions to it.