JORDAN14: Properties of the Internal Approximation of {J}ordan's Curve

:: Properties of the Internal Approximation of {J}ordan's Curve
:: by Robert Milewski
::
:: Received June 27, 2002
:: Copyright (c) 2002-2016 Association of Mizar Users

environ

vocabularies HIDDEN, NUMBERS, FUNCT_1, GOBOARD5, JORDAN2C, TOPREAL1, GOBOARD9, CONNSP_1, SUBSET_1, GOBOARD1, FINSEQ_1, EUCLID, XXREAL_0, ARYTM_3, RCOMP_1, MATRIX_1, PARTFUN1, RELAT_1, ARYTM_1, PRE_TOPC, TREES_1, TOPS_1, MCART_1, REAL_1, RELAT_2, TOPREAL2, JORDAN8, JORDAN1H, JORDAN11, TARSKI, RLTOPSP1, JORDAN13, XBOOLE_0, CARD_1, GOBRD13, ORDINAL4, STRUCT_0, PSCOMP_1, SPPOL_1, NEWTON, COMPLEX1, JORDAN14, CONVEX1, XXREAL_2, NAT_1;
notations HIDDEN, TARSKI, XBOOLE_0, SUBSET_1, GOBOARD5, ORDINAL1, NUMBERS, XCMPLX_0, COMPLEX1, XREAL_0, REAL_1, NAT_1, NAT_D, NEWTON, PARTFUN1, FINSEQ_1, SEQM_3, STRUCT_0, MATRIX_0, PRE_TOPC, TOPREAL2, TOPS_1, COMPTS_1, CONNSP_1, RLVECT_1, RLTOPSP1, EUCLID, TOPREAL1, GOBOARD1, SPPOL_1, PSCOMP_1, GOBOARD9, JORDAN2C, JORDAN8, GOBRD13, JORDAN1H, JORDAN11, JORDAN13, XXREAL_0;
definitions TARSKI;
theorems NAT_1, FINSEQ_1, GOBOARD1, FINSEQ_4, EUCLID, FINSEQ_3, SPPOL_2, TARSKI, PSCOMP_1, FINSEQ_5, GOBOARD7, TOPREAL1, JORDAN5B, GOBOARD5, GOBOARD9, SUBSET_1, GOBRD11, SPRECT_3, GOBOARD6, TOPS_1, JORDAN8, GOBRD13, SPRECT_4, CONNSP_1, XBOOLE_0, XBOOLE_1, NEWTON, GOBRD14, TOPREAL6, INT_1, JORDAN2C, PRE_TOPC, JORDAN9, JORDAN1H, TSEP_1, GOBRD12, JORDAN1A, JORDAN1C, JORDAN11, JORDAN13, XREAL_1, XXREAL_0, CARD_1, MATRIX_0, NAT_D, XREAL_0, RLTOPSP1, SEQM_3;
schemes NAT_1;
registrations XBOOLE_0, ORDINAL1, RELSET_1, INT_1, FINSEQ_1, STRUCT_0, PRE_TOPC, TOPS_1, COMPTS_1, TOPREAL1, TOPREAL2, TOPREAL5, SPRECT_2, SPRECT_3, JORDAN2C, TOPREAL6, JORDAN8, GOBRD14, EUCLID, RLTOPSP1, JORDAN1, XREAL_0, NAT_1, NEWTON;
constructors HIDDEN, REAL_1, FINSEQ_4, NEWTON, NAT_D, TOPS_1, CONNSP_1, TOPREAL4, JORDAN1, PSCOMP_1, GOBOARD9, JORDAN2C, JORDAN8, JORDAN1H, JORDAN11, JORDAN13, CONVEX1, RELSET_1, GOBRD13;
requirements HIDDEN, REAL, NUMERALS, SUBSET, BOOLE, ARITHM;
equalities ;
expansions TARSKI;

theorem Th1: :: JORDAN14:1

