Decomposing a Go-Board into Cells

Transcription

1 FORMALIZED MATHEMATICS Volume 5, Number 3, 1996 Warsaw University - Bia lystok Decomposing a Go-Board into Cells Yatsuka Nakamura Shinshu University Nagano Andrzej Trybulec Warsaw University Bia lystok MML Identifier: GOBOARD5. The articles [20], [23], [6], [22], [9], [2], [14], [17], [18], [24], [1], [5], [3], [4], [21], [10], [11], [16], [15], [7], [8], [12], [13], and [19] provide the terminology and notation for this paper. For simplicity we follow a convention: q will be a point of ET 2, i, i 1, i 2, j, j 1, j 2, k will be natural numbers, r, s will be real numbers, and G will be a Go-board. We now state the proposition (1) Let M be a tabular finite sequence and given i, j. If i, j the indices of M, then 1 i and i len M and 1 j and j width M. Let us consider G, i. The functor vstrip(g,i) yielding a subset of the carrier of ET 2 is defined as follows: (Def.1) (i) vstrip(g,i) = {[r,s] : (G i,1 ) 1 r r (G i+1,1 ) 1 } if 1 i and i < len G, (ii) vstrip(g,i) = {[r,s] : (G i,1 ) 1 r} if i len G, (iii) vstrip(g,i) = {[r,s] : r (G i+1,1 ) 1 }, otherwise. The functor hstrip(g,i) yields a subset of the carrier of ET 2 and is defined by: (Def.2) (i) hstrip(g,i) = {[r,s] : (G 1,i ) 2 s s (G 1,i+1 ) 2 } if 1 i and i < width G, (ii) hstrip(g,i) = {[r,s] : (G 1,i ) 2 s} if i widthg, (iii) hstrip(g,i) = {[r,s] : s (G 1,i+1 ) 2 }, otherwise. We now state a number of propositions: (2) If 1 j and j widthg and 1 i and i len G, then (G i,j ) 2 = (G 1,j ) 2. (3) If 1 j and j widthg and 1 i and i len G, then (G i,j ) 1 = (G i,1 ) 1. (4) If 1 j and j widthg and 1 i 1 and i 1 < i 2 and i 2 len G, then (G i1,j) 1 < (G i2,j) c 1996 Warsaw University - Bia lystok ISSN

2 324 yatsuka nakamura and andrzej trybulec (5) If 1 j 1 and j 1 < j 2 and j 2 width G and 1 i and i len G, then (G i,j1 ) 2 < (G i,j2 ) 2. (6) If 1 j and j < widthg and 1 i and i len G, then hstrip(g,j) = {[r,s] : (G i,j ) 2 s s (G i,j+1 ) 2 }. (7) If 1 i and i len G, then hstrip(g,width G) = {[r,s] : (G i,width G ) 2 s}. (8) If 1 i and i len G, then hstrip(g,0) = {[r,s] : s (G i,1 ) 2 }. (9) If 1 i and i < len G and 1 j and j widthg, then vstrip(g,i) = {[r,s] : (G i,j ) 1 r r (G i+1,j ) 1 }. (10) If 1 j and j width G, then vstrip(g,len G) = {[r,s] : (G len G,j ) 1 r}. (11) If 1 j and j widthg, then vstrip(g,0) = {[r,s] : r (G 1,j ) 1 }. Let G be a Go-board and let us consider i, j. The functor cell(g,i,j) yields a subset of the carrier of ET 2 and is defined as follows: (Def.3) cell(g, i, j) = vstrip(g, i) hstrip(g, j). A finite sequence of elements of ET 2 is s.c.c. if: (Def.4) For all i, j such that i + 1 < j but i > 1 and j < len it or j + 1 < len it holds L(it,i) L(it,j) =. A non empty finite sequence of elements of ET 2 is standard if: (Def.5) It is a sequence which elements belong to the Go-board of it. One can verify that there exists a non empty finite sequence of elements of ET 2 which is non constant special unfolded circular s.c.c. and standard. We now state two propositions: (12) Let f be a standard non empty finite sequence of elements of ET 2. Suppose k domf. Then there exist i, j such that i, j the indices of the Go-board of f and π k f = (the Go-board of f) i,j. (13) Let f be a standard non empty finite sequence of elements of ET 2 and let n be a natural number. Suppose n dom f and n + 1 dom f. Let m, k, i, j be natural numbers. Suppose that (i) m, k the indices of the Go-board of f, (ii) i, j the indices of the Go-board of f, (iii) π n f = (the Go-board of f) m,k, and (iv) π n+1 f = (the Go-board of f) i,j. Then m i + k j = 1. A special circular sequence is a special unfolded circular s.c.c. non empty finite sequence of elements of ET 2. In the sequel f is a standard special circular sequence. Let us consider f, k. Let us assume that 1 k and k+1 len f. The functor rightcell(f,k) yielding a subset of the carrier of ET 2 is defined by the condition (Def.6). (Def.6) Let i 1, j 1, i 2, j 2 be natural numbers. Suppose that (i) i 1, j 1 the indices of the Go-board of f,

