diff --git a/docs/conceptual/collections.set-module-[fsharp].md b/docs/conceptual/collections.set-module-[fsharp].md
index ca21aa03..e0b0512e 100644
--- a/docs/conceptual/collections.set-module-[fsharp].md
+++ b/docs/conceptual/collections.set-module-[fsharp].md
@@ -50,8 +50,8 @@ module Set
|[isSuperset](https://msdn.microsoft.com/library/f09b4a5f-e03b-435e-82a3-927e576635f3)
**: Set<'T> -> Set<'T> -> bool**|Evaluates to **true** if all elements of the second set are in the first.|
|[iter](https://msdn.microsoft.com/library/3f10b1f1-c1c9-4a86-af37-41e9c8dd8f54)
**: ('T -> unit) -> Set<'T> -> unit**|Applies the given function to each element of the set, in order according to the comparison function.|
|[map](https://msdn.microsoft.com/library/a71c114e-5143-49a0-9fc7-adf83612742a)
**: ('T -> 'U) -> Set<'T> -> Set<'U>**|Returns a new collection containing the results of applying the given function to each element of the input set.|
-|[maxElement](https://msdn.microsoft.com/library/95ff87fd-243e-41a4-b1f8-9d6d3a9c0ad6)
**: Set<'T> -> 'T**|Returns the highest element in the set according to the ordering being used for the set.|
-|[minElement](https://msdn.microsoft.com/library/2733d7c6-e170-40e3-8c68-a65864e17da4)
**: Set<'T> -> 'T**|Returns the lowest element in the set according to the ordering being used for the set.|
+|[maxElement](https://msdn.microsoft.com/library/95ff87fd-243e-41a4-b1f8-9d6d3a9c0ad6)
**: Set<'T> -> 'T**|Returns the highest element in the set according to the ordering being used for the set. Throws **ArgumentException** if the set is empty.|
+|[minElement](https://msdn.microsoft.com/library/2733d7c6-e170-40e3-8c68-a65864e17da4)
**: Set<'T> -> 'T**|Returns the lowest element in the set according to the ordering being used for the set. Throws **ArgumentException** if the set is empty.|
|[ofArray](https://msdn.microsoft.com/library/10434aec-34c8-4101-9ec9-751533f8e3de)
**: 'T array -> Set<'T>**|Creates a set that contains the same elements as the given array.|
|[ofList](https://msdn.microsoft.com/library/bc089500-969e-402f-9162-d0a23fdd5b58)
**: 'T list -> Set<'T>**|Creates a set that contains the same elements as the given list.|
|[ofSeq](https://msdn.microsoft.com/library/5e8b5b4e-2d88-49bf-b74a-cf3ef553a888)
**: seq<'T> -> Set<'T>**|Creates a new collection from the given enumerable object.|
@@ -74,4 +74,4 @@ Windows 8, Windows 7, Windows Server 2012, Windows Server 2008 R2
Supported in: 2.0, 4.0, Portable
## See Also
-[Microsoft.FSharp.Collections Namespace (F#)](Microsoft.FSharp.Collections-Namespace-%5BFSharp%5D.md)
\ No newline at end of file
+[Microsoft.FSharp.Collections Namespace (F#)](Microsoft.FSharp.Collections-Namespace-%5BFSharp%5D.md)
diff --git a/docs/conceptual/collections.set['t]-class-[fsharp].md b/docs/conceptual/collections.set['t]-class-[fsharp].md
index 19a15e17..bf7f93e2 100644
--- a/docs/conceptual/collections.set['t]-class-[fsharp].md
+++ b/docs/conceptual/collections.set['t]-class-[fsharp].md
@@ -71,8 +71,8 @@ This type is named `FSharpSet` in compiled assemblies. If you are accessing the
|[IsProperSupersetOf](https://msdn.microsoft.com/library/4c2a373c-8a5b-494b-94a7-004a5f1333be)|Evaluates to **true** if all elements of the second set are in the first, and at least one element of the first is not in the second.|
|[IsSubsetOf](https://msdn.microsoft.com/library/2069807c-c9fe-403f-b51c-0edc043ed796)|Evaluates to **true** if all elements of the first set are in the second.|
|[IsSupersetOf](https://msdn.microsoft.com/library/07974083-5980-4f70-bad8-52b4a287b9ee)|Evaluates to **true** if all elements of the second set are in the first.|
-|[MaximumElement](https://msdn.microsoft.com/library/d7f4b139-1b41-41bf-9e23-d946d20cb512)|Returns the highest element in the set according to the ordering being used for the set.|
-|[MinimumElement](https://msdn.microsoft.com/library/8b173df1-2ab8-4bbe-83a5-3e365d104bfe)|Returns the lowest element in the set according to the ordering being used for the set.|
+|[MaximumElement](https://msdn.microsoft.com/library/d7f4b139-1b41-41bf-9e23-d946d20cb512)|Returns the highest element in the set according to the ordering being used for the set. Throws **ArgumentException** if the set is empty.|
+|[MinimumElement](https://msdn.microsoft.com/library/8b173df1-2ab8-4bbe-83a5-3e365d104bfe)|Returns the lowest element in the set according to the ordering being used for the set. Throws **ArgumentException** if the set is empty.|
|[Remove](https://msdn.microsoft.com/library/c2f6c66a-39c0-4aa9-b17b-127180dfe82d)|A useful shortcut for [Set.remove](https://msdn.microsoft.com/library/812a6d19-c1f0-4c57-9cbe-15d141d64ddb). Note this operation produces a new set and does not mutate the original set. The new set will share many storage nodes with the original.|
## Static Members
@@ -96,4 +96,4 @@ Supported in: 2.0, 4.0, Portable
[Microsoft.FSharp.Collections Namespace (F#)](Microsoft.FSharp.Collections-Namespace-%5BFSharp%5D.md)
-[Collections.Set Module (F#)](Collections.Set-Module-%5BFSharp%5D.md)
\ No newline at end of file
+[Collections.Set Module (F#)](Collections.Set-Module-%5BFSharp%5D.md)