for f being non constant standard special_circular_sequence holds
( BDD (L~ f) = RightComp f or BDD (L~ f) = LeftComp f )

proof end;

theorem :: JORDAN14:2

for f being non constant standard special_circular_sequence holds
( UBD (L~ f) = RightComp f or UBD (L~ f) = LeftComp f )

proof end;

theorem :: JORDAN14:3

for G being Go-board
for f being FinSequence of (TOP-REAL 2)
for k being Nat st 1 <= k & k + 1 <= len f & f is_sequence_on G holds
left_cell (f,k,G) is closed

proof end;

theorem Th4: :: JORDAN14:4

for G being Go-board
for p being Point of (TOP-REAL 2)
for i, j being Nat st 1 <= i & i + 1 <= len G & 1 <= j & j + 1 <= width G holds
( p in Int (cell (G,i,j)) iff ( (G * (i,j)) `1 < p `1 & p `1 < (G * ((i + 1),j)) `1 & (G * (i,j)) `2 < p `2 & p `2 < (G * (i,(j + 1))) `2 ) )

proof end;

theorem Th5: :: JORDAN14:5

for f being non constant standard special_circular_sequence holds BDD (L~ f) is connected

proof end;

registration

let f be non constant standard special_circular_sequence;

cluster BDD (L~ f) -> connected ;

coherence by Th5;

end;

definition

let C be Simple_closed_curve;
let n be Nat;

func SpanStart (C,n) -> Point of (TOP-REAL 2) equals :: JORDAN14:def 1
(Gauge (C,n)) * ((X-SpanStart (C,n)),(Y-SpanStart (C,n)));

coherence ;

end;

:: deftheorem defines SpanStart JORDAN14:def 1 :

theorem Th6: :: JORDAN14:6

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
SpanStart (C,n) in BDD C

proof end;

theorem Th7: :: JORDAN14:7

for C being Simple_closed_curve
for n, k being Nat st n is_sufficiently_large_for C & 1 <= k & k + 1 <= len (Span (C,n)) holds
( right_cell ((Span (C,n)),k,(Gauge (C,n))) misses C & left_cell ((Span (C,n)),k,(Gauge (C,n))) meets C )

proof end;

theorem Th8: :: JORDAN14:8

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
C misses L~ (Span (C,n))

proof end;

registration

let C be Simple_closed_curve;
let n be Nat;

cluster Cl (RightComp (Span (C,n))) -> compact ;

coherence by GOBRD14:32;

end;

theorem Th9: :: JORDAN14:9

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
C meets LeftComp (Span (C,n))

proof end;

theorem Th10: :: JORDAN14:10

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
C misses RightComp (Span (C,n))

proof end;

theorem Th11: :: JORDAN14:11

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
C c= LeftComp (Span (C,n))

proof end;

theorem Th12: :: JORDAN14:12

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
C c= UBD (L~ (Span (C,n)))

proof end;

theorem Th13: :: JORDAN14:13

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
BDD (L~ (Span (C,n))) c= BDD C

proof end;

theorem Th14: :: JORDAN14:14

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
UBD C c= UBD (L~ (Span (C,n)))

proof end;

theorem :: JORDAN14:15

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
RightComp (Span (C,n)) c= BDD C

proof end;

theorem Th16: :: JORDAN14:16

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
UBD C c= LeftComp (Span (C,n))

proof end;

theorem Th17: :: JORDAN14:17

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
UBD C misses BDD (L~ (Span (C,n)))

proof end;

theorem :: JORDAN14:18

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
UBD C misses RightComp (Span (C,n))

proof end;

theorem Th19: :: JORDAN14:19

for C being Simple_closed_curve
for P being Subset of (TOP-REAL 2)
for n being Nat st n is_sufficiently_large_for C & P is_outside_component_of C holds
P misses L~ (Span (C,n))

proof end;

