Documentation
Determinize
.
Proof
.
FiniteModel
.
SparseRow
Search
return to top
source
Imports
Init
Determinize.Proof.FiniteModel.Replay
Imported by
Determinize
.
Finite
.
Builder
.
sparseEdges
Determinize
.
Finite
.
Builder
.
sparseEdges_weight
Determinize
.
Finite
.
Builder
.
sparseEdges_valid
Determinize
.
Finite
.
Builder
.
sum_list_comm
source
def
Determinize
.
Finite
.
Builder
.
sparseEdges
{
n
:
ℕ
}
(
weight
:
Fin
n
→
ℚ
)
:
Array
Edge
Equations
One or more equations did not get rendered due to their size.
Instances For
source
theorem
Determinize
.
Finite
.
Builder
.
sparseEdges_weight
{
n
:
ℕ
}
(
weight
:
Fin
n
→
ℚ
)
(
nonnegative
:
∀ (
j
:
Fin
n
),
0
≤
weight
j
)
(
j
:
Fin
n
)
:
(
List.map
(fun (
edge
:
Edge
) =>
if
edge
.
target
=
↑
j
then
edge
.
probability
else
0
)
(
sparseEdges
weight
)
.
toList
)
.
sum
=
weight
j
source
theorem
Determinize
.
Finite
.
Builder
.
sparseEdges_valid
{
n
:
ℕ
}
(
weight
:
Fin
n
→
ℚ
)
:
(
List.map
Edge.target
(
sparseEdges
weight
)
.
toList
)
.
Nodup
∧
∀
edge
∈
(
sparseEdges
weight
)
.
toList
,
edge
.
target
<
n
∧
0
<
edge
.
probability
source
theorem
Determinize
.
Finite
.
Builder
.
sum_list_comm
{
n
:
ℕ
}
(
outcomes
:
List
(
ℚ
×
State
)
)
(
f
:
Fin
n
→
ℚ
×
State
→
ℚ
)
:
∑
j
:
Fin
n
,
(
List.map
(
f
j
)
outcomes
)
.
sum
=
(
List.map
(fun (
out
:
ℚ
×
State
) =>
∑
j
:
Fin
n
,
f
j
out
)
outcomes
)
.
sum