diff --git a/base/linalg/lu.jl b/base/linalg/lu.jl
index 67cc4dd81dbdb..bb11de6f77fd4 100644
--- a/base/linalg/lu.jl
+++ b/base/linalg/lu.jl
@@ -112,6 +112,7 @@ The relationship between `F` and `A` is
 |:---------------------------------|:-----|:-----------------------|
 | [`/`](@ref)                      | ✓    |                        |
 | [`\\`](@ref)                     | ✓    | ✓                      |
+| [`inv`](@ref)                    | ✓    | ✓                      |
 | [`det`](@ref)                    | ✓    | ✓                      |
 | [`logdet`](@ref)                 | ✓    | ✓                      |
 | [`logabsdet`](@ref)              | ✓    | ✓                      |
diff --git a/base/linalg/qr.jl b/base/linalg/qr.jl
index b879ed801b780..2d6d723adefe1 100644
--- a/base/linalg/qr.jl
+++ b/base/linalg/qr.jl
@@ -238,7 +238,7 @@ The individual components of the factorization `F` can be accessed by indexing w
  - `F[:p]`: the permutation vector of the pivot ([`QRPivoted`](@ref) only)
  - `F[:P]`: the permutation matrix of the pivot ([`QRPivoted`](@ref) only)
 
-The following functions are available for the `QR` objects: [`size`](@ref)
+The following functions are available for the `QR` objects: [`inv`](@ref), [`size`](@ref),
 and [`\\`](@ref). When `A` is rectangular, `\\` will return a least squares
 solution and if the solution is not unique, the one with smallest norm is returned.
 
diff --git a/base/sparse/cholmod.jl b/base/sparse/cholmod.jl
index a8688986ed90a..2d812d07bba85 100644
--- a/base/sparse/cholmod.jl
+++ b/base/sparse/cholmod.jl
@@ -1511,7 +1511,7 @@ have the type tag, it must still be symmetric or Hermitian.
 A fill-reducing permutation is used. `F = ldltfact(A)` is most frequently
 used to solve systems of equations `A*x = b` with `F\\b`. The returned
 factorization object `F` also supports the methods [`diag`](@ref),
-[`det`](@ref), and [`logdet`](@ref).
+[`det`](@ref), [`logdet`](@ref), and [`inv`](@ref).
 You can extract individual factors from `F` using `F[:L]`.
 However, since pivoting is on by default, the factorization is internally
 represented as `A == P'*L*D*L'*P` with a permutation matrix `P`;