theorem Th20: :: JORDAN14:20

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
UBD C misses L~ (Span (C,n))

proof end;

theorem Th21: :: JORDAN14:21

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
L~ (Span (C,n)) c= BDD C

proof end;

theorem Th22: :: JORDAN14:22

for C being Simple_closed_curve
for i, j, k, n being Nat st n is_sufficiently_large_for C & 1 <= k & k <= len (Span (C,n)) & [i,j] in Indices (Gauge (C,n)) & (Span (C,n)) /. k = (Gauge (C,n)) * (i,j) holds
i > 1

proof end;

theorem Th23: :: JORDAN14:23

proof end;

theorem Th24: :: JORDAN14:24

proof end;

theorem Th25: :: JORDAN14:25

proof end;

theorem :: JORDAN14:26

for C being Simple_closed_curve
for n being Nat st n is_sufficiently_large_for C holds
Y-SpanStart (C,n) < width (Gauge (C,n))

proof end;

theorem Th27: :: JORDAN14:27

for C being compact non horizontal non vertical Subset of (TOP-REAL 2)
for n, m being Nat st m >= n & n >= 1 holds
X-SpanStart (C,m) = ((2 |^ (m -' n)) * ((X-SpanStart (C,n)) - 2)) + 2

proof end;

theorem Th28: :: JORDAN14:28

for C being compact non horizontal non vertical Subset of (TOP-REAL 2)
for n, m being Nat st n <= m & n is_sufficiently_large_for C holds
m is_sufficiently_large_for C

proof end;

theorem Th29: :: JORDAN14:29

for G being Go-board
for f being FinSequence of (TOP-REAL 2)
for i, j being Nat st f is_sequence_on G & f is special & i <= len G & j <= width G holds
(cell (G,i,j)) \ (L~ f) is connected

proof end;

theorem Th30: :: JORDAN14:30

for C being Simple_closed_curve
for n, k being Nat st n is_sufficiently_large_for C & Y-SpanStart (C,n) <= k & k <= ((2 |^ (n -' (ApproxIndex C))) * ((Y-InitStart C) -' 2)) + 2 holds
(cell ((Gauge (C,n)),((X-SpanStart (C,n)) -' 1),k)) \ (L~ (Span (C,n))) c= BDD (L~ (Span (C,n)))

proof end;

theorem Th31: :: JORDAN14:31

for C being Subset of (TOP-REAL 2)
for n, m, i being Nat st m <= n & 1 < i & i + 1 < len (Gauge (C,m)) holds
(((2 |^ (n -' m)) * (i - 2)) + 2) + 1 < len (Gauge (C,n))

proof end;

theorem Th32: :: JORDAN14:32

for C being Simple_closed_curve
for n, m being Nat st n is_sufficiently_large_for C & n <= m holds
RightComp (Span (C,n)) meets RightComp (Span (C,m))

proof end;

theorem Th33: :: JORDAN14:33

for G being Go-board
for f being FinSequence of (TOP-REAL 2) st f is_sequence_on G & f is special holds
for i, j being Nat st i <= len G & j <= width G holds
Int (cell (G,i,j)) c= (L~ f) ` by JORDAN9:14, SUBSET_1:23;

theorem Th34: :: JORDAN14:34

for C being Simple_closed_curve
for n, m being Nat st n is_sufficiently_large_for C & n <= m holds
L~ (Span (C,m)) c= Cl (LeftComp (Span (C,n)))

proof end;

theorem Th35: :: JORDAN14:35

for C being Simple_closed_curve
for n, m being Nat st n is_sufficiently_large_for C & n <= m holds
RightComp (Span (C,n)) c= RightComp (Span (C,m))

proof end;

theorem :: JORDAN14:36

for C being Simple_closed_curve
for n, m being Nat st n is_sufficiently_large_for C & n <= m holds
LeftComp (Span (C,m)) c= LeftComp (Span (C,n))

proof end;