Condition
Порядок Ȟ¹ стягиваемого пространства
Established
Query parameters · 3
- f
- urn:case:stacks:cech:F
- c
- urn:case:stacks:cech:cov
- n
- 1
Input facts · 88
is a finite space with the specialization (Alexandrov) topology: the open subsets are exactly the subsets stable under generalization
x: xis presented as a subset of (possibly empty), to be tested for openness
u x U1 x U2 x W x X x the point belongs to
p x a x b x c x 0061: — is a specialization of , a generalization of : ∈ closure of
g p c a c b the point lies in the subset
u p U1 a U1 c U2 b U2 c W c X a X b X c the covering is aimed at : its members are proposed to cover
c: covu: Xis a member of the covering
c ui cov U1 cov U2 01FI: , the first member in the total ordering of the covering
c: covu: U101FI: , the second member in the total ordering of the covering
c: covu: U2is the constant sheaf : sections over are the locally constant maps
f: Fx: xthe candidate is a function on the points of
s: fn-U1-00u: U1the function takes the value at the point
s p v fn-U1-00 a 0 fn-U1-00 c 0 the candidate is a function on the points of
s: fn-U1-01u: U1the function takes the value at the point
s p v fn-U1-01 a 0 fn-U1-01 c 1 the candidate is a function on the points of
s: fn-U1-10u: U1the function takes the value at the point
s p v fn-U1-10 a 1 fn-U1-10 c 0 the candidate is a function on the points of
s: fn-U1-11u: U1the function takes the value at the point
s p v fn-U1-11 a 1 fn-U1-11 c 1 every function is presented as a candidate section of over
f: Fu: U1the candidate is a function on the points of
s: fn-U2-00u: U2the function takes the value at the point
s p v fn-U2-00 b 0 fn-U2-00 c 0 the candidate is a function on the points of
s: fn-U2-01u: U2the function takes the value at the point
s p v fn-U2-01 b 0 fn-U2-01 c 1 the candidate is a function on the points of
s: fn-U2-10u: U2the function takes the value at the point
s p v fn-U2-10 b 1 fn-U2-10 c 0 the candidate is a function on the points of
s: fn-U2-11u: U2the function takes the value at the point
s p v fn-U2-11 b 1 fn-U2-11 c 1 every function is presented as a candidate section of over
f: Fu: U2the candidate is a function on the points of
s: fn-W-0u: Wthe function takes the value at the point
s: fn-W-0p: cv: 0the candidate is a function on the points of
s: fn-W-1u: Wthe function takes the value at the point
s: fn-W-1p: cv: 1every function is presented as a candidate section of over
f: Fu: Wthe candidate is a function on the points of
s: fn-X-000u: Xthe function takes the value at the point
s p v fn-X-000 a 0 fn-X-000 b 0 fn-X-000 c 0 the candidate is a function on the points of
s: fn-X-001u: Xthe function takes the value at the point
s p v fn-X-001 a 0 fn-X-001 b 0 fn-X-001 c 1 the candidate is a function on the points of
s: fn-X-010u: Xthe function takes the value at the point
s p v fn-X-010 a 0 fn-X-010 b 1 fn-X-010 c 0 the candidate is a function on the points of
s: fn-X-011u: Xthe function takes the value at the point
s p v fn-X-011 a 0 fn-X-011 b 1 fn-X-011 c 1 the candidate is a function on the points of
s: fn-X-100u: Xthe function takes the value at the point
s p v fn-X-100 a 1 fn-X-100 b 0 fn-X-100 c 0 the candidate is a function on the points of
s: fn-X-101u: Xthe function takes the value at the point
s p v fn-X-101 a 1 fn-X-101 b 0 fn-X-101 c 1 the candidate is a function on the points of
s: fn-X-110u: Xthe function takes the value at the point
s p v fn-X-110 a 1 fn-X-110 b 1 fn-X-110 c 0 the candidate is a function on the points of
s: fn-X-111u: Xthe function takes the value at the point
s p v fn-X-111 a 1 fn-X-111 b 1 fn-X-111 c 1 every function is presented as a candidate section of over
f: Fu: X