Two DFA intersection emptiness connections to SETH & L vs P (re "fine grained complexity") Wehar has proved that 


  Two DFA intersection emptiness in $O(n^{2-\epsilon})$ time → SETH false. 


does anyone see any particular key proof difficulty, challenge, implication etc in the inverse of that? ie 


  if two DFA intersection emptiness is $\Omega(n^2)$ then SETH is true?


this two DFA intersection emptiness problem seems like a key problem to analyze/ resolve because Wehar has also shown that solving the intersection problem for $k$ DFA's in $n^{o(k)}$ time → $NL \subsetneq P$. (are there any other known problems like that? which relate L,P,NP,ExpTime?) the problem also seems similar to an old important problem complete for ExpSpace analyzed by Meyer/ Stockmeyer, "emptiness of regular expressions with squaring."

also, what is known on the best lower space bounds on this problem? (will regard partial answers on these presumably hard questions as ok.)
The "inverse" is almost the same as


  SAT is solvable in $O(2^{(1-\epsilon)n})$ time implies the intersection problem is solvable in
  $O(n^{2-\epsilon})$ time.


To show this, it seems that you would need to provide a reduction from an intersection problem instance of size $n$ to a SAT instance of size $2\cdot log_2(n)$.

This kind of reduction would be very interesting because it would take an instance of one problem to a much smaller instance of another problem.  As a result, this reduction would not be one-to-one.  Actually, there would be exponentially many inputs that map to the same output.

If you know of any interesting reductions of this form, please provide a reference.  Thank you.  :)