Trivial join dependency

I’m struggling to comprehend how to “operate” with join dependencies, so I have a query that I hope will help me make sense of it all.

Wikipedia’s basic definition is as follows:

A table T is subject to a join dependency if T can always be recreated by joining multiple tables each having a subset of the attributes of T.

The definition of a trivial join dependence is as follows:

If one of the tables in the join has all the attributes of table T, the join dependency is called trivial.

Is it feasible that every join dependence of a relation R might be a simple join dependency if we collapse it into a lossless decomposition? Awesome would be one illustration.