Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" Newsgroups: sci.math Subject: Re: How many different unit fractions are lessorequal than all unit fractions? (repleteness) Date: Wed, 18 Sep 2024 12:37:33 -0700 Organization: A noiseless patient Spider Lines: 66 Message-ID: References: <13c08e96ad635f8142b38d89863a80caf17a32a8@i2pn2.org> <4faa63d0ff8c163f01a38736aeb5732184218a29@i2pn2.org> <7-ycnVjnAIKXynr7nZ2dnZfqn_qdnZ2d@giganews.com> <3906cb72-4bad-4a2a-97c7-4da857adc7a4@att.net> <05bf9c39-b715-41d6-b349-87ddc67941ff@att.net> <1b54c6c9-8b85-4c59-865a-fb601eaf4e1f@att.net> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Wed, 18 Sep 2024 21:37:33 +0200 (CEST) Injection-Info: dont-email.me; posting-host="22866179a6b7ed6c688d4ac17c30f9bb"; logging-data="204646"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18PMK2ZgsNz2+o1H2+n1tzGLfmuOyVlhXs=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:lfMbS9I6hPy+7t6SH90XD8R09rU= Content-Language: en-US In-Reply-To: Bytes: 3691 On 9/17/2024 7:58 PM, Ross Finlayson wrote: > On 09/17/2024 03:20 PM, Jim Burns wrote: >> On 9/17/2024 4:16 PM, Ross Finlayson wrote: >>> On 09/17/2024 01:11 PM, Jim Burns wrote: >>>> On 9/17/2024 2:57 PM, Ross Finlayson wrote: >> >>>> Unlike ℕ and ℤ,  ℚ and ℝ do not 'next'. >> >>> Then, for initial segments or n-sets of naturals, >>> the LUB of {f{n < m)} is "next": f(m+1). >> >> Yes. >> (Presumably, you mean lub.{n:n≤m} = m. f()=? ) >> >> You might enjoy this: >> >> ⎛ Define ℕ as well.ordered and nexted. >> ⎜ well.ordered (A ⊆ ℕ holds min.A or is empty) >> ⎝ nexted (m ∈ ℕ has m+1 m-1 next, except 0=min.ℕ) >> >> ⎛ In a finite order, >> ⎝ each nonempty subset is 2.ended. >> >> Consider upper.bounded nonempty A ⊆ ℕ and >> its set UB[A] ⊆ ℕ of upper.bounds >> A ᵉᵃᶜʰ≤ᵉᵃᶜʰ UB[A] >> >> A is upper.bounded. >> UB[A] ⊆ ℕ is nonempty. >> UB[A] holds min.UB[A] >> >> A holds min.UB[A] >> Otherwise, >> (min.UB[A])-1 is a less.than.least upper.bound >> (that is, what.it.is is gibberish) >> >> A holds min.UB[A] which upper.bounds A >> min.UB[A] = max.A >> Upper.bounded nonempty A holds max.A >> >> Upper.bounded nonempty A ⊆ ℕ holds min.A >> (well.order) >> >> Upper.bounded nonempty A is 2.ended. >> >> And, similarly, >> each (also.bounded) nonempty S ⊆ A is 2.ended. >> >> Upper.bounded nonempty A ⊆ ℕ is finite, >> because >> ℕ is well.ordered and nexted. >> >> > > Yet, didn't you just reject, "infinite middle"? > > Mid point: p0 = (-1, 0) p1 = (1, 1) pdif = p1 - p0 pmid = p0 + pdif / 2