Boolean Functions by Serban E. Vlad;

Author:Serban E. Vlad;
Language: eng
Format: epub
ISBN: 9781119517511
Publisher: John Wiley & Sons, Inc.
Published: 2019-01-02T20:33:11+00:00

Example 7.6

We have in Figure 7.5, the two sets and , which are path connected components of We can partition and and get new path connected components of

Figure 7.5 The sets are path connected components of .

7.5 Morphisms vs Path Connectedness

Theorem 7.6

Let and nonempty. If is path connected and then is path connected.

We take arbitrary, thus exist with Then exist with wherefrom

□

7.6 Antimorphisms vs Path Connectedness

Theorem 7.7

If is path connected and then is path connected.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.