diff --git a/theories/algebra/agree.v b/theories/algebra/agree.v
index 5f699ec7d99da58c4c51bdb0b707b96fd44b418c..13f87dbf6674418debcb39b0ae5dfde0725eb72d 100644
--- a/theories/algebra/agree.v
+++ b/theories/algebra/agree.v
@@ -6,6 +6,27 @@ Local Arguments valid _ _  !_ /.
 Local Arguments op _ _ _ !_ /.
 Local Arguments pcore _ _ !_ /.
 
+(** Define an agreement construction such that Agree A is discrete when A is discrete.
+    Notice that this construction is NOT complete.  The fullowing is due to Aleš:
+
+
+Proposition: Ag(T) is not necessarily complete.
+Proof.
+  Let T be the set of binary streams (infinite sequences) with the usual
+  ultrametric, measuring how far they agree.
+
+  Let Aâ‚™ be the set of all binary strings of length n. Thus for Aâ‚™ to be a
+  subset of T we have them continue as a stream of zeroes.
+
+  Now Aâ‚™ is a finite non-empty subset of T. Moreover {Aâ‚™} is a Cauchy sequence
+  in the defined (Hausdorff) metric.
+
+  However the limit (if it were to exist as an element of Ag(T)) would have to
+  be the set of all binary streams, which is not exactly finite.
+
+  Thus Ag(T) is not necessarily complete.
+*)
+
 Record agree (A : Type) : Type := Agree {
   agree_car : A;
   agree_with : list A;