3 decomposing a go-board into cells 325 (ii) i 2, j 2 the indices of the Go-board of f, (iii) π k f = (the Go-board of f) i1,j 1, and (iv) π k+1 f = (the Go-board of f) i2,j 2. Then (v) i 1 = i 2 and j = j 2 and rightcell(f,k) = cell(the Go-board of f, i 1,j 1 ), or (vi) i = i 2 and j 1 = j 2 and rightcell(f,k) = cell(the Go-board of f, i 1,j 1 1), or (vii) i 1 = i and j 1 = j 2 and rightcell(f,k) = cell(the Go-board of f, i 2,j 2 ), or (viii) i 1 = i 2 and j 1 = j and rightcell(f,k) = cell(the Go-board of f, i 1 1,j 2 ). The functor leftcell(f,k) yielding a subset of the carrier of ET 2 is defined by the condition (Def.7). (Def.7) Let i 1, j 1, i 2, j 2 be natural numbers. Suppose that (i) i 1, j 1 the indices of the Go-board of f, (ii) i 2, j 2 the indices of the Go-board of f, (iii) π k f = (the Go-board of f) i1,j 1, and (iv) π k+1 f = (the Go-board of f) i2,j 2. Then (v) i 1 = i 2 and j = j 2 and leftcell(f,k) = cell(the Go-board of f, i 1 1,j 1 ), or (vi) i = i 2 and j 1 = j 2 and leftcell(f,k) = cell(the Go-board of f, i 1,j 1 ), or (vii) i 1 = i and j 1 = j 2 and leftcell(f,k) = cell(the Go-board of f, i 2,j 2 1), or (viii) i 1 = i 2 and j 1 = j and leftcell(f,k) = cell(the Go-board of f, i 1,j 2 ). Next we state a number of propositions: (14) If i < len G and 1 j and j < widthg, then L(G i+1,j,g i+1,j+1 ) vstrip(g, i). (15) If 1 i and i len G and 1 j and j < widthg, then L(G i,j,g i,j+1 ) vstrip(g, i). (16) If j < width G and 1 i and i < len G, then L(G i,j+1,g i+1,j+1 ) hstrip(g, j). (17) If 1 j and j width G and 1 i and i < len G, then L(G i,j,g i+1,j ) hstrip(g, j). (18) If 1 i and i len G and 1 j and j + 1 widthg, then L(G i,j,g i,j+1 ) hstrip(g,j). (19) If i < len G and 1 j and j < widthg, then L(G i+1,j,g i+1,j+1 ) (20) If 1 i and i len G and 1 j and j < widthg, then L(G i,j,g i,j+1 )

