PropertyT.jl/src/PropertyT.jl

187 lines
5.3 KiB
Julia

__precompile__()
module PropertyT
using AbstractAlgebra
using Groups
using GroupRings
import AbstractAlgebra: Group, GroupElem, Ring, perm
using JLD
using JuMP
using MathProgBase
exists(fname::String) = isfile(fname) || islink(fname)
filename(prefix, s::Symbol) = filename(prefix, Val{s})
@eval begin
for (s,n) in [
[:pm, "pm.jld"],
[, "delta.jld"],
[, "lambda.jld"],
[:P, "SDPmatrix.jld"],
[:warm, "warmstart.jld"],
[:Uπs, "U_pis.jld"],
[:orb, "orbits.jld"],
[:preps,"preps.jld"],
[:fulllog, "full_$(string(now())).log"],
[:solverlog, "solver_$(string(now())).log"]
]
filename(prefix::String, ::Type{Val{$:(s)}}) = joinpath(prefix, :($n))
end
end
function Laplacian(name::String, G::Group)
if exists(filename(name, )) && exists(filename(name, :pm))
RG = GroupRing(G, load(filename(name, :pm), "pm"))
Δ = GroupRingElem(load(filename(name, ), "Δ")[:, 1], RG)
else
throw("You need to precompute $(filename(name, :pm)) and $(filename(name, )) to load it!")
end
return Δ
end
function Laplacian{T<:GroupElem}(S::Vector{T}, Id::T; radius::Int=2)
info("Generating metric ball of radius $radius...")
@time E_R, sizes = Groups.generate_balls(S, Id, radius=2*radius)
info("Generated balls of sizes $sizes.")
info("Creating product matrix...")
@time pm = GroupRings.create_pm(E_R, GroupRings.reverse_dict(E_R), sizes[radius]; twisted=true)
RG = GroupRing(parent(Id), E_R, pm)
Δ = spLaplacian(RG, S)
return Δ
end
function λandP(name::String)
λ_fname = filename(name, )
P_fname = filename(name, :P)
if exists(λ_fname) && exists(P_fname)
λ = load(λ_fname, "λ")
P = load(P_fname, "P")
else
throw("You need to precompute $λ_fname and $P_fname to load it!")
end
return λ, P
end
function λandP(name::String, SDP::JuMP.Model, varλ, varP, warmstart=true)
if warmstart && isfile(filename(name, :warm))
ws = load(filename(name, :warm), "warmstart")
else
ws = nothing
end
function f()
Base.Libc.flush_cstdio()
λ, P, w = solve_SDP(SDP, varλ, varP, warmstart=ws)
Base.Libc.flush_cstdio()
return λ, P, w
end
solverlog = open(filename(name, :solverlog),"a+")
λ, P, warmstart = redirect_stdout(f, solverlog)
close(solverlog)
if λ > 0
save(filename(name, ), "λ", λ)
save(filename(name, :P), "P", P)
save(filename(name, :warm), "warmstart", warmstart)
else
throw(ErrorException("Solver did not produce a valid solution: λ = "))
end
return λ, P
end
Kazhdan(λ::Number,N::Integer) = sqrt(2*λ/N)
function check_property_T(name::String, S, Id, solver, upper_bound, tol, radius, warm::Bool=false)
isdir(name) || mkdir(name)
if exists(filename(name, :pm)) && exists(filename(name, ))
# cached
info("Loading precomputed Δ...")
Δ = Laplacian(name, parent(S[1]))
else
# compute
Δ = Laplacian(S, Id, radius=radius)
save(filename(name, :pm), "pm", parent(Δ).pm)
save(filename(name, ), "Δ", Δ.coeffs)
end
fullpath = joinpath(name, string(upper_bound))
isdir(fullpath) || mkdir(fullpath)
files_exist = exists(filename(fullpath, )) && exists(filename(fullpath, :P))
if !(warm) && files_exist
info("Loading precomputed λ, P...")
λ, P = λandP(fullpath)
else
info("Creating SDP problem...")
SDP_problem, varλ, varP = create_SDP_problem(Δ, constraints(parent(Δ).pm), upper_bound=upper_bound)
JuMP.setsolver(SDP_problem, solver)
info(Base.repr(SDP_problem))
if warm && isfile(filename(name, :warm))
ws = load(filename(name, :warm), "warmstart")
else
ws = nothing
end
@time λ, P, ws = λandP(SDP_problem, varλ, varP, warmstart=ws, solverlog=filename(name, :solverlog))
if λ > 0
save(filename(name, ), "λ", λ)
save(filename(name, :P), "P", P)
save(filename(name, :warm), "warmstart", ws)
else
throw(ErrorException("Solver did not produce a valid solution: λ = "))
end
end
info("λ = ")
info("sum(P) = $(sum(P))")
info("maximum(P) = $(maximum(P))")
info("minimum(P) = $(minimum(P))")
isapprox(eigvals(P), abs.(eigvals(P)), atol=tol) ||
warn("The solution matrix doesn't seem to be positive definite!")
return interpret_results(name, S, radius, λ, P)
end
function interpret_results(name, S, radius, λ, P)
RG = GroupRing(parent(first(S)), load(filename(name, :pm), "pm"))
Δ = GroupRingElem(load(filename(name, ), "Δ")[:, 1], RG)
@time Q = real(sqrtm(Symmetric(P)))
sgap = distance_to_cone(Δ, λ, Q, wlen=2*radius)
if sgap > 0
Kazhdan_κ = Kazhdan(sgap, length(S))
if Kazhdan_κ > 0
info("κ($name, S) ≥ $Kazhdan_κ: Group HAS property (T)!")
return true
end
end
info("λ($name, S) ≥ $sgap < 0: Tells us nothing about property (T)")
return false
end
include("SDPs.jl")
include("CheckSolution.jl")
include("Orbit-wise.jl")
end # module Property(T)