Documentation
Atlas
.
BooleanFunctions
.
code
.
NoisyHypercube
Search
return to top
source
Imports
Init
Atlas.BooleanFunctions.code.FourierExpansion
Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset
Imported by
BooleanFourier
.
correlatedPairProb
BooleanFourier
.
correlatedProb
BooleanFourier
.
correlatedProb_factor_nonneg
BooleanFourier
.
correlatedProb_factor_sum
BooleanFourier
.
NoisyHypercube
BooleanFourier
.
noisyHypercubeTransitionProb
BooleanFourier
.
NoisyHypercube
.
transitionProb
BooleanFourier
.
noiseOpProb
source
noncomputable def
BooleanFourier
.
correlatedPairProb
(
ρ
:
ℝ
)
(
_hρ
:
ρ
∈
Set.Icc
(-
1
)
1
)
(
a
b
:
Bool
)
:
ℝ
Instances For
source
noncomputable def
BooleanFourier
.
correlatedProb
{
n
:
ℕ
}
(
ρ
:
ℝ
)
(
_hρ
:
ρ
∈
Set.Icc
(-
1
)
1
)
(
x
y
:
Fin
n
→
Bool
)
:
ℝ
Instances For
source
theorem
BooleanFourier
.
correlatedProb_factor_nonneg
{
n
:
ℕ
}
(
ρ
:
ℝ
)
(
hρ
:
ρ
∈
Set.Icc
(-
1
)
1
)
(
x
y
:
Fin
n
→
Bool
)
(
i
:
Fin
n
)
:
0
≤
(
1
+
ρ
*
(
boolToReal
(
x
i
)
*
boolToReal
(
y
i
)
))
/
2
source
theorem
BooleanFourier
.
correlatedProb_factor_sum
{
n
:
ℕ
}
(
ρ
:
ℝ
)
(
x
:
Fin
n
→
Bool
)
(
i
:
Fin
n
)
:
∑
b
:
Bool
, (
1
+
ρ
*
(
boolToReal
(
x
i
)
*
boolToReal
b
))
/
2
=
1
source
structure
BooleanFourier
.
NoisyHypercube
:
Type
n :
ℕ
ρ :
ℝ
hρ_nonneg :
0
≤
self
.
ρ
hρ_le_one :
self
.
ρ
≤
1
Instances For
source
noncomputable def
BooleanFourier
.
noisyHypercubeTransitionProb
{
n
:
ℕ
}
(
ρ
:
ℝ
)
(
_hρ₀
:
0
≤
ρ
)
(
_hρ₁
:
ρ
≤
1
)
(
x
y
:
Fin
n
→
Bool
)
:
ℝ
Instances For
source
noncomputable def
BooleanFourier
.
NoisyHypercube
.
transitionProb
(
G
:
NoisyHypercube
)
(
x
y
:
Fin
G
.
n
→
Bool
)
:
ℝ
Instances For
source
noncomputable def
BooleanFourier
.
noiseOpProb
{
n
:
ℕ
}
(
ρ
:
ℝ
)
(
f
:
(
Fin
n
→
Bool
)
→
ℝ
)
:
(
Fin
n
→
Bool
)
→
ℝ
Instances For