4 326 yatsuka nakamura and andrzej trybulec (21) If 1 j and j width G and 1 i and i + 1 len G, then L(G i,j,g i+1,j ) vstrip(g,i). (22) If j < width G and 1 i and i < len G, then L(G i,j+1,g i+1,j+1 ) (23) If 1 i and i < len G and 1 j and j widthg, then L(G i,j,g i+1,j ) (24) If i+1 len G, then vstrip(g,i) vstrip(g,i+1) = {q : q 1 = (G i+1,1 ) 1 }. (25) If j + 1 widthg, then hstrip(g,j) hstrip(g,j + 1) = {q : q 2 = (G 1,j+1 ) 2 }. (26) For every Go-board G such that i < len G and 1 j and j < width G holds cell(g,i,j) cell(g,i + 1,j) = L(G i+1,j,g i+1,j+1 ). (27) For every Go-board G such that j < width G and 1 i and i < len G holds cell(g,i,j) cell(g,i,j + 1) = L(G i,j+1,g i+1,j+1 ). (28) Suppose that (iii) i + 1, j the indices of the Go-board of f, (iv) i + 1, j + 1 the indices of the Go-board of f, (v) π k f = (the Go-board of f) i+1,j, and (vi) π k+1 f = (the Go-board of f) i+1,j+1. Then leftcell(f,k) = cell(the Go-board of f, i,j) and rightcell(f,k) = cell(the Go-board of f, i + 1,j). (29) Suppose that (iii) i, j + 1 the indices of the Go-board of f, (iv) i + 1, j + 1 the indices of the Go-board of f, (v) π k f = (the Go-board of f) i,j+1, and (vi) π k+1 f = (the Go-board of f) i+1,j+1. Then leftcell(f,k) = cell(the Go-board of f, i,j + 1) and rightcell(f,k) = cell(the Go-board of f, i,j). (30) Suppose that (iii) i, j + 1 the indices of the Go-board of f, (iv) i + 1, j + 1 the indices of the Go-board of f, (v) π k f = (the Go-board of f) i+1,j+1, and (vi) π k+1 f = (the Go-board of f) i,j+1. Then leftcell(f,k) = cell(the Go-board of f, i,j) and rightcell(f,k) = cell(the Go-board of f, i,j + 1). (31) Suppose that

5 decomposing a go-board into cells 327 (iii) i + 1, j + 1 the indices of the Go-board of f, (iv) i + 1, j the indices of the Go-board of f, (v) π k f = (the Go-board of f) i+1,j+1, and (vi) π k+1 f = (the Go-board of f) i+1,j. Then leftcell(f,k) = cell(the Go-board of f, i + 1,j) and rightcell(f,k) = cell(the Go-board of f, i,j). (32) If 1 k and k + 1 len f, then leftcell(f,k) rightcell(f,k) = L(f,k). References [1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2): , [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41 46, [3] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1): , [4] Czes law Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3): , [5] Czes law Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55 65, [6] Czes law Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47 53, [7] Agata Darmochwa l. The Euclidean space. Formalized Mathematics, 2(4): , [8] Agata Darmochwa l and Yatsuka Nakamura. The topological space ET. 2 Arcs, line segments and special polygonal arcs. Formalized Mathematics, 2(5): , [9] Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35 40, [10] Katarzyna Jankowska. Matrices. Abelian group of matrices. Formalized Mathematics, 2(4): , [11] Katarzyna Jankowska. Transpose matrices and groups of permutations. Formalized Mathematics, 2(5): , [12] Jaros law Kotowicz and Yatsuka Nakamura. Introduction to Go-board - part I. Formalized Mathematics, 3(1): , [13] Jaros law Kotowicz and Yatsuka Nakamura. Introduction to Go-board - part II. Formalized Mathematics, 3(1): , [14] Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics. Formalized Mathematics, 4(1):83 86, [15] Beata Padlewska. Connected spaces. Formalized Mathematics, 1(1): , [16] Beata Padlewska and Agata Darmochwa l. Topological spaces and continuous functions. Formalized Mathematics, 1(1): , [17] Jan Popio lek. Some properties of functions modul and signum. Formalized Mathematics, 1(2): , [18] Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25 34, [19] Andrzej Trybulec. On the decomposition of finite sequences. Formalized Mathematics, 5(3): , [20] Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9 11, [21] Wojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3): , [22] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67 71, [23] Zinaida Trybulec and Halina Świe czkowska. Boolean properties of sets. Formalized Mathematics, 1(1):17 23, 1990.

6 328 yatsuka nakamura and andrzej trybulec [24] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73 83, Received May 26, 1995