[RFC Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page]

Tweet
This is a modified version of the Internet RFC suitable for machine-translating. Original version is available here: RFC154

UNKNOWN
Network Working Group                                         S. Crocker
Request for Comments: #154                                          UCLA
NIC: #6759                                                   12 May 1971
Categories: C.4
Updates: #107
Obsoletes: #132
Exposition Style

As a pedagogical device for describing functions such as the one below

           |
           |                  +-----------------
           |                 /:
| / : | / : | / : | / :
           |            /     :
      -----+------------------------------------
           |                  a
           |
where two formulae, f1 and f2, are necessary for adjoining domains but the function is continous at the boundary point, I usually write the description in the form

f(x) = f1(x) for x =< a f(x) = f2(x) for x >= a

The astute reader will note that the domains overlap, but that f1(a) = f2(a), so no semantic ambiguity obtains.


[ This RFC was put into machine readable form for entry ] [ into the online RFC archives by Naoki Matsuhira 5/97 ]












Crocker [Page 1]

Translate documents to 日本語, svenska, Nederlands, Deutsch, français, русский, italiano, español, Tiếng Việt, polski, português, 中文, українська, català, norsk, فارسی, suomi, Bahasa Indonesia, العربية, čeština, 한국어, Bahasa Melayu, magyar, română, српски and other languages.
inserted by FC2 system